Q&A What

What is the 10th power?

Author: Calculator Academy Team

Last Updated: November 1, 2021

Enter any number into the calculator and the calculator will raise that number to the 10th power.

10th Power Formula

The following formula is used to calculate the 10th power of any number.

Y = X^10

  • Where Y is the resulting value
  • X is the numer being raised to the 10th power

10th Power Definition

Raising a number to the 10th power means multiplying that number by itself 10 times. For example, 5 to the 10th power would equal 5*5*5*5*5*5*5*5*5*5= 9765625.

How to raise a number to the 10th power?

Example problem #1:

For this first example problem, we will be raising the number 4 to the 10th power.

Using the formula above:

Y = X^10

= 4^10

= 4*4*4*4*4*4*4*4*4*4

= 1048576

Example Problem #2

In this next example, we will raise the number 2 to the 10th power.

Using the formula:

Y= X^10

= 2^10

= 1024

What is interesting to note about this result is that even though 2 is only half of 4, when it’s raised to the 10th power, the result is 1024 times less than 4 to the 10th power.

In order to continue enjoying our site, we ask that you confirm your identity as a human. Thank you very much for your cooperation.

The powers of 10 are easy to remember, because we use a base 10 number system.

For 10 n with n a positive integer, just write a " 1 " with n zeros after it. For negative powers 10 − n , write " 0 ." followed by n − 1 zeros, and then a 1 .

The powers of 10 are widely used in scientific notation , so it's a good idea to get comfortable with them.

Powers of 10

10 1 = 10 10 1 = 1
10 2 = 100 10 -1 = 0.1
10 3 = 1000 10 -2 = 0.01
10 4 = 10,000 10 -3 = 0.001

10 5 = 100,000

(one hundred thousand)

10 -4 = 0.0001

(one ten thousandth)

10 6 = 1,000,000

(one million)

10 -5 = 0.00001

(one hundred thousandth)

10 7 = 10,000,000

(ten million)

10 -6 = 0.000001

(one millionth)

10 8 = 100,000,000

(one hundred million)

10 -7 = 0.0000001

(one ten millionth)

10 9 = 1,000,000,000

(one billion)

10 -8 = 0.00000001

(one hundred millionth)

10 10 = 10,000,000,000

(ten billion)

10 -9 = 0.000000001

(one billionth)

Click here for more names for really big and really small numbers .

This article is about the mathematical concept. For other uses, see Power of 10 (disambiguation).

A power of 10 is any of the integer powers of the number ten; in other words, ten multiplied by itself a certain number of times (when the power is a positive integer). By definition, the number one is a power (the zeroth power) of ten. The first few non-negative powers of ten are:

Visualisation of powers of 10 from one to 1 billion.

1, 10, 100, 1,000, 10,000, 100,000, 1,000,000, 10,000,000. ... (sequence A011557 in the OEIS)

In decimal notation the nth power of ten is written as '1' followed by n zeroes. It can also be written as 10n or as 1En in E notation. See order of magnitude and orders of magnitude (numbers) for named powers of ten. There are two conventions for naming positive powers of ten, beginning with 109, called the long and short scales. Where a power of ten has different names in the two conventions, the long scale name is shown in parentheses.

The positive 10 power related to a short scale name can be determined based on its Latin name-prefix using the following formula: 10[(prefix-number + 1) × 3]

Examples:

  • billion = 10[(2 + 1) × 3] = 109
  • octillion = 10[(8 + 1) × 3] = 1027
Name Power Number SI symbol SI prefix
one 0 1
ten 1 10 da (D) deca
hundred 2 100 h (H) hecto
thousand 3 1,000 k (K) kilo
ten thousand (myriad (Greek)) 4 10,000
hundred thousand (lakh (India)) 5 100,000
million 6 1,000,000 M mega
ten million (crore (India)) 7 10,000,000
hundred million 8 100,000,000
billion (milliard) 9 1,000,000,000 G giga
trillion (billion) 12 1,000,000,000,000 T tera
quadrillion (billiard) 15 1,000,000,000,000,000 P peta
quintillion (trillion) 18 1,000,000,000,000,000,000 E exa
sextillion (trilliard) 21 1,000,000,000,000,000,000,000 Z zetta
septillion (quadrillion) 24 1,000,000,000,000,000,000,000,000 Y yotta
octillion (quadrilliard) 27 1,000,000,000,000,000,000,000,000,000
nonillion (quintillion) 30 1,000,000,000,000,000,000,000,000,000,000
decillion (quintilliard) 33 1,000,000,000,000,000,000,000,000,000,000,000
undecillion (sextillion) 36 1,000,000,000,000,000,000,000,000,000,000,000,000
duodecillion (sextilliard) 39 1,000,000,000,000,000,000,000,000,000,000,000,000,000
tredecillion (septillion) 42 1,000,000,000,000,000,000,000,000,000,000,000,000,000,000
quattuordecillion (septilliard) 45 1,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000
quindecillion (octillion) 48 1,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000
sexdecillion (octilliard) 51 1,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000
septendecillion (nonillion) 54 1,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000
octodecillion (nonilliard) 57 1,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000
novemdecillion (decillion) 60 1,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000
vigintillion (decilliard) 63 1,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000
unvigintillion (undecillion) 66 1,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000
duovigintillion (undecilliard) 69 1,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000
trevigintillion (duodecillion) 72 1,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000
quattuorvigintillion (duodecilliard) 75 1,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000
quinvigintillion (tredecillion) 78 1,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000
sexvigintillion (tredecilliard) 81 1,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000
septenvigintillion (quattuordecillion) 84 1,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000
octovigintillion (quattuordecilliard) 87 1,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000
novemvigintillion (quindecillion) 90 1,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000
trigintillion (quindecilliard) 93 1,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000
googol 100 10,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,
000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000
centillion 303 1,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,
000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,
000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,
000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,
000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000
googolplex googol one then 10,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,
000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000 zeros.

The sequence of powers of ten can also be extended to negative powers.

Similar to the positive powers, the negative power of 10 related to a short scale name can be determined based on its Latin name-prefix using the following formula: 10−[(prefix-number + 1) × 3]

Examples:

  • billionth = 10−[(2 + 1) × 3] = 10−9
  • quintillionth = 10−[(5 + 1) × 3] = 10−18
Name Power Number SI symbol SI prefix
one 0 1
tenth −1 0.1 d deci
hundredth −2 0.01 c centi
thousandth −3 0.001 m milli
ten-thousandth (Myriadth) −4 0.000 1
hundred-thousandth (Lacth) −5 0.000 01
millionth −6 0.000 001 μ micro
billionth −9 0.000 000 001 n nano
trillionth −12 0.000 000 000 001 p pico
quadrillionth −15 0.000 000 000 000 001 f femto
quintillionth −18 0.000 000 000 000 000 001 a atto
sextillionth −21 0.000 000 000 000 000 000 001 z zepto
septillionth −24 0.000 000 000 000 000 000 000 001 y yocto
octillionth −27 0.000 000 000 000 000 000 000 000 001
nonillionth −30 0.000 000 000 000 000 000 000 000 000 001
decillionth −33 0.000 000 000 000 000 000 000 000 000 000 001
undecillionth −36 0.000 000 000 000 000 000 000 000 000 000 000 001
duodecillionth −39 0.000 000 000 000 000 000 000 000 000 000 000 000 001
tredecillionth −42 0.000 000 000 000 000 000 000 000 000 000 000 000 000 001
quattuordecillionth −45 0.000 000 000 000 000 000 000 000 000 000 000 000 000 000 001
quindecillionth −48 0.000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 001
sexdecillionth −51 0.000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 001
septendecillionth −54 0.000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 001
octodecillionth −57 0.000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 001
novemdecillionth −60 0.000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 001
vigintillionth −63 0.000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 001
unvigintillionth −66 0.000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 001
duovigintillionth −69 0.000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 001
trevigintillionth −72 0.000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 001
quattuorvigintillionth −75 0.000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 001
quinvigintillionth −78 0.000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 001
sexvigintillionth −81 0.000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 001
septenvigintillionth −84 0.000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 001
octovigintillionth −87 0.000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 001
novemvigintillionth −90 0.000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 001
trigintillionth −93 0.000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 001
googolth −100 0.000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 1
centillionth −303 0.000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 000 001
googolplexth −googol ten to the negative 10,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,

000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000.

Main article: Googol

The number googol is 10100. The term was coined by 9-year-old Milton Sirotta, nephew of American mathematician Edward Kasner. It was popularized in Kasner's 1940 book Mathematics and the Imagination, where it was used to compare and illustrate very large numbers. Googolplex, a much larger power of ten (10 to the googol power, or 1010100), was also introduced in that book. (Read below)

Main article: Googolplex

The number googolplex is 10googol, or 1010,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000, and was also made by Edward Kasner's nephew. (Read above)

Main article: Scientific notation

Scientific notation is a way of writing numbers of very large and very small sizes compactly when precision is less important.

A number written in scientific notation has a significand (sometime called a mantissa) multiplied by a power of ten.

Sometimes written in the form:

m × 10n

Or more compactly as:

10n

This is generally used to denote powers of 10. Where n is positive, this indicates the number of zeros after the number, and where the n is negative, this indicates the number of decimal places before the number.

As an example:

105 = 100,000[1] 10−5 = 0.00001[2]

The notation of mEn, known as E notation, is used in computer programming, spreadsheets and databases, but is not used in scientific papers.

  • Power of two
  • Power of three
  • SI prefix
  • Cosmic View, inspiration for the film Powers of Ten
  • Exponentiation
Video
  • Powers of Ten (1977). Nine-minute film. US Public Broadcasting Service (PBS), made by Charles and Ray Eames. "An adventure in magnitudes. Starting at a picnic by the lakeside in Chicago, this film transports the viewer to the outer edges of the universe. Every ten seconds we view the starting point from ten times farther out until our own galaxy is visible only as a speck of light among many others. Returning to Earth with breathtaking speed, we move inward - into the hand of the sleeping picnicker - with ten times more magnification every ten seconds. Our journey ends inside a proton of a carbon atom within a DNA molecule in a white blood cell."

  1. ^ "Powers of 10". www.mathsteacher.com.au. Retrieved 2020-03-17.
  2. ^ "Powers of Ten". hesperia.gsfc.nasa.gov. Retrieved 2020-03-17.

Retrieved from "//en.wikipedia.org/w/index.php?title=Power_of_10&oldid=1105756602"

Page 2

"1,000" and "Thousand" redirect here. For other uses, see 1000 (disambiguation).

1000 or one thousand is the natural number following 999 and preceding 1001. In most English-speaking countries, it can be written with or without a comma or sometimes a period separating the thousands digit: 1,000.

← 999 1000 1001 →

List of numbers — Integers

← 0 1k 2k 3k 4k 5k 6k 7k 8k 9k →

Cardinalone thousandOrdinal1000th
(one thousandth)Factorization23 × 53Divisors1, 2, 4, 5, 8, 10, 20, 25, 40, 50, 100, 125, 200, 250, 500, 1000Greek numeral,Α´Roman numeralMUnicode symbol(s)ↀGreek prefixchiliaLatin prefixmilliBinary11111010002Ternary11010013Senary43446Octal17508Duodecimal6B412Hexadecimal3E816Tamil௲Chinese千Punjabi੧੦੦੦

Look up thousand or 1000 in Wiktionary, the free dictionary.

It may also be described as the short thousand in historical discussion of medieval contexts where it might be confused with the Germanic concept of the "long thousand" (1200).

A period of 1,000 years is sometimes termed, after the Greek root, a chiliad. A chiliad of other objects means 1,000 of them.[1]

  • The decimal representation for one thousand is
    • 1000—a one followed by three zeros, in the general notation ;
    • 1 × 103—in engineering notation, which for this number coincides with :
    • 1 × 103 exactly—in scientific normalized exponential notation ;
    • 1 E+3 exactly—in scientific E notation.
  • The SI prefix for a thousand units is "kilo-", abbreviated to "k"—for instance, a kilometre or "km" is a thousand metres.
  • In the SI writing style, a non-breaking space can be used as a thousands separator, i.e., to separate the digits of a number at every power of 1000.
  • Multiples of thousands are occasionally represented by replacing their last three zeros with the letter "K": for instance, writing "$30K" for $30 000, or denoting the Y2K computer bug of the year 2000.
  • A thousand units of currency, especially dollars or pounds, are colloquially called a grand. In the United States of America this is sometimes abbreviated with a "G" suffix.
  • The factors of 1000 are: 1, 2, 4, 5, 8, 10, 20, 25, 40, 50, 100, 125, 200, 250, 500, and 1000.[2]
  • 1000 is a Harshad number in base 10.
  • The sum of Euler's totient function over the first 57 integers is 1000.
  • Prime Curios! mentions that 1000 is the smallest number that generates three primes in the fastest way possible by concatenation of decremented numbers (1 000 999, 1 000 999 998 997, and 1 000 999 998 997 996 995 994 993 are prime). The criterion excludes counting the number itself.[3]
1001 = sphenic number (7 × 11 × 13), pentagonal number, pentatope number 1002 = sphenic number, Mertens function zero, abundant number, number of partitions of 22 1003 = the product of some prime p and the pth prime, namely p = 17. 1004 = heptanacci number[4] 1005 = Mertens function zero, decagonal pyramidal number[5] 1006 = number that is the sum of 7 positive 5th powers[6] 1007 = number that is the sum of 8 positive 5th powers[7] 1008 = divisible by the number of primes below it 1009 = smallest four-digit prime, palindromic in bases 11, 15, 19, 24 and 28: (83811, 47415, 2F219, 1I124, 18128). It is also a Lucky prime. 1010 = 103 + 10,[8] Mertens function zero 1011 = the largest n such that 2n contains 101 and doesn't contain 11011, Harshad number in bases 5, 10, 15, 20, 25, 30, 35, 40, 45, 50, 55, 60, 65, 70, 75 (and 202 other bases), number of partitions of 1 into reciprocals of positive integers <= 16 Egyptian fraction[9] 1012 = ternary number, (3210) quadruple triangular number (triangular number is 253),[10] number of partitions of 1 into reciprocals of positive integers <= 17 Egyptian fraction[9] 1013 = Sophie Germain prime,[11] centered square number,[12] Mertens function zero 1014 = 210-10,[13] Mertens function zero, sum of the nontriangular numbers between successive triangular numbers 1015 = square pyramidal number[14] 1016 = member of the Mian–Chowla sequence,[15] stella octangula number, number of cubes of edge length 1 required to make a hollow cube of edge length 14 1017 = generalized triacontagonal number[16] 1018 = Mertens function zero, 101816 + 1 is prime[17] 1019 = Sophie Germain prime,[11] safe prime[18] 1020 = polydivisible number 1021 = twin prime with 1019. It is also a Lucky prime. 1022 = Friedman number 1023 = the highest number one can count to on one's fingers using binary; number of compositions of 12 whose run-lengths are either weakly increasing or weakly decreasing;[19] also the magic number used in Global Positioning System signals. 1024 = 322 = 45 = 210, the number of bytes in a kilobyte (in 1999, the IEC coined kibibyte to use for 1024 with kilobyte being 1000, but this convention has not been widely adopted). 1024 is the smallest 4-digit square and also a Friedman number. 1025 = Proth number 210 + 1; member of Moser–de Bruijn sequence, because its base-4 representation (1000014) contains only digits 0 and 1, or it's a sum of distinct powers of 4 (45 + 40); Jacobsthal-Lucas number; hypotenuse of primitive Pythagorean triangle 1026 = sum of two distinct powers of 2 (1024 + 2) 1027 = sum of the squares of the first eight primes; can be written from base 2 to base 18 using only the digits 0 to 9. 1028 = sum of totient function for first 58 integers; can be written from base 2 to base 18 using only the digits 0 to 9; number of primes <= 213.[20] 1029 = can be written from base 2 to base 18 using only the digits 0 to 9. 1030 = generalized heptagonal number 1031 = exponent and number of ones for the largest proven base-10 repunit prime,[21] Sophie Germain prime,[11] super-prime 1032 = sum of two distinct powers of 2 (1024 + 8) 1033 = emirp, twin prime with 1031 1034 = sum of 12 positive 9th powers[22] 1035 = triangular number,[23] hexagonal number[24] 1036 = central polygonal number[25] 1037 = number in E-toothpick sequence[26] 1038 = even integer that is an unordered sum of two primes in exactly n ways[27] 1039 = prime of the form 8n+7,[28] number of partitions of 30 that do not contain 1 as a part[29] 1040 = sum of distinct powers of 4[30] 1041 = sum of 11 positive 5th powers[31] 1042 = sum of 12 positive 5th powers[32] 1043 = number whose sum of even digits and sum of odd digits are even[33] 1044 = sum of distinct powers of 4[30] 1045 = octagonal number[34] 1046 = coefficient of f(q) (3rd order mock theta function)[35] 1047 = number of ways to split a strict composition of n into contiguous subsequences that have the same sum[36] 1048 = number of partitions of n into squarefree parts[37] 1049 = Sophie Germain prime,[11] highly cototient number[38] 1050 = 10508 to decimal becomes a pronic number (55210),[39] number of parts in all partitions of 29 into distinct parts[40] 1051 = centered pentagonal number,[41] centered decagonal number 1052 = number that is the sum of 9 positive 6th powers[42] 1053 = triangular matchstick number[43] 1054 = centered triangular number[44] 1055 = number that is the sum of 12 positive 6th powers[45] 1056 = pronic number[46] 1057 = central polygonal number[47] 1058 = number that is the sum of 4 positive 5th powers,[48] area of a square with diagonal 46[49] 1059 = number n such that n4 is written in the form of a sum of four positive 4th powers[50] 1060 = sum of the first 25 primes 1061 = emirp, twin prime with 1063 1062 = number that is not the sum of two palindromes[51] 1063 = super-prime, sum of seven consecutive primes (137 + 139 + 149 + 151 + 157 + 163 + 167); near-wall-sun-sun prime[52] 1064 = sum of two positive cubes[53] 1065 = generalized duodecagonal[54] 1066 = number whose sum of their divisors is a square[55] 1067 = number of strict integer partitions of n in which are empty or have smallest part not dividing the other ones[56] 1068 = number that is the sum of 7 positive 5th powers,[6] total number of parts in all partitions of 15[57]1069 = emirp[58] 1070 = number that is the sum of 9 positive 5th powers[59] 1071 = heptagonal number[60] 1072 = centered heptagonal number[61] 1073 = number that is the sum of 12 positive 5th powers[32] 1074 = number that is not the sum of two palindromes[51] 1075 = number non-sum of two palindromes[51] 1076 = number of strict trees weight n[62] 1077 = number where 7 outnumbers every other digit in the number[63] 1078 = Euler transform of negative integers[64] 1079 = every positive integer is the sum of at most 1079 tenth powers. 1080 = pentagonal number[65] 1081 = triangular number,[23] member of Padovan sequence[66] 1082 = central polygonal number[25] 1083 = three-quarter square,[67] number of partitions of 53 into prime parts 1084 = third spoke of a hexagonal spiral,[68] 108464 + 1 is prime 1085 = number of partitions of n into distinct parts > or = 2[69] 1086 = Smith number,[70] sum of totient function for first 59 integers 1087 = super-prime, cousin prime, lucky prime[71] 1088 = octo-triangular number, (triangular number result being 136)[72] sum of two distinct powers of 2, (1024 + 64)[73] number that is divisible by exactly seven primes with the inclusion of multiplicity[74] 1089 = 332, nonagonal number, centered octagonal number, first natural number whose digits in its decimal representation get reversed when multiplied by 9.[75] 1090 = sum of 5 positive 5th powers[76] 1091 = cousin prime and twin prime with 1093 1092 = divisible by the number of primes below it 1093 = the smallest Wieferich prime (the only other known Wieferich prime is 3511[77]), twin prime with 1091 and star number[78] 1094 = sum of 9 positive 5th powers,[59] 109464 + 1 is prime 1095 = sum of 10 positive 5th powers,[79] number that is not the sum of two palindromes 1096 = hendecagonal number,[80] number of strict solid partitions of 18[81] 1097 = emirp[58] 1098 = multiple of 9 containing digit 9 in its base-10 representation[82] 1099 = number where 9 outnumbers every other digit[83] 1100 = number of partitions of 61 into distinct squarefree parts[84] 1101 = pinwheel number[85] 1102 = sum of totient function for first 60 integers 1103 = Sophie Germain prime,[11] balanced prime[86] 1104 = Keith number[87] 1105 = 332 + 42 = 322 + 92 = 312 + 122 = 232 + 242, Carmichael number,[88] magic constant of n × n normal magic square and n-queens problem for n = 13, decagonal number,[89] centered square number,[12] Fermat pseudoprime[90] 1106 = number of regions into which the plane is divided when drawing 24 ellipses[91] 1107 = number of non-isomorphic strict T0 multiset partitions of weight 8[92] 1108 = number k such that k64 + 1 is prime 1109 = Friedlander-Iwaniec prime[93] 1110 = k such that 2k + 3 is prime[94] 1111 = repdigit 1112 = k such that 9k - 2 is a prime[95] 1113 = number of strict partions of 40[96] 1114 = number of ways to write 22 as an orderless product of orderless sums[97] 1115 = number of partitions of 27 into a prime number of parts[98] 1116 = divisible by the number of primes below it 1117 = number of diagonally symmetric polyominoes with 16 cells[99] 1118 = number of unimodular 2 × 2 matrices having all terms in {0,1,...,21}[100] 1119 = number of bipartite graphs with 9 nodes[101] 1120 = number k such that k64 + 1 is prime 1121 = number of squares between 342 and 344.[102] 1122 = pronic number,[46] divisible by the number of primes below it 1123 = balanced prime[86] 1124 = Leyland number[103] 1125 = Achilles number 1128 = triangular number,[23] hexagonal number,[24] divisible by the number of primes below it 1129 = number of lattice points inside a circle of radius 19[104] 1130 = skiponacci number[105] 1131 = number of edges in the hexagonal triangle T(26)[106] 1134 = divisible by the number of primes below it, triangular matchstick number[107] 1135 = centered triangular number[108] 1136 = number of independent vertex sets and vertex covers in the 7-sunlet graph[109] 1137 = sum of values of vertices at level 5 of the hyperbolic Pascal pyramid[110] 1138 = recurring number in the works of George Lucas and his companies, beginning with his first feature film – THX 1138; particularly, a special code for Easter eggs on Star Wars DVDs. 1140 = tetrahedral number[111] 1141 = 7-Knödel number[112] 1142 = n such that n32 + 1 is prime[113] 1151 = first prime following a prime gap of 22.[114] 1152 = highly totient number,[115] 3-smooth number (27×32), area of a square with diagonal 48,[49] Achilles number 1153 = super-prime, Proth prime[116] 1154 = 2 × 242 + 2 = number of points on surface of tetrahedron with edgelength 24[117] 1155 = number of edges in the join of two cycle graphs, both of order 33[118] 1156 = 342, octahedral number,[119] centered pentagonal number,[41] centered hendecagonal number.[120] 1158 = number of points on surface of octahedron with edgelength 17[121] 1159 = member of the Mian–Chowla sequence,[15] a centered octahedral number[122] 1160 = octagonal number[123] 1161 = sum of the first 26 primes 1162 = pentagonal number,[65] sum of totient function for first 61 integers 1163 = smallest prime > 342.[124] See Legendre's conjecture. 1166 = heptagonal pyramidal number[125] 1169 = highly cototient number[38] 1170 = highest possible score in a National Academic Quiz Tournaments (NAQT) match 1171 = super-prime 1174 = number of widely totally strongly normal compositions of 16 1176 = triangular number[23] 1177 = heptagonal number[60] 1178 = number of cubes of edge length 1 required to make a hollow cube of edge length 15 1183 = pentagonal pyramidal number 1184 = amicable number with 1210[126] 1185 = number of partitions of 45 into pairwise relatively prime parts[127] 1186 = number of diagonally symmetric polyominoes with 15 cells,[128] number of partitions of 54 into prime parts 1187 = safe prime,[18] Stern prime,[129] balanced prime[86] 1189 = number of squares between 352 and 354.[130] 1190 = pronic number[46] 1191 = 352 - 35 + 1 = H35 (the 35th Hogben number)[131] 1192 = sum of totient function for first 62 integers 1193 = a number such that 41193 - 31193 is prime 1197 = pinwheel number[132] 1198 = centered heptagonal number[61] 1199 = area of the 20th conjoined trapezoid[133] 1200 = the long thousand, ten "long hundreds" of 120 each, the traditional reckoning of large numbers in Germanic languages, the number of households the Nielsen ratings sample,[134] number k such that k64 + 1 is prime 1201 = centered square number,[12] super-prime, centered decagonal number 1205 = number of partitions of 28 such that the number of odd parts is a part[135] 1210 = amicable number with 1184[136] 1213 = emirp 1214 = sum of first 39 composite numbers[137] 1215 = number of edges in the hexagonal triangle T(27)[138] 1216 = nonagonal number[139] 1217 = super-prime, Proth prime[116] 1218 = triangular matchstick number[107] 1219 = Mertens function zero, centered triangular number[140] 1220 = Mertens function zero, number of binary vectors of length 16 containing no singletons[141] 1222 = hexagonal pyramidal number 1223 = Sophie Germain prime,[11] balanced prime, 200th prime number[86] 1224 = number of edges in the join of two cycle graphs, both of order 34[142] 1225 = 352, square triangular number,[143] hexagonal number,[24] centered octagonal number[144] 1228 = sum of totient function for first 63 integers 1229 = Sophie Germain prime,[11] number of primes between 0 and 10000 1230 = the Mahonian number: T(9, 6)[145] 1233 = 122 + 332 1234 = number of parts in all partitions of 30 into distinct parts[146] 1236 = 617 + 619: sum of twin prime pair[147] 1237 = prime of the form 2p-1 1238 = number of partitions of 31 that do not contain 1 as a part[29] 1240 = square pyramidal number[14] 1241 = centered cube number[148] 1242 = decagonal number[89] 1244 = number of complete partitions of 25[149] 1247 = pentagonal number[65] 1249 = emirp, trimorphic number[150] 1250 = area of a square with diagonal 50[49] 1251 = 2 × 252 + 1 = number of different 2 × 2 determinants with integer entries from 0 to 25[151] 1252 = 2 × 252 + 2 = number of points on surface of tetrahedron with edgelength 25[152] 1253 = number of partitions of 23 with at least one distinct part[153] 1255 = Mertens function zero, number of ways to write 23 as an orderless product of orderless sums,[154] number of partitions of 23[155] 1256 = Mertens function zero 1257 = number of lattice points inside a circle of radius 20[156] 1258 = Mertens function zero 1259 = highly cototient number[38] 1260 = highly composite number,[157] pronic number,[46] the smallest vampire number,[158] sum of totient function for first 64 integers, number of strict partions of 41[159] and appears twice in the Book of Revelation 1261 = star number,[78] Mertens function zero 1262 = maximal number of regions the plane is divided into by drawing 36 circles[160] 1264 = sum of the first 27 primes 1266 = centered pentagonal number,[41] Mertens function zero 1267 = 7-Knödel number[161] 1268 = number of partitions of 37 into prime power parts[162] 1270 = Mertens function zero 1271 = sum of first 40 composite numbers[163] 1274 = sum of the nontriangular numbers between successive triangular numbers 1275 = triangular number,[23] sum of the first 50 natural numbers 1278 = number of Narayana's cows and calves after 20 years[164] 1279 = Mertens function zero, Mersenne prime exponent 1280 = Mertens function zero, number of parts in all compositions of 9.[165] 1281 = octagonal number[166] 1282 = Mertens function zero, number of partitions of 46 into pairwise relatively prime parts[167] 1283 = safe prime[18] 1284 = 641 + 643: sum of twin prime pair[168] 1285 = Mertens function zero, number of free nonominoes, number of parallelogram polyominoes with 10 cells.[169] 1288 = heptagonal number[60] 1289 = Sophie Germain prime,[11] Mertens function zero 1291 = Mertens function zero 1292 = Mertens function zero 1295 = number of edges in the join of two cycle graphs, both of order 35[170] 1296 = 362 = 64, sum of the cubes of the first eight positive integers, the number of rectangles on a normal 8 × 8 chessboard, also the maximum font size allowed in Adobe InDesign 1297 = super-prime, Mertens function zero, pinwheel number[171] 1298 = number of partitions of 55 into prime parts 1299 = Mertens function zero 1300 = Sum of the first 4 fifth powers, mertens function zero, largest possible win margin in an NAQT match 1301 = centered square number,[12] Honaker prime[172] 1302 = Mertens function zero, number of edges in the hexagonal triangle T(28)[173] 1305 = triangular matchstick number[107] 1306 = Mertens function zero. In base 10, raising the digits of 1306 to powers of successive integers equals itself: 1306 = 11 + 32 + 03 + 64. 135, 175, 518, and 598 also have this property. Centered triangular number.[174] 1307 = safe prime[18] 1308 = sum of totient function for first 65 integers 1309 = the first sphenic number followed by two consecutive such number 1312 = member of the Mian-Chowla sequence;[15] code for "ACAB" itself an acronym for "all cops are bastards"[175] 1314 = number of integer partitions of 41 whose distinct parts are connected[176] 1318 = Mertens function zero 1319 = safe prime[18] 1320 = 659 + 661: sum of twin prime pair[177] 1322 = area of the 21th conjoined trapezoid[178] 1323 = Achilles number 1325 = Markov number[179] 1326 = triangular number,[23] hexagonal number,[24] Mertens function zero 1327 = first prime followed by 33 consecutive composite numbers 1328 = sum of totient function for first 66 integers 1329 = Mertens function zero, sum of first 41 composite numbers[180] 1330 = tetrahedral number,[103] forms a Ruth–Aaron pair with 1331 under second definition 1331 = 113, centered heptagonal number,[61] forms a Ruth–Aaron pair with 1330 under second definition. This is the only non-trivial cube of the form x2 + x − 1, for x = 36. 1332 = pronic number[46] 1333 = 372 - 37 + 1 = H37 (the 37th Hogben number)[181] 1334 = maximal number of regions the plane is divided into by drawing 37 circles[182] 1335 = pentagonal number,[65] Mertens function zero 1336 = Mertens function zero 1337 = Used in the novel form of spelling called leet. Approximate melting point of gold in kelvins. 1338 = Mertens function zero 1340 = k such that 5 × 2k - 1 is prime[183] 1342 = Mertens function zero 1343 = cropped hexagone[184] 1349 = Stern-Jacobsthal number[185] 1350 = nonagonal number[139] 1351 = number of partitions of 28 into a prime number of parts[186] 1352 = number of cubes of edge length 1 required to make a hollow cube of edge length 16, Achilles number 1353 = 2 × 262 + 1 = number of different 2 × 2 determinants with integer entries from 0 to 26[187] 1354 = 2 × 262 + 2 = number of points on surface of tetrahedron with edgelength 26[188] 1361 = first prime following a prime gap of 34,[114] centered decagonal number, Honaker prime[189] 1365 = pentatope number[190] 1367 = safe prime,[18] balanced prime, sum of three, nine, and eleven consecutive primes (449 + 457 + 461, 131 + 137 + 139 + 149 + 151 + 157 + 163 + 167 + 173, and 101 + 103 + 107 + 109 + 113 + 127 + 131 + 137 + 139 + 149 + 151),[86] 1368 = number of edges in the join of two cycle graphs, both of order 36[191] 1369 = 372, centered octagonal number[144] 1371 = sum of the first 28 primes 1372 = Achilles number 1373 = number of lattice points inside a circle of radius 21[192] 1374 = number of unimodular 2 × 2 matrices having all terms in {0,1,...,23}[193] 1375 = decagonal pyramidal number[194] 1376 = primitive abundant number (abundant number all of whose proper divisors are deficient numbers)[195] 1378 = triangular number[23] 1379 = magic constant of n × n normal magic square and n-queens problem for n = 14. 1380 = number of 8-step mappings with 4 inputs[196] 1381 = centered pentagonal number[41] 1386 = octagonal pyramidal number[197] 1387 = 5th Fermat pseudoprime of base 2,[198] 22nd centered hexagonal number and the 19th decagonal number,[89] second Super-Poulet number.[199] 1389 = sum of first 42 composite numbers[200] 1392 = number of edges in the hexagonal triangle T(29)[201] 1393 = 7-Knödel number[202] 1394 = sum of totient function for first 67 integers 1395 = vampire number,[158] member of the Mian–Chowla sequence[15] triangular matchstick number[107] 1396 = centered triangular number[203] 1398 = number of integer partitions of 40 whose distinct parts are connected[204] 1400 = number of sum-free subsets of {1, ..., 15}[205] 1401 = pinwheel number[206] 1404 = heptagonal number[60] 1405 = 262 + 272, 72 + 82 + ... + 162, centered square number[12] 1406 = pronic number,[46] semi-meandric number[207] 1407 = 382 - 38 + 1 = H38 (the 38th Hogben number)[208] 1408 = maximal number of regions the plane is divided into by drawing 38 circles[209] 1409 = super-prime, Sophie Germain prime,[11] smallest number whose eighth power is the sum of 8 eighth powers, Proth prime[116] 1415 = the Mahonian number: T(8, 8)[210] 1419 = Zeisel number[211] 1420 = Number of partitions of 56 into prime parts 1425 = self-descriptive number in base 5 1426 = sum of totient function for first 68 integers, pentagonal number,[65] number of strict partions of 42[212] 1430 = Catalan number[213] 1431 = triangular number,[23] hexagonal number[24] 1432 = member of Padovan sequence[66] 1433 = super-prime, Honaker prime,[214] typical port used for remote connections to Microsoft SQL Server databases 1435 = vampire number;[158] the standard railway gauge in millimetres, equivalent to 4 feet 8+1⁄2 inches (1.435 m) 1437 = smallest number of complexity 20: smallest number requiring 20 1's to build using +, * and ^[215] 1438 = k such that 5 × 2k - 1 is prime[216] 1439 = Sophie Germain prime,[11] safe prime[18] 1440 = a highly totient number[115] and a 481-gonal number. Also, the number of minutes in one day, the blocksize of a standard 3+1/2 floppy disk, and the horizontal resolution of WXGA(II) computer displays 1441 = star number[78] 1442 = number of parts in all partitions of 31 into distinct parts[217] 1443 = number of edges in the join of two cycle graphs, both of order 37[218] 1444 = 382, smallest pandigital number in Roman numerals 1446 = number of points on surface of octahedron with edgelength 19[219] 1447 = super-prime, happy number 1449 = Stella octangula number 1451 = Sophie Germain prime[11] 1452 = first Zagreb index of the complete graph K12[220] 1453 = Sexy prime with 1459 1458 = maximum determinant of an 11 by 11 matrix of zeroes and ones, 3-smooth number (2×36) 1459 = Sexy prime with 1453, sum of nine consecutive primes (139 + 149 + 151 + 157 + 163 + 167 + 173 + 179 + 181), pierpont prime 1460 = Nickname of the original "Doc Marten's" boots, released 1 April 1960 1461 = number of partitions of 38 into prime power parts[221] 1463 = total number of parts in all partitions of 16[222] 1469 = octahedral number,[119] highly cototient number[38] 1470 = pentagonal pyramidal number,[223] sum of totient function for first 69 integers 1471 = super-prime, centered heptagonal number[61] 1473 = cropped hexagone[224] 1476 = coreful perfect number[225] 1477 = 7-Knödel number[226] 1479 = number of planar partitions of 12[227] 1480 = sum of the first 29 primes 1481 = Sophie Germain prime[11] 1482 = pronic number,[46] number of unimodal compositions of 15 where the maximal part appears once[228] 1483 = 392 - 39 + 1 = H39 (the 39th Hogben number)[229] 1484 = maximal number of regions the plane is divided into by drawing 39 circles[230] 1485 = triangular number 1486 = number of strict solid partitions of 19[231] 1487 = safe prime[18] 1488 = triangular matchstick number[107] 1489 = centered triangular number[232] 1490 = tetranacci number[233] 1491 = nonagonal number,[139] Mertens function zero 1492 = Mertens function zero 1493 = Stern prime[129] 1494 = sum of totient function for first 70 integers 1496 = square pyramidal number[14] 1497 = skiponacci number[234] 1498 = number of flat partitions of 41[235] 1499 = Sophie Germain prime,[11] super-prime 1501 = centered pentagonal number[41] 1502 = number of pairs of consecutive integers x, x+1 such that all prime factors of both x and x+1 are at most 47[236] 1504 = primitive abundant number (abundant number all of whose proper divisors are deficient numbers)[237] 1507 = number of partitions of 32 that do not contain 1 as a part[29] 1508 = heptagonal pyramidal number[238] 1509 = pinwheel number[239] 1510 = deficient number, odious number 1511 = Sophie Germain prime,[11] balanced prime[86] 1513 = centered square number[12] 1514 = sum of first 44 composite numbers[240] 1517 = number of lattice points inside a circle of radius 22[241] 1518 = Mertens function zero 1519 = Mertens function zero 1520 = pentagonal number,[65] Mertens function zero, forms a Ruth–Aaron pair with 1521 under second definition 1521 = 392, Mertens function zero, centered octagonal number,[144] forms a Ruth–Aaron pair with 1520 under second definition 1522 = k such that 5 × 2k - 1 is prime[242] 1523 = super-prime, Mertens function zero, safe prime,[18] member of the Mian–Chowla sequence[15] 1524 = Mertens function zero 1525 = heptagonal number,[60] Mertens function zero 1526 = number of conjugacy classes in the alternating group A27[243] 1527 = Mertens function zero 1528 = Mertens function zero 1530 = vampire number[158] 1531 = centered decagonal number, Mertens function zero 1532 = Mertens function zero 1535 = Thabit number 1536 = a common size of microplate, 3-smooth number (29×3), number of threshold functions of exactly 4 variables[244] 1537 = Keith number,[87] Mertens function zero 1538 = number of surface points on a cube with edge-length 17[245] 1540 = triangular number, hexagonal number,[24] decagonal number,[89] tetrahedral number[103] 1541 = octagonal number[246] 1543 = Mertens function zero 1544 = Mertens function zero, number of partitions of integer partitions of 17 where all parts have the same length[247] 1546 = Mertens function zero 1547 = hexagonal pyramidal number 1548 = coreful perfect number[248] 1552 = Number of partitions of 57 into prime parts 1556 = sum of the squares of the first nine primes 1558 = number k such that k64 + 1 is prime 1559 = Sophie Germain prime[11] 1560 = pronic number[46] 1561 = a centered octahedral number,[122] number of series-reduced trees with 19 nodes[249] 1562 = maximal number of regions the plane is divided into by drawing 40 circles[250] 1564 = sum of totient function for first 71 integers 1566 = number k such that k64 + 1 is prime 1567 = number of partitions of 24 with at least one distinct part[251] 1568 = Achilles number[252] 1569 = 2 × 282 + 1 = number of different 2 × 2 determinants with integer entries from 0 to 28[253] 1570 = 2 × 282 + 2 = number of points on surface of tetrahedron with edgelength 28[254] 1571 = Honaker prime[255] 1572 = member of the Mian–Chowla sequence[15] 1575 = odd abundant number,[256] sum of the nontriangular numbers between successive triangular numbers, number of partitions of 24[257] 1578 = sum of first 45 composite numbers[258] 1581 = number of edges in the hexagonal triangle T(31)[259] 1583 = Sophie Germain prime 1584 = triangular matchstick number[107] 1585 = Riordan number, centered triangular number[260] 1586 = area of the 23th conjoined trapezoid[261] 1588 = sum of totient function for first 72 integers 1593 = sum of the first 30 primes 1595 = number of non-isomorphic set-systems of weight 10 1596 = triangular number 1597 = Fibonacci prime,[262] Markov prime,[179] super-prime, emirp 1598 = number of unimodular 2 × 2 matrices having all terms in {0,1,...,25}[263] 1599 = number of edges in the join of two cycle graphs, both of order 39[264] 1600 = 402, repdigit in base 7 (44447), street number on Pennsylvania Avenue of the White House, length in meters of a common High School Track Event, perfect score on SAT (except from 2005-2015) 1601 = Sophie Germain prime, Proth prime,[116] the novel 1601 (Mark Twain) 1602 = number of points on surface of octahedron with edgelength 20[265] 1603 = number of partitions of 27 with nonnegative rank[266] 1606 = enneagonal pyramidal number[267] 1609 = cropped hexagone[268] 1610 = number of strict partions of 43[269] 1617 = pentagonal number[65] 1618 = centered heptagonal number[61] 1619 = palindromic prime in binary, safe prime[18] 1620 = 809 + 811: sum of twin prime pair[270] 1621 = super-prime, pinwheel number[271] 1625 = centered square number[12] 1626 = centered pentagonal number[41] 1630 = number k such that k^64 + 1 is prime 1633 = star number[78] 1634 = Narcissistic number in base 10 1638 = harmonic divisor number,[272] 5 × 21638 - 1 is prime[273] 1639 = nonagonal number[139] 1640 = pronic number[46] 1641 = 412 - 41 + 1 = H41 (the 41st Hogben number)[274] 1642 = maximal number of regions the plane is divided into by drawing 41 circles[275] 1643 = sum of first 46 composite numbers[276] 1644 = 821 + 823: sum of twin prime pair[277] 1649 = highly cototient number,[38] Leyland number[103] 1651 = heptagonal number[60] 1652 = number of partitions of 29 into a prime number of parts[278] 1653 = triangular number, hexagonal number,[24] number of lattice points inside a circle of radius 23[279] 1656 = 827 + 829: sum of twin prime pair[280] 1657 = cuban prime,[281] prime of the form 2p-1 1660 = sum of totient function for first 73 integers 1662 = number of partitions of 49 into pairwise relatively prime parts[282] 1666 = largest efficient pandigital number in Roman numerals (each symbol occurs exactly once) 1669 = super-prime 1678 = n such that n32 + 1 is prime[283] 1679 = highly cototient number,[38] semiprime (23 × 73, see also Arecibo message), number of parts in all partitions of 32 into distinct parts[284] 1680 = highly composite number,[157] number of edges in the join of two cycle graphs, both of order 40[285] 1681 = 412, smallest number yielded by the formula n2 + n + 41 that is not a prime; centered octagonal number[144] 1682 = and 1683 is a member of a Ruth–Aaron pair (first definition) 1683 = triangular matchstick number[107] 1684 = centered triangular number[286] 1687 = 7-Knödel number[287] 1692 = coreful perfect number[288] 1693 = smallest prime > 412.[289] 1694 = number of unimodular 2 × 2 matrices having all terms in {0,1,...,26}[290] 1695 = magic constant of n × n normal magic square and n-queens problem for n = 15. Number of partitions of 58 into prime parts 1696 = sum of totient function for first 74 integers 1701 = { 8 4 } {\displaystyle \left\{{8 \atop 4}\right\}}  , decagonal number, hull number of the U.S.S. Enterprise on Star Trek 1702 = palindromic in 3 consecutive bases: 89814, 78715, 6A616 1705 = tribonacci number[291] 1709 = first of a sequence of eight primes formed by adding 57 in the middle. 1709, 175709, 17575709, 1757575709, 175757575709, 17575757575709, 1757575757575709 and 175757575757575709 are all prime, but 17575757575757575709 = 232433 × 75616446785773 1711 = triangular number, centered decagonal number 1716 = 857 + 859: sum of twin prime pair[292] 1717 = pentagonal number[65] 1720 = sum of the first 31 primes 1721 = number of squares between 422 and 424.[293] 1722 = Giuga number,[294] pronic number[46] 1723 = super-prime 1724 = maximal number of regions the plane is divided into by drawing 42 circles[295] 1727 = area of the 24th conjoined trapezoid[296] 1728 = the quantity expressed as 1000 in duodecimal, that is, the cube of twelve (called a great gross), and so, the number of cubic inches in a cubic foot, palindromic in base 11 (133111) and 23 (36323) 1729 = taxicab number, Carmichael number, Zeisel number, centered cube number, Hardy–Ramanujan number. In the decimal expansion of e the first time all 10 digits appear in sequence starts at the 1729th digit (or 1728th decimal place). In 1979 the rock musical Hair closed on Broadway in New York City after 1729 performances. Palindromic in bases 12, 32, 36. 1733 = Sophie Germain prime, palindromic in bases 3, 18, 19. 1736 = sum of totient function for first 75 integers, number of surface points on a cube with edge-length 18[297] 1737 = pinwheel number[298] 1741 = super-prime, centered square number[12] 1747 = balanced prime[86] 1751 = cropped hexagone[299] 1753 = balanced prime[86] 1754 = k such that 5*2k - 1 is prime[300] 1756 = centered pentagonal number[41] 1760 = the number of yards in a mile 1763 = number of edges in the join of two cycle graphs, both of order 41[301] 1764 = 422 1766 = number of points on surface of octahedron with edgelength 21[302] 1770 = triangular number, hexagonal number,[24] Seventeen Seventy, town in Australia 1771 = tetrahedral number[103] 1772 = centered heptagonal number,[61] sum of totient function for first 76 integers 1777 = smallest prime > 422.[303] 1782 = heptagonal number[60] 1785 = square pyramidal number,[14] triangular matchstick number[107] 1786 = centered triangular number[304] 1787 = super-prime, sum of eleven consecutive primes (137 + 139 + 149 + 151 + 157 + 163 + 167 + 173 + 179 + 181 + 191) 1790 = number of partitions of 50 into pairwise relatively prime parts[305] 1791 = largest natural number that cannot be expressed as a sum of at most four hexagonal numbers. 1792 = Granville number 1793 = number of lattice points inside a circle of radius 24[306] 1794 = nonagonal number,[139] number of partitions of 33 that do not contain 1 as a part[29] 1800 = pentagonal pyramidal number,[223] Achilles number, also, in da Ponte's Don Giovanni, the number of women Don Giovanni had slept with so far when confronted by Donna Elvira, according to Leporello's tally 1801 = cuban prime, sum of five and nine consecutive primes (349 + 353 + 359 + 367 + 373 and 179 + 181 + 191 + 193 + 197 + 199 + 211 + 223 + 227)[281] 1802 = 2 × 302 + 2 = number of points on surface of tetrahedron with edgelength 30,[307] number of partitions of 30 such that the number of odd parts is a part[308] 1804 = number k such that k^64 + 1 is prime 1805 = number of squares between 432 and 434.[309] 1806 = pronic number,[46] product of first four terms of Sylvester's sequence, primary pseudoperfect number,[310] only number for which n equals the denominator of the nth Bernoulli number,[311] Schröder number[312] 1807 = fifth term of Sylvester's sequence[313] 1808 = maximal number of regions the plane is divided into by drawing 43 circles[314] 1811 = Sophie Germain prime 1812 = n such that n32 + 1 is prime[315] 1816 = number of strict partions of 44[316] 1818 = n such that n32 + 1 is prime[317] 1820 = pentagonal number,[65] pentatope number,[190] number of compositions of 13 whose run-lengths are either weakly increasing or weakly decreasing[19] 1821 = member of the Mian–Chowla sequence[15] 1822 = number of integer partitions of 43 whose distinct parts are connected[318] 1823 = super-prime, safe prime[18] 1825 = octagonal number[319] 1826 = decagonal pyramidal number[320] 1827 = vampire number[158] 1828 = meandric number, open meandric number, appears twice in the first 10 decimal digits of e 1830 = triangular number 1832 = sum of totient function for first 77 integers 1834 = octahedral number,[119] sum of the cubes of the first five primes 1836 = factor by which a proton is more massive than an electron 1837 = star number[78] 1838 = number of unimodular 2 × 2 matrices having all terms in {0,1,...,27}[321] 1841 = Mertens function zero 1843 = Mertens function zero 1844 = Mertens function zero 1845 = Mertens function zero 1846 = sum of first 49 composite numbers[322] 1847 = super-prime 1848 = number of edges in the join of two cycle graphs, both of order 42[323] 1849 = 432, palindromic in base 6 (= 123216), centered octagonal number[144] 1850 = Number of partitions of 59 into prime parts 1851 = sum of the first 32 primes 1853 = Mertens function zero 1854 = Mertens function zero 1856 = sum of totient function for first 78 integers 1857 = Mertens function zero, pinwheel number[324] 1861 = centered square number,[12] Mertens function zero 1862 = Mertens function zero, forms a Ruth–Aaron pair with 1863 under second definition 1863 = Mertens function zero, forms a Ruth–Aaron pair with 1862 under second definition 1864 = Mertens function zero 1866 = Mertens function zero 1868 = smallest number of complexity 21: smallest number requiring 21 1's to build using +, * and ^[325] 1869 = Hultman number: SH(7, 4)[326] 1870 = decagonal number[89] 1871 = the first prime of the 2 consecutive twin prime pairs: (1871, 1873) and (1877, 1879)[327] 1872 = first Zagreb index of the complete graph K13[328] 1873 = number of Narayana's cows and calves after 21 years[329] 1874 = area of the 25th conjoined trapezoid[330] 1875 = 502 - 252 1876 = number k such that k^64 + 1 is prime 1877 = number of partitions of 39 where 39 divides the product of the parts[331] 1878 = n such that n32 + 1 is prime[332] 1879 = a prime with square index[333] 1880 = the 10th element of the self convolution of Lucas numbers[334] 1881 = tricapped prism number[335] 1882 = number of linearly separable boolean functions in 4 variables[336] 1883 = number of conjugacy classes in the alternating group A28[337] 1884 = k such that 5*2k - 1 is prime[338] 1885 = Zeisel number[211] 1886 = number of partitions of 64 into fourth powers[339] 1887 = number of edges in the hexagonal triangle T(34)[340] 1888 = primitive abundant number (abundant number all of whose proper divisors are deficient numbers)[341] 1889 = Sophie Germain prime, highly cototient number[38] 1890 = triangular matchstick number[107] 1891 = triangular number, hexagonal number,[24] centered pentagonal number,[41] centered triangular number[342] 1892 = pronic number[46] 1893 = 442 - 44 + 1 = H44 (the 44th Hogben number)[343] 1894 = maximal number of regions the plane is divided into by drawing 44 circles[344] 1895 = Stern-Jacobsthal number[345] 1896 = member of the Mian-Chowla sequence[15] 1897 = member of Padovan sequence,[66] number of triangle-free graphs on 9 vertices[346] 1898 = smallest multiple of n whose digits sum to 26[347] 1899 = cropped hexagone[348] 1900 = number of primes <= 214.[20] Also 1900 (film) or Novecento, 1976 movie 1901 = Sophie Germain prime, centered decagonal number 1902 = number of symmetric plane partitions of 27[349] 1903 = generalized catalan number[350] 1904 = number of flat partitions of 43[351] 1905 = Fermat pseudoprime[352] 1906 = number n such that 3n - 8 is prime[353] 1907 = safe prime,[18] balanced prime[86] 1908 = coreful perfect number[354] 1909 = hyperperfect number[355] 1910 = number of compositions of 13 having exactly one fixed point[356] 1911 = heptagonal pyramidal number[357] 1912 = size of 6th maximum raising after one blind in pot-limit poker[358] 1913 = super-prime, Honaker prime[359] 1914 = number of bipartite partitions of 12 white objects and 3 black ones[360] 1915 = number of nonisomorphic semigroups of order 5[361] 1916 = sum of first 50 composite numbers[362] 1917 = number of partitions of 51 into pairwise relatively prime parts[363] 1918 = heptagonal number[60] 1919 = smallest number with reciprocal of period length 36 in base 10[364] 1920 = sum of the nontriangular numbers between successive triangular numbers 1921 = 4-dimensional centered cube number[365] 1922 = Area of a square with diagonal 62[366] 1923 = 2 × 312 + 1 = number of different 2 X 2 determinants with integer entries from 0 to 31[367] 1924 = 2 × 312 + 2 = number of points on surface of tetrahedron with edgelength 31[368] 1925 = number of ways to write 24 as an orderless product of orderless sums[369] 1926 = pentagonal number[65] 1927 = 211 - 112[370] 1928 = number of distinct values taken by 2^2^...^2 (with 13 2's and parentheses inserted in all possible ways)[371] 1929 = Mertens function zero, number of integer partitions of 42 whose distinct parts are connected[372] 1930 = number of pairs of consecutive integers x, x+1 such that all prime factors of both x and x+1 are at most 53[373] 1931 = Sophie Germain prime 1932 = number of partitions of 40 into prime power parts[374] 1933 = centered heptagonal number,[61] Honaker prime[375] 1934 = sum of totient function for first 79 integers 1935 = number of edges in the join of two cycle graphs, both of order 43[376] 1936 = 442, 18-gonal number,[377] 324-gonal number. 1937 = number of chiral n-ominoes in 12-space, one cell labeled[378] 1938 = Mertens function zero, number of points on surface of octahedron with edgelength 22[379] 1939 = 7-Knödel number[380] 1940 = the Mahonian number: T(8, 9)[381] 1941 = maximal number of regions obtained by joining 16 points around a circle by straight lines[382] 1942 = number k for which 10k + 1, 10k + 3, 10k + 7, 10k + 9 and 10k + 13 are primes[383] 1943 = largest number not the sum of distinct tetradecagonal numbers[384] 1944 = 3-smooth number (23×35), Achilles number[385] 1945 = number of partitions of 25 into relatively prime parts such that multiplicities of parts are also relatively prime[386] 1946 = number of surface points on a cube with edge-length 19[387] 1947 = k such that 5·2k + 1 is a prime factor of a Fermat number 22m + 1 for some m[388] 1948 = number of strict solid partitions of 20[389] 1949 = smallest prime > 442.[390] 1950 = 1 ⋅ 2 ⋅ 3 + 4 ⋅ 5 ⋅ 6 + 7 ⋅ 8 ⋅ 9 + 10 ⋅ 11 ⋅ 12 {\displaystyle 1\cdot 2\cdot 3+4\cdot 5\cdot 6+7\cdot 8\cdot 9+10\cdot 11\cdot 12}  ,[391] largest number not the sum of distinct pentadecagonal numbers[392] 1951 = cuban prime[281] 1952 = number of covers of {1, 2, 3, 4}[393] 1953 = triangular number 1956 = number of sum-free subsets of {1, ..., 16}[394] 1955 = number of partitions of 25 with at least one distinct part[395] 1956 = nonagonal number[139] 1957 = ∑ k = 0 6 6 ! k ! {\displaystyle \sum _{k=0}^{6}{\frac {6!}{k!}}}   = total number of ordered k-tuples (k=0,1,2,3,4,5,6) of distinct elements from an 6-element set[396] 1958 = number of partitions of 25[397] 1959 = Heptanacci-Lucas number[398] 1960 = number of parts in all partitions of 33 into distinct parts[399] 1961 = number of lattice points inside a circle of radius 25[400] 1962 = number of edges in the join of the complete graph K36 and the cycle graph C36[401] 1963! - 1 is prime[402] 1964 = number of linear forests of planted planar trees with 8 nodes[403] 1965 = total number of parts in all partitions of 17[404] 1966 = sum of totient function for first 80 integers 1967 = least edge-length of a square dissectable into at least 30 squares in the Mrs. Perkins's quilt problem[405] σ(1968) = σ(1967) + σ(1966)[406] 1969 = Only value less than four million for which a "mod-ification" of the standard Ackermann Function does not stabilize[407] 1970 = number of compositions of two types of 9 having no even parts[408] 1971 = 3 7 − 6 3 {\displaystyle 3^{7}-6^{3}}  [409] 1972 = n such that n 37 − 1 n − 1 {\displaystyle {\frac {n^{37}-1}{n-1}}}   is prime[410] 1973 = Sophie Germain prime, Leonardo prime 1974 = number of binary vectors of length 17 containing no singletons[411] 1975 = number of partitions of 28 with nonnegative rank[412] 1976 = octagonal number[413] 1977 = number of non-isomorphic multiset partitions of weight 9 with no singletons[414] 1978 = n such that n | (3n + 5)[415] 1979 = number of squares between 452 and 454.[416] 1980 = pronic number[46] 1981 = pinwheel number[417] 1982 = maximal number of regions the plane is divided into by drawing 45 circles[418] 1983 = skiponacci number[419] 1984 = 11111000000 in binary, see also: 1984 (disambiguation) 1985 = centered square number[12] 1986 = number of ways to write 25 as an orderless product of orderless sums[420] 1987 = 300th prime number 1988 = sum of the first 33 primes 1989 = number of 9-step mappings with 4 inputs[421] 1990 = Stella octangula number 1991 = the 46th Gullwing number,[422] palindromic composite number with only palindromic prime factors[423] 1992 = number of nonisomorphic sets of nonempty subsets of a 4-set[424] 1993 = a number with the property that 41993 - 31993 is prime,[425] number of partitions of 30 into a prime number of parts[426] 1994 = Glaisher's function W(37)[427] 1995 = number of unlabeled graphs on 9 vertices with independence number 6[428] 1996 = a number with the property that (1996! + 3)/3 is prime[429] 1997 = ∑ k = 1 21 k ⋅ ϕ ( k ) {\displaystyle \sum _{k=1}^{21}{k\cdot \phi (k)}}  [430] 1998 = triangular matchstick number[107] 1999 = centered triangular number[431]

There are 135 prime numbers between 1000 and 2000:[432][433]

1009, 1013, 1019, 1021, 1031, 1033, 1039, 1049, 1051, 1061, 1063, 1069, 1087, 1091, 1093, 1097, 1103, 1109, 1117, 1123, 1129, 1151, 1153, 1163, 1171, 1181, 1187, 1193, 1201, 1213, 1217, 1223, 1229, 1231, 1237, 1249, 1259, 1277, 1279, 1283, 1289, 1291, 1297, 1301, 1303, 1307, 1319, 1321, 1327, 1361, 1367, 1373, 1381, 1399, 1409, 1423, 1427, 1429, 1433, 1439, 1447, 1451, 1453, 1459, 1471, 1481, 1483, 1487, 1489, 1493, 1499, 1511, 1523, 1531, 1543, 1549, 1553, 1559, 1567, 1571, 1579, 1583, 1597, 1601, 1607, 1609, 1613, 1619, 1621, 1627, 1637, 1657, 1663, 1667, 1669, 1693, 1697, 1699, 1709, 1721, 1723, 1733, 1741, 1747, 1753, 1759, 1777, 1783, 1787, 1789, 1801, 1811, 1823, 1831, 1847, 1861, 1867, 1871, 1873, 1877, 1879, 1889, 1901, 1907, 1913, 1931, 1933, 1949, 1951, 1973, 1979, 1987, 1993, 1997, 1999

 

Wikimedia Commons has media related to 1000 (number).

  •  Mathematics portal

  1. ^ "chiliad". Merriam-Webster. Archived from the original on March 25, 2022.
  2. ^ "Factors of 1000". Gcf & Lwcm. Archived from the original on 2020-11-05. Retrieved October 25, 2020.
  3. ^ "1000". Prime Curious!. Archived from the original on March 25, 2022.
  4. ^ "Sloane's A122189 : Heptanacci numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Archived from the original on October 7, 2016. Retrieved July 13, 2017.
  5. ^ Sloane, N. J. A. (ed.). "Sequence A007585 (10-gonal (or decagonal) pyramidal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2022-05-24.
  6. ^ a b "A003352 - Oeis".
  7. ^ "A003353 - Oeis".
  8. ^ Sloane, N. J. A. (ed.). "Sequence A034262". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2022-05-24.
  9. ^ a b Sloane, N. J. A. (ed.). "Sequence A020473". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2022-05-24.
  10. ^ "A046092 - Oeis".
  11. ^ a b c d e f g h i j k l m n o "Sloane's A005384 : Sophie Germain primes". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Archived from the original on June 11, 2015. Retrieved June 12, 2016.
  12. ^ a b c d e f g h i j "Sloane's A001844 : Centered square numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Archived from the original on June 11, 2015. Retrieved June 12, 2016.
  13. ^ Sloane, N. J. A. (ed.). "Sequence A000325". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2022-05-24.
  14. ^ a b c d "Sloane's A000330 : Square pyramidal numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Archived from the original on June 10, 2016. Retrieved June 12, 2016.
  15. ^ a b c d e f g h "Sloane's A005282 : Mian-Chowla sequence". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Archived from the original on May 17, 2016. Retrieved June 12, 2016.
  16. ^ "A316729 - Oeis".
  17. ^ Sloane, N. J. A. (ed.). "Sequence A006313 (Numbers n such that n^16 + 1 is prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2022-05-24.
  18. ^ a b c d e f g h i j k l "Sloane's A005385 : Safe primes". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Archived from the original on June 10, 2016. Retrieved June 12, 2016.
  19. ^ a b Sloane, N. J. A. (ed.). "Sequence A332835 (Number of compositions of n whose run-lengths are either weakly increasing or weakly decreasing)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2022-06-02.
  20. ^ a b Sloane, N. J. A. (ed.). "Sequence A007053". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2022-06-02.
  21. ^ Richard Kenneth Guy (June 29, 2013). "A. Prime numbers". Unsolved Problems in Number Theory. Springer Science+Business Media. p. 7. ISBN 978-1475717389. Archived from the original on March 25, 2022.
  22. ^ "A004801 - Oeis".
  23. ^ a b c d e f g h "Sloane's A000217 : Triangular numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Archived from the original on April 5, 2016. Retrieved June 12, 2016.
  24. ^ a b c d e f g h i "Sloane's A000384 : Hexagonal numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Archived from the original on April 17, 2016. Retrieved June 12, 2016.
  25. ^ a b "A000124 - Oeis".
  26. ^ "A161328 - Oeis".
  27. ^ "A023036 - Oeis".
  28. ^ "A007522 - Oeis".
  29. ^ a b c d Sloane, N. J. A. (ed.). "Sequence A002865 (Number of partitions of n that do not contain 1 as a part)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2022-06-02.
  30. ^ a b "A000695 - Oeis".
  31. ^ "A003356 - Oeis".
  32. ^ a b "A003357 - Oeis".
  33. ^ "A036301 - Oeis".
  34. ^ "A000567 - Oeis".
  35. ^ "A000025 - Oeis".
  36. ^ "A336130 - Oeis".
  37. ^ "A073576 - Oeis".
  38. ^ a b c d e f g "Sloane's A100827 : Highly cototient numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Archived from the original on June 10, 2016. Retrieved June 12, 2016.
  39. ^ "Base converter | number conversion".
  40. ^ Sloane, N. J. A. (ed.). "Sequence A015723 (Number of parts in all partitions of n into distinct parts)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  41. ^ a b c d e f g h "Sloane's A005891 : Centered pentagonal numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Archived from the original on June 10, 2016. Retrieved June 12, 2016.
  42. ^ "A003365 - Oeis".
  43. ^ "A045943 - Oeis".
  44. ^ "A005448 - Oeis".
  45. ^ "A003368 - Oeis".
  46. ^ a b c d e f g h i j k l m "Sloane's A002378 : Oblong (or promic, pronic, or heteromecic) numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Archived from the original on June 9, 2016. Retrieved June 12, 2016.
  47. ^ "A002061 - Oeis".
  48. ^ "A003349 - Oeis".
  49. ^ a b c Sloane, N. J. A. (ed.). "Sequence A001105". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  50. ^ "A003294 - Oeis".
  51. ^ a b c "A035137 - Oeis".
  52. ^ "A347565: Primes p such that A241014(A000720(p)) is +1 or -1". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Archived from the original on March 25, 2022. Retrieved January 19, 2022.
  53. ^ "A003325 - Oeis".
  54. ^ "A195162 - Oeis".
  55. ^ "A006532 - Oeis".
  56. ^ "A341450 - Oeis".
  57. ^ Sloane, N. J. A. (ed.). "Sequence A006128 (Total number of parts in all partitions of n. Also, sum of largest parts of all partitions of n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  58. ^ a b "A006567 - Oeis".
  59. ^ a b "A003354 - Oeis".
  60. ^ a b c d e f g h "Sloane's A000566 : Heptagonal numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Archived from the original on June 11, 2016. Retrieved June 12, 2016.
  61. ^ a b c d e f g "Sloane's A069099 : Centered heptagonal numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Archived from the original on June 9, 2016. Retrieved June 12, 2016.
  62. ^ "A273873 - Oeis".
  63. ^ "A292457 - Oeis".
  64. ^ "A073592 - Oeis".
  65. ^ a b c d e f g h i j "Sloane's A000326 : Pentagonal numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Archived from the original on June 10, 2016. Retrieved June 12, 2016.
  66. ^ a b c "Sloane's A000931 : Padovan sequence". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Archived from the original on June 10, 2016. Retrieved June 12, 2016.
  67. ^ "A077043 - Oeis".
  68. ^ "A056107 - Oeis".
  69. ^ "A025147 - Oeis".
  70. ^ "Sloane's A006753 : Smith numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Archived from the original on June 9, 2016. Retrieved June 12, 2016.
  71. ^ "Sloane's A031157 : Numbers that are both lucky and prime". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Archived from the original on March 4, 2016. Retrieved June 12, 2016.
  72. ^ "A033996 - Oeis".
  73. ^ "A018900 - Oeis".
  74. ^ "A046308 - Oeis".
  75. ^ "Sloane's A001232 : Numbers n such that 9*n = (n written backwards)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Archived from the original on October 17, 2015. Retrieved June 14, 2016.
  76. ^ "A003350 - Oeis".
  77. ^ Wells, D. The Penguin Dictionary of Curious and Interesting Numbers London: Penguin Group. (1987): 163
  78. ^ a b c d e "Sloane's A003154 : Centered 12-gonal numbers. Also star numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Archived from the original on June 11, 2016. Retrieved June 12, 2016.
  79. ^ "A003355 - Oeis".
  80. ^ "A051682 - Oeis".
  81. ^ Sloane, N. J. A. (ed.). "Sequence A323657 (Number of strict solid partitions of n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  82. ^ "A121029 - Oeis".
  83. ^ "A292449 - Oeis".
  84. ^ Sloane, N. J. A. (ed.). "Sequence A087188 (number of partitions of n into distinct squarefree parts)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  85. ^ Sloane, N. J. A. (ed.). "Sequence A059993". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  86. ^ a b c d e f g h i "Sloane's A006562 : Balanced primes". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-12.
  87. ^ a b "Sloane's A007629 : Repfigit (REPetitive FIbonacci-like diGIT) numbers (or Keith numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-12.
  88. ^ "Sloane's A002997 : Carmichael numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-12.
  89. ^ a b c d e "Sloane's A001107 : 10-gonal (or decagonal) numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-12.
  90. ^ Sloane, N. J. A. (ed.). "Sequence A001567 (Fermat pseudoprimes to base 2, also called Sarrus numbers or Poulet numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  91. ^ Sloane, N. J. A. (ed.). "Sequence A051890 (2*(n^2 - n + 1))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  92. ^ Sloane, N. J. A. (ed.). "Sequence A319560 (Number of non-isomorphic strict T_0 multiset partitions of weight n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  93. ^ Sloane, N. J. A. (ed.). "Sequence A028916 (Friedlander-Iwaniec primes: Primes of form a^2 + b^4)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  94. ^ Sloane, N. J. A. (ed.). "Sequence A057732 (Numbers k such that 2^k + 3 is prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  95. ^ Sloane, N. J. A. (ed.). "Sequence A128455 (Numbers k such that 9^k - 2 is a prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  96. ^ Sloane, N. J. A. (ed.). "Sequence A000009 (Expansion of Product_{m > 0} (1 + x^m); number of partitions of n into distinct parts; number of partitions of n into odd parts)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  97. ^ Sloane, N. J. A. (ed.). "Sequence A318949 (Number of ways to write n as an orderless product of orderless sums)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  98. ^ Sloane, N. J. A. (ed.). "Sequence A038499 (Number of partitions of n into a prime number of parts)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  99. ^ Sloane, N. J. A. (ed.). "Sequence A006748 (Number of diagonally symmetric polyominoes with n cells)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  100. ^ Sloane, N. J. A. (ed.). "Sequence A210000 (Number of unimodular 2 X 2 matrices having all terms in {0,1,...,n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.}
  101. ^ Sloane, N. J. A. (ed.). "Sequence A033995 (Number of bipartite graphs with n nodes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  102. ^ Sloane, N. J. A. (ed.). "Sequence A028387 (n + (n+1)^2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  103. ^ a b c d e "Sloane's A076980 : Leyland numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-12.
  104. ^ Sloane, N. J. A. (ed.). "Sequence A000328". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  105. ^ Sloane, N. J. A. (ed.). "Sequence A001608 (Perrin sequence)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  106. ^ Sloane, N. J. A. (ed.). "Sequence A140091 (3*n*(n + 3)/2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  107. ^ a b c d e f g h i j Sloane, N. J. A. (ed.). "Sequence A045943". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2022-06-02.
  108. ^ Sloane, N. J. A. (ed.). "Sequence A005448 (Centered triangular numbers: 3n(n-1)/2 + 1)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  109. ^ Sloane, N. J. A. (ed.). "Sequence A080040". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  110. ^ Sloane, N. J. A. (ed.). "Sequence A264237 (Sum of values of vertices at level n of the hyperbolic Pascal pyramid)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  111. ^ "Sloane's A000292 : Tetrahedral numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-12.
  112. ^ Sloane, N. J. A. (ed.). "Sequence A208155 (7-Knödel numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  113. ^ Sloane, N. J. A. (ed.). "Sequence A006315 (Numbers n such that n^32 + 1 is prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  114. ^ a b "Sloane's A000101 : Increasing gaps between primes (upper end)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-07-10.
  115. ^ a b "Sloane's A097942 : Highly totient numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-12.
  116. ^ a b c d "Sloane's A080076 : Proth primes". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-12.
  117. ^ Sloane, N. J. A. (ed.). "Sequence A005893 (Number of points on surface of tetrahedron; coordination sequence for sodalite net (equals 2*n^2+2 for n > 0))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  118. ^ Sloane, N. J. A. (ed.). "Sequence n*(n+2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  119. ^ a b c "Sloane's A005900 : Octahedral numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-12.
  120. ^ "Sloane's A069125 : a(n) = (11*n^2 - 11*n + 2)/2". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-12.
  121. ^ Sloane, N. J. A. (ed.). "Sequence A005899 (Number of points on surface of octahedron)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  122. ^ a b Sloane, N. J. A. (ed.). "Sequence A001845 (Centered octahedral numbers (crystal ball sequence for cubic lattice))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2022-06-02.
  123. ^ Sloane, N. J. A. (ed.). "Sequence A000567 (Octagonal numbers: n*(3*n-2). Also called star numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  124. ^ Sloane, N. J. A. (ed.). "Sequence A007491 (Smallest prime > n^2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  125. ^ Sloane, N. J. A. (ed.). "Sequence A002413 (Heptagonal (or 7-gonal) pyramidal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  126. ^ Higgins, Peter (2008). Number Story: From Counting to Cryptography. New York: Copernicus. p. 61. ISBN 978-1-84800-000-1.
  127. ^ Sloane, N. J. A. (ed.). "Sequence A051424 (Number of partitions of n into pairwise relatively prime parts)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  128. ^ Sloane, N. J. A. (ed.). "Sequence A006748 (Number of diagonally symmetric polyominoes with n cells)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  129. ^ a b "Sloane's A042978 : Stern primes". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-12.
  130. ^ Sloane, N. J. A. (ed.). "Sequence A028387 (n + (n+1)^2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  131. ^ Sloane, N. J. A. (ed.). "Sequence A002061 (Central polygonal numbers: n^2 - n + 1)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  132. ^ Sloane, N. J. A. (ed.). "Sequence A059993". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  133. ^ >Sloane, N. J. A. (ed.). "Sequence A080663 (3*n^2 - 1)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  134. ^ Meehan, Eileen R., Why TV is not our fault: television programming, viewers, and who's really in control Lanham, MD: Rowman & Littlefield, 2005
  135. ^ Sloane, N. J. A. (ed.). "Sequence A240574 (Number of partitions of n such that the number of odd parts is a part)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  136. ^ Higgins, ibid.
  137. ^ Sloane, N. J. A. (ed.). "Sequence A053767 (Sum of first n composite numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  138. ^ Sloane, N. J. A. (ed.). "Sequence A140091 (3*n*(n + 3)/2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  139. ^ a b c d e f "Sloane's A001106 : 9-gonal (or enneagonal or nonagonal) numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-12.
  140. ^ Sloane, N. J. A. (ed.). "Sequence A005448 (Centered triangular numbers: 3n(n-1)/2 + 1)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  141. ^ Sloane, N. J. A. (ed.). "Sequence A006355 (Number of binary vectors of length n containing no singletons)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  142. ^ Sloane, N. J. A. (ed.). "Sequence n*(n+2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  143. ^ "Sloane's A001110 : Square triangular numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-12.
  144. ^ a b c d e "Sloane's A016754 : Odd squares: a(n) = (2n+1)^2. Also centered octagonal numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-12.
  145. ^ Sloane, N. J. A. (ed.). "Sequence A008302". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  146. ^ Sloane, N. J. A. (ed.). "Sequence A015723 (Number of parts in all partitions of n into distinct parts)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  147. ^ Sloane, N. J. A. (ed.). "Sequence A054735 (Sums of twin prime pairs)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  148. ^ "Sloane's A005898 : Centered cube numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-12.
  149. ^ Sloane, N. J. A. (ed.). "Sequence A126796 (Number of complete partitions of n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  150. ^ "Sloane's A033819 : Trimorphic numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-12.
  151. ^ Sloane, N. J. A. (ed.). "Sequence A058331 (2*n^2 + 1)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  152. ^ Sloane, N. J. A. (ed.). "Sequence A005893 (Number of points on surface of tetrahedron; coordination sequence for sodalite net (equals 2*n^2+2 for n > 0))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  153. ^ Sloane, N. J. A. (ed.). "Sequence A144300 (Number of partitions of n minus number of divisors of n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  154. ^ Sloane, N. J. A. (ed.). "Sequence A318949 (Number of ways to write n as an orderless product of orderless sums)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  155. ^ Sloane, N. J. A. (ed.). "Sequence A000041 (a(n) is the number of partitions of n (the partition numbers))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  156. ^ Sloane, N. J. A. (ed.). "Sequence A000328". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  157. ^ a b "Sloane's A002182 : Highly composite numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-12.
  158. ^ a b c d e "Sloane's A014575 : Vampire numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-12.
  159. ^ Sloane, N. J. A. (ed.). "Sequence A000009 (Expansion of Product_{m > 0} (1 + x^m); number of partitions of n into distinct parts; number of partitions of n into odd parts)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  160. ^ Sloane, N. J. A. (ed.). "Sequence A014206 (n^2 + n + 2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  161. ^ Sloane, N. J. A. (ed.). "Sequence A208155 (7-Knödel numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  162. ^ Sloane, N. J. A. (ed.). "Sequence A023894 (Number of partitions of n into prime power parts)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  163. ^ Sloane, N. J. A. (ed.). "Sequence A053767 (Sum of first n composite numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  164. ^ Sloane, N. J. A. (ed.). "Sequence A000930 (Narayana's cows sequence)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  165. ^ Sloane, N. J. A. (ed.). "Sequence A001792". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  166. ^ Sloane, N. J. A. (ed.). "Sequence A000567 (Octagonal numbers: n*(3*n-2). Also called star numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  167. ^ Sloane, N. J. A. (ed.). "Sequence A051424 (Number of partitions of n into pairwise relatively prime parts)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  168. ^ Sloane, N. J. A. (ed.). "Sequence A054735 (Sums of twin prime pairs)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  169. ^ Sloane, N. J. A. (ed.). "Sequence A006958 (Number of parallelogram polyominoes with n cells (also called staircase polyominoes, although that term is overused))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  170. ^ Sloane, N. J. A. (ed.). "Sequence n*(n+2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  171. ^ Sloane, N. J. A. (ed.). "Sequence A059993 (Pinwheel numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  172. ^ Sloane, N. J. A. (ed.). "Sequence A033548 (Honaker primes: primes P(k) such that sum of digits of P(k) equals sum of digits of k)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  173. ^ Sloane, N. J. A. (ed.). "Sequence A140091 (3*n*(n + 3)/2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  174. ^ Sloane, N. J. A. (ed.). "Sequence A005448 (Centered triangular numbers: 3n(n-1)/2 + 1)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  175. ^ "Constitutional Court allows 'FCK CPS' sticker". The Local. 28 April 2015. "...state court in Karlsruhe ruled that a banner ... that read 'ACAB' – an abbreviation of 'all cops are bastards' ... a punishable insult. ... A court in Frankfurt ... the numbers '1312' constituted an insult ... the numerals stand for the letters ACAB's position in the alphabet.
  176. ^ Sloane, N. J. A. (ed.). "Sequence A304716 (Number of integer partitions of n whose distinct parts are connected)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  177. ^ Sloane, N. J. A. (ed.). "Sequence A054735 (Sums of twin prime pairs)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  178. ^ >Sloane, N. J. A. (ed.). "Sequence A080663 (3*n^2 - 1)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  179. ^ a b "Sloane's A002559 : Markoff (or Markov) numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-12.
  180. ^ Sloane, N. J. A. (ed.). "Sequence A053767 (Sum of first n composite numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  181. ^ Sloane, N. J. A. (ed.). "Sequence A002061 (Central polygonal numbers: n^2 - n + 1)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  182. ^ Sloane, N. J. A. (ed.). "Sequence A014206 (n^2 + n + 2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  183. ^ Sloane, N. J. A. (ed.). "Sequence A001770 (Numbers k such that 5*2^k - 1 is prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  184. ^ Sloane, N. J. A. (ed.). "Sequence A144391 (3*n^2 + n - 1)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  185. ^ Sloane, N. J. A. (ed.). "Sequence A101624 (Stern-Jacobsthal number)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  186. ^ Sloane, N. J. A. (ed.). "Sequence A038499 (Number of partitions of n into a prime number of parts)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  187. ^ Sloane, N. J. A. (ed.). "Sequence A058331 (2*n^2 + 1)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  188. ^ Sloane, N. J. A. (ed.). "Sequence A005893 (Number of points on surface of tetrahedron; coordination sequence for sodalite net (equals 2*n^2+2 for n > 0))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  189. ^ Sloane, N. J. A. (ed.). "Sequence A033548 (Honaker primes: primes P(k) such that sum of digits of P(k) equals sum of digits of k)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  190. ^ a b "Sloane's A000332 : Binomial coefficient binomial(n,4) = n*(n-1)*(n-2)*(n-3)/24". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-12.
  191. ^ Sloane, N. J. A. (ed.). "Sequence n*(n+2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  192. ^ Sloane, N. J. A. (ed.). "Sequence A000328". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  193. ^ Sloane, N. J. A. (ed.). "Sequence A210000 (Number of unimodular 2 X 2 matrices having all terms in {0,1,...,n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.}
  194. ^ Sloane, N. J. A. (ed.). "Sequence A007585 (10-gonal (or decagonal) pyramidal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  195. ^ Sloane, N. J. A. (ed.). "Sequence A071395 (Primitive abundant numbers (abundant numbers all of whose proper divisors are deficient numbers))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  196. ^ Sloane, N. J. A. (ed.). "Sequence A005945 (Number of n-step mappings with 4 inputs)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  197. ^ Sloane, N. J. A. (ed.). "Sequence A002414 (Octagonal pyramidal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  198. ^ "Sloane's A001567 : Fermat pseudoprimes to base 2". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-12.
  199. ^ "Sloane's A050217 : Super-Poulet numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-12.
  200. ^ Sloane, N. J. A. (ed.). "Sequence A053767 (Sum of first n composite numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  201. ^ Sloane, N. J. A. (ed.). "Sequence A140091 (3*n*(n + 3)/2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  202. ^ Sloane, N. J. A. (ed.). "Sequence A208155 (7-Knödel numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  203. ^ Sloane, N. J. A. (ed.). "Sequence A005448 (Centered triangular numbers: 3n(n-1)/2 + 1)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  204. ^ Sloane, N. J. A. (ed.). "Sequence A304716 (Number of integer partitions of n whose distinct parts are connected)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  205. ^ Sloane, N. J. A. (ed.). "Sequence A007865 (Number of sum-free subsets of {1, ..., n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.}
  206. ^ Sloane, N. J. A. (ed.). "Sequence A059993 (Pinwheel numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  207. ^ "Sloane's A000682 : Semimeanders". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-12.
  208. ^ Sloane, N. J. A. (ed.). "Sequence A002061 (Central polygonal numbers: n^2 - n + 1)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  209. ^ Sloane, N. J. A. (ed.). "Sequence A014206 (n^2 + n + 2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  210. ^ Sloane, N. J. A. (ed.). "Sequence A008302". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  211. ^ a b "Sloane's A051015 : Zeisel numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-12.
  212. ^ Sloane, N. J. A. (ed.). "Sequence A000009 (Expansion of Product_{m > 0} (1 + x^m); number of partitions of n into distinct parts; number of partitions of n into odd parts)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  213. ^ "Sloane's A000108 : Catalan numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-12.
  214. ^ Sloane, N. J. A. (ed.). "Sequence A033548 (Honaker primes: primes P(k) such that sum of digits of P(k) equals sum of digits of k)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  215. ^ Sloane, N. J. A. (ed.). "Sequence A003037 (Smallest number of complexity n: smallest number requiring n 1's to build using +, * and ^)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  216. ^ Sloane, N. J. A. (ed.). "Sequence A001770 (Numbers k such that 5*2^k - 1 is prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  217. ^ Sloane, N. J. A. (ed.). "Sequence A015723 (Number of parts in all partitions of n into distinct parts)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  218. ^ Sloane, N. J. A. (ed.). "Sequence n*(n+2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  219. ^ Sloane, N. J. A. (ed.). "Sequence A005899 (Number of points on surface of octahedron)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  220. ^ Sloane, N. J. A. (ed.). "Sequence A011379 (n^2*(n+1))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  221. ^ Sloane, N. J. A. (ed.). "Sequence A023894 (Number of partitions of n into prime power parts)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  222. ^ Sloane, N. J. A. (ed.). "Sequence A006128 (Total number of parts in all partitions of n. Also, sum of largest parts of all partitions of n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  223. ^ a b "Sloane's A002411 : Pentagonal pyramidal numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-12.
  224. ^ Sloane, N. J. A. (ed.). "Sequence A144391 (3*n^2 + n - 1)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  225. ^ Sloane, N. J. A. (ed.). "Sequence A307958 (Coreful perfect numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  226. ^ Sloane, N. J. A. (ed.). "Sequence A208155 (7-Knödel numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  227. ^ Sloane, N. J. A. (ed.). "Sequence A000219 (Number of planar partitions (or plane partitions) of n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  228. ^ Sloane, N. J. A. (ed.). "Sequence A006330 (Number of corners, or planar partitions of n with only one row and one column)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  229. ^ Sloane, N. J. A. (ed.). "Sequence A002061 (Central polygonal numbers: n^2 - n + 1)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  230. ^ Sloane, N. J. A. (ed.). "Sequence A014206 (n^2 + n + 2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  231. ^ Sloane, N. J. A. (ed.). "Sequence A323657 (Number of strict solid partitions of n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  232. ^ Sloane, N. J. A. (ed.). "Sequence A005448 (Centered triangular numbers: 3n(n-1)/2 + 1)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  233. ^ "Sloane's A000078 : Tetranacci numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-12.
  234. ^ Sloane, N. J. A. (ed.). "Sequence A001608 (Perrin sequence)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  235. ^ Sloane, N. J. A. (ed.). "Sequence A034296 (Number of flat partitions of n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  236. ^ Sloane, N. J. A. (ed.). "Sequence A002071 (Number of pairs of consecutive integers x, x+1 such that all prime factors of both x and x+1 are at most the n-th prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  237. ^ Sloane, N. J. A. (ed.). "Sequence A071395 (Primitive abundant numbers (abundant numbers all of whose proper divisors are deficient numbers))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  238. ^ Sloane, N. J. A. (ed.). "Sequence A002413 (Heptagonal (or 7-gonal) pyramidal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  239. ^ Sloane, N. J. A. (ed.). "Sequence A059993 (Pinwheel numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  240. ^ Sloane, N. J. A. (ed.). "Sequence A053767 (Sum of first n composite numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  241. ^ Sloane, N. J. A. (ed.). "Sequence A000328". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  242. ^ Sloane, N. J. A. (ed.). "Sequence A001770 (Numbers k such that 5*2^k - 1 is prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  243. ^ Sloane, N. J. A. (ed.). "Sequence A000702 (number of conjugacy classes in the alternating group A_n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  244. ^ Sloane, N. J. A. (ed.). functions of exactly n variables "Sequence A000615Threshold functions of exactly n variables". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. {{cite web}}: Check |url= value (help)
  245. ^ Sloane, N. J. A. (ed.). "Sequence A005897". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  246. ^ Sloane, N. J. A. (ed.). "Sequence A000567 (Octagonal numbers: n*(3*n-2). Also called star numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  247. ^ Sloane, N. J. A. (ed.). "Sequence A319066 (Number of partitions of integer partitions of n where all parts have the same length)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  248. ^ Sloane, N. J. A. (ed.). "Sequence A307958 (Coreful perfect numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  249. ^ Sloane, N. J. A. (ed.). "Sequence A000014 (Number of series-reduced trees with n nodes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  250. ^ Sloane, N. J. A. (ed.). "Sequence A014206 (n^2 + n + 2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  251. ^ Sloane, N. J. A. (ed.). "Sequence A144300 (Number of partitions of n minus number of divisors of n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  252. ^ Sloane, N. J. A. (ed.). "Sequence A052486". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  253. ^ Sloane, N. J. A. (ed.). "Sequence A058331 (2*n^2 + 1)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  254. ^ Sloane, N. J. A. (ed.). "Sequence A005893 (Number of points on surface of tetrahedron; coordination sequence for sodalite net (equals 2*n^2+2 for n > 0))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  255. ^ Sloane, N. J. A. (ed.). "Sequence A033548 (Honaker primes: primes P(k) such that sum of digits of P(k) equals sum of digits of k)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  256. ^ "Sloane's A005231 : Odd abundant numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-12.
  257. ^ Sloane, N. J. A. (ed.). "Sequence A000041 (a(n) is the number of partitions of n (the partition numbers))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  258. ^ Sloane, N. J. A. (ed.). "Sequence A053767 (Sum of first n composite numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  259. ^ Sloane, N. J. A. (ed.). "Sequence A140091 (3*n*(n + 3)/2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  260. ^ Sloane, N. J. A. (ed.). "Sequence A005448 (Centered triangular numbers: 3n(n-1)/2 + 1)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  261. ^ >Sloane, N. J. A. (ed.). "Sequence A080663 (3*n^2 - 1)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  262. ^ "Sloane's A000045 : Fibonacci numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-12.
  263. ^ Sloane, N. J. A. (ed.). "Sequence A210000 (Number of unimodular 2 X 2 matrices having all terms in {0,1,...,n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.}
  264. ^ Sloane, N. J. A. (ed.). "Sequence n*(n+2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  265. ^ Sloane, N. J. A. (ed.). "Sequence A005899 (Number of points on surface of octahedron)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  266. ^ Sloane, N. J. A. (ed.). "Sequence A064174 (Number of partitions of n with nonnegative rank)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  267. ^ Sloane, N. J. A. (ed.). "Sequence A007584 (9-gonal (or enneagonal) pyramidal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  268. ^ Sloane, N. J. A. (ed.). "Sequence A144391 (3*n^2 + n - 1)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  269. ^ Sloane, N. J. A. (ed.). "Sequence A000009 (Expansion of Product_{m > 0} (1 + x^m); number of partitions of n into distinct parts; number of partitions of n into odd parts)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  270. ^ Sloane, N. J. A. (ed.). "Sequence A054735 (Sums of twin prime pairs)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  271. ^ Sloane, N. J. A. (ed.). "Sequence A059993 (Pinwheel numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  272. ^ "Sloane's A001599 : Harmonic or Ore numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-12.
  273. ^ Sloane, N. J. A. (ed.). "Sequence A001770 (Numbers k such that 5*2^k - 1 is prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  274. ^ Sloane, N. J. A. (ed.). "Sequence A002061 (Central polygonal numbers: n^2 - n + 1)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  275. ^ Sloane, N. J. A. (ed.). "Sequence A014206 (n^2 + n + 2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  276. ^ Sloane, N. J. A. (ed.). "Sequence A053767 (Sum of first n composite numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  277. ^ Sloane, N. J. A. (ed.). "Sequence A054735 (Sums of twin prime pairs)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  278. ^ Sloane, N. J. A. (ed.). "Sequence A038499 (Number of partitions of n into a prime number of parts)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  279. ^ Sloane, N. J. A. (ed.). "Sequence A000328". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  280. ^ Sloane, N. J. A. (ed.). "Sequence A054735 (Sums of twin prime pairs)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  281. ^ a b c "Sloane's A002407 : Cuban primes". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-12.
  282. ^ Sloane, N. J. A. (ed.). "Sequence A051424 (Number of partitions of n into pairwise relatively prime parts)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  283. ^ Sloane, N. J. A. (ed.). "Sequence A006315 (Numbers n such that n^32 + 1 is prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  284. ^ Sloane, N. J. A. (ed.). "Sequence A015723 (Number of parts in all partitions of n into distinct parts)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  285. ^ Sloane, N. J. A. (ed.). "Sequence n*(n+2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  286. ^ Sloane, N. J. A. (ed.). "Sequence A005448 (Centered triangular numbers: 3n(n-1)/2 + 1)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  287. ^ Sloane, N. J. A. (ed.). "Sequence A208155 (7-Knödel numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  288. ^ Sloane, N. J. A. (ed.). "Sequence A307958 (Coreful perfect numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  289. ^ Sloane, N. J. A. (ed.). "Sequence A007491 (Smallest prime > n^2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  290. ^ Sloane, N. J. A. (ed.). "Sequence A210000 (Number of unimodular 2 X 2 matrices having all terms in {0,1,...,n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.}
  291. ^ "Sloane's A000073 : Tribonacci numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-12.
  292. ^ Sloane, N. J. A. (ed.). "Sequence A054735 (Sums of twin prime pairs)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  293. ^ Sloane, N. J. A. (ed.). "Sequence A028387 (n + (n+1)^2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  294. ^ "Sloane's A007850 : Giuga numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-12.
  295. ^ Sloane, N. J. A. (ed.). "Sequence A014206 (n^2 + n + 2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  296. ^ >Sloane, N. J. A. (ed.). "Sequence A080663 (3*n^2 - 1)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  297. ^ Sloane, N. J. A. (ed.). "Sequence A005897". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  298. ^ Sloane, N. J. A. (ed.). "Sequence A059993 (Pinwheel numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  299. ^ Sloane, N. J. A. (ed.). "Sequence A144391 (3*n^2 + n - 1)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  300. ^ Sloane, N. J. A. (ed.). "Sequence A001770 (Numbers k such that 5*2^k - 1 is prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  301. ^ Sloane, N. J. A. (ed.). "Sequence n*(n+2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  302. ^ Sloane, N. J. A. (ed.). "Sequence A005899 (Number of points on surface of octahedron)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  303. ^ Sloane, N. J. A. (ed.). "Sequence A007491 (Smallest prime > n^2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  304. ^ Sloane, N. J. A. (ed.). "Sequence A005448 (Centered triangular numbers: 3n(n-1)/2 + 1)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  305. ^ Sloane, N. J. A. (ed.). "Sequence A051424 (Number of partitions of n into pairwise relatively prime parts)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  306. ^ Sloane, N. J. A. (ed.). "Sequence A000328". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  307. ^ Sloane, N. J. A. (ed.). "Sequence A005893 (Number of points on surface of tetrahedron; coordination sequence for sodalite net (equals 2*n^2+2 for n > 0))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  308. ^ Sloane, N. J. A. (ed.). "Sequence A240574 (Number of partitions of n such that the number of odd parts is a part)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  309. ^ Sloane, N. J. A. (ed.). "Sequence A028387 (n + (n+1)^2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  310. ^ "Sloane's A054377 : Primary pseudoperfect numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-12.
  311. ^ Kellner, Bernard C.; 'The equation denom(Bn) = n has only one solution'
  312. ^ Sloane, N. J. A. (ed.). "Sequence A006318 (Large Schröder numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-05-22.
  313. ^ "Sloane's A000058 : Sylvester's sequence". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-12.
  314. ^ Sloane, N. J. A. (ed.). "Sequence A014206 (n^2 + n + 2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  315. ^ Sloane, N. J. A. (ed.). "Sequence A006315 (Numbers n such that n^32 + 1 is prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  316. ^ Sloane, N. J. A. (ed.). "Sequence A000009 (Expansion of Product_{m > 0} (1 + x^m); number of partitions of n into distinct parts; number of partitions of n into odd parts)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  317. ^ Sloane, N. J. A. (ed.). "Sequence A006315 (Numbers n such that n^32 + 1 is prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  318. ^ Sloane, N. J. A. (ed.). "Sequence A304716 (Number of integer partitions of n whose distinct parts are connected)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  319. ^ Sloane, N. J. A. (ed.). "Sequence A000567 (Octagonal numbers: n*(3*n-2). Also called star numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  320. ^ Sloane, N. J. A. (ed.). "Sequence A007585 (10-gonal (or decagonal) pyramidal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  321. ^ Sloane, N. J. A. (ed.). "Sequence A210000 (Number of unimodular 2 X 2 matrices having all terms in {0,1,...,n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.}
  322. ^ Sloane, N. J. A. (ed.). "Sequence A053767 (Sum of first n composite numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  323. ^ Sloane, N. J. A. (ed.). "Sequence n*(n+2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  324. ^ Sloane, N. J. A. (ed.). "Sequence A059993 (Pinwheel numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  325. ^ Sloane, N. J. A. (ed.). "Sequence A003037 (Smallest number of complexity n: smallest number requiring n 1's to build using +, * and ^)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  326. ^ Sloane, N. J. A. (ed.). "Sequence A164652 (Hultman numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  327. ^ Sloane, N. J. A. (ed.). "Sequence A007530 (Prime quadruples: numbers k such that k, k+2, k+6, k+8 are all prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  328. ^ Sloane, N. J. A. (ed.). "Sequence A011379 (n^2*(n+1))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  329. ^ Sloane, N. J. A. (ed.). "Sequence A000930 (Narayana's cows sequence)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  330. ^ >Sloane, N. J. A. (ed.). "Sequence A080663 (3*n^2 - 1)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  331. ^ Sloane, N. J. A. (ed.). "Sequence A057568 (Number of partitions of n where n divides the product of the parts)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  332. ^ Sloane, N. J. A. (ed.). "Sequence A006315 (Numbers n such that n^32 + 1 is prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  333. ^ Sloane, N. J. A. (ed.). "Sequence A011757 (prime(n^2))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  334. ^ Sloane, N. J. A. (ed.). "Sequence A004799 (Self convolution of Lucas numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  335. ^ Sloane, N. J. A. (ed.). "Sequence A005920 (Tricapped prism numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  336. ^ Sloane, N. J. A. (ed.). "Sequence A000609 (Number of threshold functions of n or fewer variables)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  337. ^ Sloane, N. J. A. (ed.). "Sequence A000702 (number of conjugacy classes in the alternating group A_n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  338. ^ Sloane, N. J. A. (ed.). "Sequence A001770 (Numbers k such that 5*2^k - 1 is prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  339. ^ Sloane, N. J. A. (ed.). "Sequence A259793 (Number of partitions of n^4 into fourth powers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  340. ^ Sloane, N. J. A. (ed.). "Sequence A140091 (3*n*(n + 3)/2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  341. ^ Sloane, N. J. A. (ed.). "Sequence A071395 (Primitive abundant numbers (abundant numbers all of whose proper divisors are deficient numbers))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  342. ^ Sloane, N. J. A. (ed.). "Sequence A005448 (Centered triangular numbers: 3n(n-1)/2 + 1)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  343. ^ Sloane, N. J. A. (ed.). "Sequence A002061 (Central polygonal numbers: n^2 - n + 1)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  344. ^ Sloane, N. J. A. (ed.). "Sequence A014206 (n^2 + n + 2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  345. ^ Sloane, N. J. A. (ed.). "Sequence A101624 (Stern-Jacobsthal number)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  346. ^ Sloane, N. J. A. (ed.). "Sequence A006785 (Number of triangle-free graphs on n vertices)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  347. ^ Sloane, N. J. A. (ed.). "Sequence A002998 (Smallest multiple of n whose digits sum to n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  348. ^ Sloane, N. J. A. (ed.). "Sequence A144391 (3*n^2 + n - 1)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  349. ^ Sloane, N. J. A. (ed.). "Sequence A005987 (Number of symmetric plane partitions of n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  350. ^ Sloane, N. J. A. (ed.). "Sequence A023431 (Generalized Catalan Numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  351. ^ Sloane, N. J. A. (ed.). "Sequence A034296 (Number of flat partitions of n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  352. ^ Sloane, N. J. A. (ed.). "Sequence A001567 (Fermat pseudoprimes to base 2, also called Sarrus numbers or Poulet numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  353. ^ Sloane, N. J. A. (ed.). "Sequence A217135 (Numbers n such that 3^n - 8 is prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  354. ^ Sloane, N. J. A. (ed.). "Sequence A307958 (Coreful perfect numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  355. ^ "Sloane's A034897 : Hyperperfect numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-12.
  356. ^ Sloane, N. J. A. (ed.). "Sequence A240736 (Number of compositions of n having exactly one fixed point)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  357. ^ Sloane, N. J. A. (ed.). "Sequence A002413 (Heptagonal (or 7-gonal) pyramidal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  358. ^ Sloane, N. J. A. (ed.). "Sequence A007070 (4*a(n-1) - 2*a(n-2))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  359. ^ Sloane, N. J. A. (ed.). "Sequence A033548 (Honaker primes: primes P(k) such that sum of digits of P(k) equals sum of digits of k)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  360. ^ Sloane, N. J. A. (ed.). "Sequence A000412 (Number of bipartite partitions of n white objects and 3 black ones)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  361. ^ Sloane, N. J. A. (ed.). "Sequence A027851 (Number of nonisomorphic semigroups of order n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  362. ^ Sloane, N. J. A. (ed.). "Sequence A053767 (Sum of first n composite numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  363. ^ Sloane, N. J. A. (ed.). "Sequence A051424 (Number of partitions of n into pairwise relatively prime parts)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  364. ^ Sloane, N. J. A. (ed.). "Sequence A003060 (Smallest number with reciprocal of period length n in decimal (base 10))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  365. ^ Sloane, N. J. A. (ed.). "Sequence A008514 (4-dimensional centered cube numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  366. ^ Sloane, N. J. A. (ed.). "Sequence A001105 (2*n^2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  367. ^ Sloane, N. J. A. (ed.). "Sequence A058331 (2*n^2 + 1)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  368. ^ Sloane, N. J. A. (ed.). "Sequence A005893 (Number of points on surface of tetrahedron; coordination sequence for sodalite net (equals 2*n^2+2 for n > 0))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  369. ^ Sloane, N. J. A. (ed.). "Sequence A318949 (Number of ways to write n as an orderless product of orderless sums)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  370. ^ Sloane, N. J. A. (ed.). "Sequence A024012 (2^n - n^2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  371. ^ Sloane, N. J. A. (ed.). "Sequence A002845 (Number of distinct values taken by 2^2^...^2 (with n 2's and parentheses inserted in all possible ways))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  372. ^ Sloane, N. J. A. (ed.). "Sequence A304716 (Number of integer partitions of n whose distinct parts are connected)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  373. ^ Sloane, N. J. A. (ed.). "Sequence A002071 (Number of pairs of consecutive integers x, x+1 such that all prime factors of both x and x+1 are at most the n-th prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  374. ^ Sloane, N. J. A. (ed.). "Sequence A023894 (Number of partitions of n into prime power parts)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  375. ^ Sloane, N. J. A. (ed.). "Sequence A033548 (Honaker primes: primes P(k) such that sum of digits of P(k) equals sum of digits of k)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  376. ^ Sloane, N. J. A. (ed.). "Sequence n*(n+2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  377. ^ "Sloane's A051870 : 18-gonal numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-12.
  378. ^ Sloane, N. J. A. (ed.). "Sequence A045648 (Number of chiral n-ominoes in (n-1)-space, one cell labeled)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  379. ^ Sloane, N. J. A. (ed.). "Sequence A005899 (Number of points on surface of octahedron)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  380. ^ Sloane, N. J. A. (ed.). "Sequence A208155 (7-Knödel numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  381. ^ Sloane, N. J. A. (ed.). "Sequence A008302". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  382. ^ Sloane, N. J. A. (ed.). "Sequence A000127 (Maximal number of regions obtained by joining n points around a circle by straight lines. Also number of regions in 4-space formed by n-1 hyperplanes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  383. ^ Sloane, N. J. A. (ed.). "Sequence A178084 (Numbers k for which 10k + 1, 10k + 3, 10k + 7, 10k + 9 and 10k + 13 are primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  384. ^ Sloane, N. J. A. (ed.). "Sequence A007419 (Largest number not the sum of distinct n-th-order polygonal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  385. ^ Sloane, N. J. A. (ed.). "Sequence A052486". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  386. ^ Sloane, N. J. A. (ed.). "Sequence A100953 (Number of partitions of n into relatively prime parts such that multiplicities of parts are also relatively prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  387. ^ Sloane, N. J. A. (ed.). "Sequence A005897". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  388. ^ Sloane, N. J. A. (ed.). "Sequence A226366 (Numbers k such that 5*2^k + 1 is a prime factor of a Fermat number 2^(2^m) + 1 for some m)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  389. ^ Sloane, N. J. A. (ed.). "Sequence A323657 (Number of strict solid partitions of n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  390. ^ Sloane, N. J. A. (ed.). "Sequence A007491 (Smallest prime > n^2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  391. ^ Sloane, N. J. A. (ed.). "Sequence A319014 (1*2*3 + 4*5*6 + 7*8*9 + 10*11*12 + 13*14*15 + 16*17*18 + ... + (up to n))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  392. ^ Sloane, N. J. A. (ed.). "Sequence A007419 (Largest number not the sum of distinct n-th-order polygonal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  393. ^ Sloane, N. J. A. (ed.). "Sequence A055621 (Number of covers of an unlabeled n-set)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  394. ^ Sloane, N. J. A. (ed.). "Sequence A007865 (Number of sum-free subsets of {1, ..., n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.}
  395. ^ Sloane, N. J. A. (ed.). "Sequence A144300 (Number of partitions of n minus number of divisors of n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  396. ^ Sloane, N. J. A. (ed.). "Sequence A000522 (Total number of ordered k-tuples of distinct elements from an n-element set)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  397. ^ Sloane, N. J. A. (ed.). "Sequence A000041 (a(n) is the number of partitions of n (the partition numbers))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  398. ^ Sloane, N. J. A. (ed.). "Sequence A104621 (Heptanacci-Lucas numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  399. ^ Sloane, N. J. A. (ed.). "Sequence A015723 (Number of parts in all partitions of n into distinct parts)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  400. ^ Sloane, N. J. A. (ed.). "Sequence A000328". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  401. ^ Sloane, N. J. A. (ed.). "Sequence A005449 (Second pentagonal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  402. ^ Sloane, N. J. A. (ed.). "Sequence A002982 (Numbers n such that n! - 1 is prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  403. ^ Sloane, N. J. A. (ed.). "Sequence A030238 (Backwards shallow diagonal sums of Catalan triangle A009766)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  404. ^ Sloane, N. J. A. (ed.). "Sequence A006128 (Total number of parts in all partitions of n. Also, sum of largest parts of all partitions of n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  405. ^ Sloane, N. J. A. (ed.). "Sequence A089046 (Least edge-length of a square dissectable into at least n squares in the Mrs. Perkins's quilt problem)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  406. ^ Sloane, N. J. A. (ed.). "Sequence A065900 (Numbers n such that sigma(n) equals sigma(n-1) + sigma(n-2))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  407. ^ Jon Froemke & Jerrold W. Grossman (Feb 1993). "A Mod-n Ackermann Function, or What's So Special About 1969?". The American Mathematical Monthly. Mathematical Association of America. 100 (2): 180–183. doi:10.2307/2323780. JSTOR 2323780.
  408. ^ Sloane, N. J. A. (ed.). "Sequence A052542 (2*a(n-1) + a(n-2))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  409. ^ Sloane, N. J. A. (ed.). "Sequence A024069 (6^n - n^7)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  410. ^ Sloane, N. J. A. (ed.). "Sequence A217076 (Numbers n such that (n^37-1)/(n-1) is prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  411. ^ Sloane, N. J. A. (ed.). "Sequence A006355 (Number of binary vectors of length n containing no singletons)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  412. ^ Sloane, N. J. A. (ed.). "Sequence A064174 (Number of partitions of n with nonnegative rank)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  413. ^ Sloane, N. J. A. (ed.). "Sequence A000567 (Octagonal numbers: n*(3*n-2). Also called star numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  414. ^ Sloane, N. J. A. (ed.). "Sequence A302545 (Number of non-isomorphic multiset partitions of weight n with no singletons)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  415. ^ Sloane, N. J. A. (ed.). "Sequence A277288 (Positive integers n such that n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  416. ^ Sloane, N. J. A. (ed.). "Sequence A028387 (n + (n+1)^2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  417. ^ Sloane, N. J. A. (ed.). "Sequence A059993 (Pinwheel numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  418. ^ Sloane, N. J. A. (ed.). "Sequence A014206 (n^2 + n + 2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  419. ^ Sloane, N. J. A. (ed.). "Sequence A001608 (Perrin sequence)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  420. ^ Sloane, N. J. A. (ed.). "Sequence A318949 (Number of ways to write n as an orderless product of orderless sums)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  421. ^ Sloane, N. J. A. (ed.). "Sequence A005945 (Number of n-step mappings with 4 inputs)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  422. ^ Sloane, N. J. A. (ed.). "Sequence A187220 (Gullwing sequence)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  423. ^ Sloane, N. J. A. (ed.). "Sequence A046351 (Palindromic composite numbers with only palindromic prime factors)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  424. ^ Sloane, N. J. A. (ed.). "Sequence A000612 (Number of P-equivalence classes of switching functions of n or fewer variables, divided by 2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  425. ^ OEIS: A059801
  426. ^ Sloane, N. J. A. (ed.). "Sequence A038499 (Number of partitions of n into a prime number of parts)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  427. ^ Sloane, N. J. A. (ed.). "Sequence A002470 (Glaisher's function W(n))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  428. ^ Sloane, N. J. A. (ed.). "Sequence A263341 (Triangle read by rows: T(n,k) is the number of unlabeled graphs on n vertices with independence number k)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  429. ^ Sloane, N. J. A. (ed.). "Sequence A089085 (Numbers k such that (k! + 3)/3 is prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  430. ^ Sloane, N. J. A. (ed.). "Sequence A011755". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  431. ^ Sloane, N. J. A. (ed.). "Sequence A005448 (Centered triangular numbers: 3n(n-1)/2 + 1)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  432. ^ Sloane, N. J. A. (ed.). "Sequence A038823 (Number of primes between n*1000 and (n+1)*1000)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  433. ^ Stein, William A. (10 February 2017). "The Riemann Hypothesis and The Birch and Swinnerton-Dyer Conjecture". wstein.org. Retrieved 6 February 2021.

Retrieved from "//en.wikipedia.org/w/index.php?title=1000_(number)&oldid=1109642942"

Postagens relacionadas

What is the effect of aging on neurotransmission time across the synapse and how does this effect drug action?
What is Sunder Pichai salary?
What is the z-score for 2 standard deviations?
Two reasons why food that has been delivered may have become exposed due to damage to the packaging
Why do cats make a stinky face
What was the main issue with the Mexican Cession?
What observations would the nurse focus on during assessment of a patient with heart failure?
How to get Paramount Plus app on LG TV
What is mic monitoring on xbox
What is a 56 out of 100 grade?

Toplist

#1
Top 7 remédio para dor de ouvido infantil 6 anos 2022
#2
Top 7 folder programa para fazer 2022
#3
Top 7 o que é bom para reduzir o colesterol ruim 2022
#4
Top 8 o que é cidade local 2022
#5
Top 8 distancia entre cidades americanas e canadenses 2022
#6
Top 9 o texto apresenta uma relação entre atividade econômica e organização social marcada pelo 2022
#7
Top 5 blusas de croche verão 2022
#8
Top 6 cha de cordão de frade para que serve 2022
#9
Top 8 se a cada hora o planeta percorre 15° de longitude quantos graus ele realiza a cada rotação 2022

Última postagem

Tag

Q&A What Q&a When Tips Como O que Why Tecnologia How to Who Ios Reviews Best Eth Crio Por que Por que Popular Que é qual quantos Onde Quando How long Ways Comparar Importância Comparação Quem Melhor quanto Oppo Step Apple Média Diferença entre Deal Excel Top List Top Iphone Review Cryto Health Monitor Google