1000 (number)

From HandWiki
Short description: none
"1,000", "Thousand", and "Chiliad" redirect here. For other uses, see 1000 (disambiguation) or, for the military unit, see Chiliarchy.
Short description: Natural number
← 999 1000 1001 →
Cardinalone thousand
Ordinal1000th
(one thousandth)
Factorization23 × 53
Divisors1, 2, 4, 5, 8, 10, 20, 25, 40, 50, 100, 125, 200, 250, 500, 1000
Greek numeral,Α´
Roman numeralM
Roman numeral (unicode)M, m, ↀ
Unicode symbol(s)ↀ
Greek prefixchilia
Latin prefixmilli
Binary11111010002
Ternary11010013
Quaternary332204
Quinary130005
Senary43446
Octal17508
Duodecimal6B412
Hexadecimal3E816
Vigesimal2A020
Base 36RS36
Tamil௲
Chinese千
Punjabi੧੦੦੦
Devanagari१०००

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.

A group of one thousand things is sometimes known, from Ancient Greek, as a chiliad.[1] A period of one thousand years may be known as a chiliad or, more often from Latin, as a millennium. The number 1000 is also sometimes described as a short thousand in medieval contexts where it is necessary to distinguish the Germanic concept of 1200 as a long thousand.

Notation

  • The decimal representation for one thousand is
  • The SI prefix for a thousand units is "kilo-", abbreviated to "k"—for instance, a kilogram or "kg" is a thousand grams. This is sometimes extended to non-SI contexts, such as "ka" (kiloannum) being used as a shorthand for periods of 1000 years. In computer science, however, "kilo-" is used more loosely to mean 2 to the 10th power (1024).
  • 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" or "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, this is sometimes abbreviated with a "G" suffix.

Properties

1000 is the 10th icositetragonal number, or 24-gonal number.[2] It is also the 16th generalized 30-gonal number.[3]

1000 is the Wiener index of cycle length 20, also the sum of labeled boxes arranged as a pyramid with base 1 – 20.[4][5][6][lower-alpha 1]

1000 is the element of multiplicity in a [math]\displaystyle{ 24 \times 24 }[/math] toroidal board in the n-Queens problem,[8] with respective indicator of 25[9] and count of 51.[10][11]

1000 is the number of strict partitions of 50 containing the sum of no subset of the parts.[12]

The regular polygram {1000/499} of the chiliagon, where its diagonals do not pass through the center, yet are closest to it (indistinguishably, unless one zooms in).

A chiliagon is a 1000-sided polygon,[13][14] of order 2000 in its regular form.[lower-alpha 2]

Totient values

1000 has a reduced totient value [math]\displaystyle{ \lambda(n) }[/math] of 100,[20] and Euler totient [math]\displaystyle{ \varphi(n) }[/math] of 400.[16]

11 integers have a totient value of 1000 (1111, 1255, ..., 3750).[16]

One thousand is also equal to the sum of Euler's totient summatory function [math]\displaystyle{ \Phi(n) }[/math] over the first 57 integers.[21]

Repdigits

In decimal, multiples of one thousand are totient values of four-digit repdigits:[16] Template:Bullet list

Notice, that in the list of composite numbers, 7777 is very nearly the composite index of 8888: 8886 is the 7779th composite number.[22] Also,[16]

Template:Bullet list

1600 = 402 is the totient value of 4000, as well as 6000, whose collective sum is 10000, where 6000 is the totient of 9999, one less than 104.[16][lower-alpha 3]

The sum of the first nine prime numbers up to 23 is 100, with [math]\displaystyle{ \varphi(p(23)) = 1000 }[/math], where [math]\displaystyle{ p(23) = 1255 }[/math] is the number of integer partitions of 23.[28]

Prime values

Using decimal representation as well, Template:Bullet list

On the other hand, the largest prime number less than 10000 is the 1229th prime number, 9973.[25][lower-alpha 4]

1000 is also the smallest number in base-ten that generates three primes in the fastest way possible by concatenation with decremented numbers:[37]

  • 1,000,999
  • 1,000,999,998,997
  • 1,000,999,998,997,996,995,994,993

all represent prime numbers.[38][39]

The one-thousandth prime number is 7919. It is a difference of 1 from the order of the smallest sporadic group: [math]\displaystyle{ |\mathrm {M}_{11}| = 7920 }[/math].[40][41]

Numbers in the range 1001–1999

1001 to 1099

1001 = sphenic number (7 × 11 × 13), pentagonal number, pentatope number, palindromic 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[42]
1005 = Mertens function zero, decagonal pyramidal number[43]
1006 = semiprime, product of two distinct isolated primes (2 and 503); unusual number; square-free number; number of compositions (ordered partitions) of 22 into squares; sum of two distinct pentatope numbers (5 and 1001); number of undirected Hamiltonian paths in 4 by 5 square grid graph;[44] record gap between twin primes;[45] number that is the sum of 7 positive 5th powers.[46] In decimal: equidigital number; when turned around, the number looks like a prime, 9001; its cube can be concatenated from other cubes, 1_0_1_8_1_0_8_216 ("_" indicates concatenation, 0 = 03, 1 = 13, 8 = 23, 216 = 63)[47]
1007 = number that is the sum of 8 positive 5th powers[48]
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 and Chen prime.
1010 = 103 + 10,[49] Mertens function zero
1011 = the largest n such that 2n contains 101 and does not 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[50]
1012 = ternary number, (3210) quadruple triangular number (triangular number is 253),[51] number of partitions of 1 into reciprocals of positive integers <= 17 Egyptian fraction[50]
1013 = Sophie Germain prime,[52] centered square number,[53] Mertens function zero
1014 = 210-10,[54] Mertens function zero, sum of the nontriangular numbers between successive triangular numbers
1015 = square pyramidal number[55]
1016 = member of the Mian–Chowla sequence,[56] stella octangula number, number of surface points on a cube with edge-length 14[57]
1017 = generalized triacontagonal number[58]
1018 = Mertens function zero, 101816 + 1 is prime[59]
1019 = Sophie Germain prime,[52] safe prime,[60] Chen prime
1020 = polydivisible number
1021 = twin prime with 1019. It is also a Lucky prime.
1022 = Friedman number
1023 = sum of five consecutive primes (193 + 197 + 199 + 211 + 223);[61] the number of three-dimensional polycubes with 7 cells;[62] number of elements in a 9-simplex; highest number one can count to on one's fingers using binary; 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.[63]
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 fifth base-10 repunit prime,[64] Sophie Germain prime,[52] super-prime, Chen prime
1032 = sum of two distinct powers of 2 (1024 + 8)
1033 = emirp, twin prime with 1031
1034 = sum of 12 positive 9th powers[65]
1035 = triangular number,[66] hexagonal number[67]
1036 = central polygonal number[68]
1037 = number in E-toothpick sequence[69]
1038 = even integer that is an unordered sum of two primes in exactly n ways[70]
1039 = prime of the form 8n+7,[71] number of partitions of 30 that do not contain 1 as a part,[72] Chen prime
1040 = 45 + 42: sum of distinct powers of 4.[73] The number of pieces that could be seen in a 6 × 6 × 6× 6 Rubik's Tesseract.
1041 = sum of 11 positive 5th powers[74]
1042 = sum of 12 positive 5th powers[75]
1043 = number whose sum of even digits and sum of odd digits are even[76]
1044 = sum of distinct powers of 4[73]
1045 = octagonal number[77]
1046 = coefficient of f(q) (3rd order mock theta function)[78]
1047 = number of ways to split a strict composition of n into contiguous subsequences that have the same sum[79]
1048 = number of partitions of n into squarefree parts[80]
1049 = Sophie Germain prime,[52] highly cototient number,[81] Chen prime
1050 = 10508 to decimal becomes a pronic number (55210),[82] number of parts in all partitions of 29 into distinct parts[83]
1051 = centered pentagonal number,[84] centered decagonal number
1052 = number that is the sum of 9 positive 6th powers[85]
1053 = triangular matchstick number[86]
1054 = centered triangular number[87]
1055 = number that is the sum of 12 positive 6th powers[88]
1056 = pronic number[89]
1057 = central polygonal number[90]
1058 = number that is the sum of 4 positive 5th powers,[91] area of a square with diagonal 46[92]
1059 = number n such that n4 is written in the form of a sum of four positive 4th powers[93]
1060 = sum of the first 25 primes
1061 = emirp, twin prime with 1063, number of prime numbers having four digits[94]
1062 = number that is not the sum of two palindromes[95]
1063 = super-prime, sum of seven consecutive primes (137 + 139 + 149 + 151 + 157 + 163 + 167); near-wall-sun-sun prime[96]
1064 = sum of two positive cubes[97]
1065 = generalized duodecagonal[98]
1066 = number whose sum of their divisors is a square[99]
1067 = number of strict integer partitions of n in which are empty or have smallest part not dividing the other ones[100]
1068 = number that is the sum of 7 positive 5th powers,[46] total number of parts in all partitions of 15[101]
1069 = emirp[102]
1070 = number that is the sum of 9 positive 5th powers[103]
1071 = heptagonal number[104]
1072 = centered heptagonal number[105]
1073 = number that is the sum of 12 positive 5th powers[75]
1074 = number that is not the sum of two palindromes[95]
1075 = number non-sum of two palindromes[95]
1076 = number of strict trees weight n[106]
1077 = number where 7 outnumbers every other digit in the number[107]
1078 = Euler transform of negative integers[108]
1079 = every positive integer is the sum of at most 1079 tenth powers.
1080 = pentagonal number[109]
1081 = triangular number,[66] member of Padovan sequence[110]
1082 = central polygonal number[68]
1083 = three-quarter square,[111] number of partitions of 53 into prime parts
1084 = third spoke of a hexagonal spiral,[112] 108464 + 1 is prime
1085 = number of partitions of n into distinct parts > or = 2[113]
1086 = Smith number,[114] sum of totient function for first 59 integers
1087 = super-prime, cousin prime, lucky prime[115]
1088 = octo-triangular number, (triangular number result being 136)[116] sum of two distinct powers of 2, (1024 + 64)[117] number that is divisible by exactly seven primes with the inclusion of multiplicity[118]
1089 = 332, nonagonal number, centered octagonal number, first natural number whose digits in its decimal representation get reversed when multiplied by 9.[119]
1090 = sum of 5 positive 5th powers[120]
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[121]), twin prime with 1091 and star number[122]
1094 = sum of 9 positive 5th powers,[103] 109464 + 1 is prime
1095 = sum of 10 positive 5th powers,[123] number that is not the sum of two palindromes
1096 = hendecagonal number,[124] number of strict solid partitions of 18[125]
1097 = emirp,[102] Chen prime
1098 = multiple of 9 containing digit 9 in its base-10 representation[126]
1099 = number where 9 outnumbers every other digit[127]

1100 to 1199

1100 = number of partitions of 61 into distinct squarefree parts[128]
1101 = pinwheel number[129]
1102 = sum of totient function for first 60 integers
1103 = Sophie Germain prime,[52] balanced prime[130]
1104 = Keith number[131]
1105 = 332 + 42 = 322 + 92 = 312 + 122 = 232 + 242, Carmichael number,[132] magic constant of n × n normal magic square and n-queens problem for n = 13, decagonal number,[133] centered square number,[53] Fermat pseudoprime[134]
1106 = number of regions into which the plane is divided when drawing 24 ellipses[135]
1107 = number of non-isomorphic strict T0 multiset partitions of weight 8[136]
1108 = number k such that k64 + 1 is prime
1109 = Friedlander-Iwaniec prime,[137] Chen prime
1110 = k such that 2k + 3 is prime[138]
1111 = 11 × 101, palindrome that is a product of two palindromic primes[139]
1112 = k such that 9k - 2 is a prime[140]
1113 = number of strict partions of 40[141]
1114 = number of ways to write 22 as an orderless product of orderless sums[142]
1115 = number of partitions of 27 into a prime number of parts[143]
1116 = divisible by the number of primes below it
1117 = number of diagonally symmetric polyominoes with 16 cells,[144] Chen prime
1118 = number of unimodular 2 × 2 matrices having all terms in {0,1,...,21}[145]
1119 = number of bipartite graphs with 9 nodes[146]
1120 = number k such that k64 + 1 is prime
1121 = number of squares between 342 and 344.[147]
1122 = pronic number,[89] divisible by the number of primes below it
1123 = balanced prime[130]
1124 = Leyland number[148] = 210 + 102
1125 = Achilles number
1126 = number of 2 × 2 non-singular integer matrices with entries from {0, 1, 2, 3, 4, 5}[149]
1127 = maximal number of pieces that can be obtained by cutting an annulus with 46 cuts[150]
1128 = triangular number,[66] hexagonal number,[67] divisible by the number of primes below it
1129 = number of lattice points inside a circle of radius 19[151]
1130 = skiponacci number[152]
1131 = number of edges in the hexagonal triangle T(26)[153]
1132 = number of simple unlabeled graphs with 9 nodes of 2 colors whose components are complete graphs[154]
1133 = number of primitive subsequences of {1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15}[155]
1134 = divisible by the number of primes below it, triangular matchstick number[86]
1135 = centered triangular number[156]
1136 = number of independent vertex sets and vertex covers in the 7-sunlet graph[157]
1137 = sum of values of vertices at level 5 of the hyperbolic Pascal pyramid[158]
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.
1139 = wiener index of the windmill graph D(3,17)[159]
1140 = tetrahedral number[160]
1141 = 7-Knödel number[161]
1142 = n such that n32 + 1 is prime[162]
1143 = number of set partitions of 8 elements with 2 connectors[163]
1144 is not the sum of a pair of twin primes[164]
1145 = 5-Knödel number[165]
1146 is not the sum of a pair of twin primes[164]
1147 = 31 × 37 (a product of 2 successive primes)[166]
1148 is not the sum of a pair of twin primes[164]
1149 = a product of two palindromic primes[167]
1150 = number of 11-iamonds without bilateral symmetry.[168]
1151 = first prime following a prime gap of 22,[169] Chen prime
1152 = highly totient number,[170] 3-smooth number (27×32), area of a square with diagonal 48,[92] Achilles number
1153 = super-prime, Proth prime[171]
1154 = 2 × 242 + 2 = number of points on surface of tetrahedron with edgelength 24[172]
1155 = number of edges in the join of two cycle graphs, both of order 33[173]
1156 = 342, octahedral number,[174] centered pentagonal number,[84] centered hendecagonal number.[175]
1157 = smallest number that can be written as n^2+1 without any prime factors that can be written as a^2+1.[176]
1158 = number of points on surface of octahedron with edgelength 17[177]
1159 = member of the Mian–Chowla sequence,[56] a centered octahedral number[178]
1160 = octagonal number[179]
1161 = sum of the first 26 primes
1162 = pentagonal number,[109] sum of totient function for first 61 integers
1163 = smallest prime > 342.[180] See Legendre's conjecture. Chen prime.
1164 = number of chains of multisets that partition a normal multiset of weight 8, where a multiset is normal if it spans an initial interval of positive integers[181]
1165 = 5-Knödel number[165]
1166 = heptagonal pyramidal number[182]
1167 = number of rational numbers which can be constructed from the set of integers between 1 and 43[183]
1168 = antisigma(49)[184]
1169 = highly cototient number[81]
1170 = highest possible score in a National Academic Quiz Tournaments (NAQT) match
1171 = super-prime
1172 = number of subsets of first 14 integers that have a sum divisible by 14[185]
1173 = number of simple triangulation on a plane with 9 nodes[186]
1174 = number of widely totally strongly normal compositions of 16
1175 = maximal number of pieces that can be obtained by cutting an annulus with 47 cuts[150]
1176 = triangular number[66]
1177 = heptagonal number[104]
1178 = number of surface points on a cube with edge-length 15[57]
1179 = number of different permanents of binary 7*7 matrices[187]
1180 = smallest number of non-integral partitions into non-integral power >1000.[188]
1181 = smallest k over 1000 such that 8*10^k-49 is prime.[189]
1182 = number of necklaces possible with 14 beads of 2 colors (that cannot be turned over)[190]
1183 = pentagonal pyramidal number
1184 = amicable number with 1210[191]
1185 = number of partitions of 45 into pairwise relatively prime parts[192]
1186 = number of diagonally symmetric polyominoes with 15 cells,[144] number of partitions of 54 into prime parts
1187 = safe prime,[60] Stern prime,[193] balanced prime,[130] Chen prime
1188 = first 4 digit multiple of 18 to contain 18[194]
1189 = number of squares between 352 and 354.[147]
1190 = pronic number,[89] number of cards to build an 28-tier house of cards[195]
1191 = 352 - 35 + 1 = H35 (the 35th Hogben number)[196]
1192 = sum of totient function for first 62 integers
1193 = a number such that 41193 - 31193 is prime, Chen prime
1194 =number of permutations that can be reached with 8 moves of 2 bishops and 1 rook on a 3 × 3 chessboard[197]
1195 = smallest four digit number for which a−1(n) is an integer is a(n) is 2*a(n-1) - (-1)n[198]
1196 = [math]\displaystyle{ \sum_{k=1}^{38} \sigma(k) }[/math][199]
1197 = pinwheel number[129]
1198 = centered heptagonal number[105]
1199 = area of the 20th conjoined trapezoid[200]

1200 to 1299

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,[201] number k such that k64 + 1 is prime
1201 = centered square number,[53] super-prime, centered decagonal number
1202 = number of regions the plane is divided into by 25 ellipses[135]
1203: first 4 digit number in the coordinating sequence for the (2,6,∞) tiling of the hyperbolic plane[202]
1204: magic constant of a 7 × 7 × 7 magic cube[203]
1205 = number of partitions of 28 such that the number of odd parts is a part[204]
1206 = 29-gonal number [205]
1207 = composite de Polignac number[206]
1208 = number of strict chains of divisors starting with the superprimorial A006939(3)[207]
1209 = The product of all ordered non-empty subsets of {3,1} if {a,b} is a||b: 1209=1*3*13*31
1210 = amicable number with 1184[208]
1211 = composite de Polignac number[206]
1212 = [math]\displaystyle{ \sum_{k=0}^{17} p(k) }[/math], where [math]\displaystyle{ p }[/math] is the number of partions of [math]\displaystyle{ k }[/math][209]
1213 = emirp
1214 = sum of first 39 composite numbers[210]
1215 = number of edges in the hexagonal triangle T(27)[153]
1216 = nonagonal number[211]
1217 = super-prime, Proth prime[171]
1218 = triangular matchstick number[86]
1219 = Mertens function zero, centered triangular number[156]
1220 = Mertens function zero, number of binary vectors of length 16 containing no singletons[212]
1221 = product of the first two digit, and three digit repdigit
1222 = hexagonal pyramidal number
1223 = Sophie Germain prime,[52] balanced prime, 200th prime number[130]
1224 = number of edges in the join of two cycle graphs, both of order 34[173]
1225 = 352, square triangular number,[213] hexagonal number,[67] centered octagonal number,[214] icosienneagonal,[215] hexacontagonal[216] and hecatonicositetragonal (124-gonal).
1226 = number of rooted identity trees with 15 nodes [217]
1227 = smallest number representable as the sum of 3 triangular numbers in 27 ways[218]
1228 = sum of totient function for first 63 integers
1229 = Sophie Germain prime,[52] number of primes between 0 and 10000, emirp
1230 = the Mahonian number: T(9, 6)[219]
1231 = smallest mountain emirp, as 121, smallest mountain number is 11 × 11
1232 = number of labeled ordered set of partitions of a 7-set into odd parts[220]
1233 = 122 + 332
1234 = number of parts in all partitions of 30 into distinct parts,[83] smallest whole number containing all numbers from 1 to 4
1235 = excluding duplicates, contains the first four Fibbonacci numbers [221]
1236 = 617 + 619: sum of twin prime pair[222]
1237 = prime of the form 2p-1
1238 = number of partitions of 31 that do not contain 1 as a part[72]
1239 = toothpick number in 3D[223]
1240 = square pyramidal number[55]
1241 = centered cube number[224]
1242 = decagonal number[133]
1243 = composite de Polignac number[206]
1244 = number of complete partitions of 25[225]
1245 = Number of labeled spanning intersecting set-systems on 5 vertices.[226]
1246 = number of partitions of 38 such that no part occurs more than once[227]
1247 = pentagonal number[109]
1248 = the first four powers of 2 concatenated together
1249 = emirp, trimorphic number[228]
1250 = area of a square with diagonal 50[92]
1251 = 2 × 252 + 1 = number of different 2 × 2 determinants with integer entries from 0 to 25[229]
1252 = 2 × 252 + 2 = number of points on surface of tetrahedron with edgelength 25[172]
1253 = number of partitions of 23 with at least one distinct part[230]
1254 = number of partitions of 23 into relatively prime parts[231]
1255 = Mertens function zero, number of ways to write 23 as an orderless product of orderless sums,[142] number of partitions of 23[232]
1256 = 1 × 2 × (52)2 + 6,[233] Mertens function zero
1257 = number of lattice points inside a circle of radius 20[151]
1258 = 1 × 2 × (52)2 + 8,[233] Mertens function zero
1259 = highly cototient number[81]
1260 = highly composite number,[234] pronic number,[89] the smallest vampire number,[235] sum of totient function for first 64 integers, number of strict partions of 41[141] and appears twice in the Book of Revelation
1261 = star number,[122] Mertens function zero
1262 = maximal number of regions the plane is divided into by drawing 36 circles[236]
1263 = rounded total surface area of a regular tetrahedron with edge length 27[237]
1264 = sum of the first 27 primes
1265 = number of rooted trees with 43 vertices in which vertices at the same level have the same degree[238]
1266 = centered pentagonal number,[84] Mertens function zero
1267 = 7-Knödel number[161]
1268 = number of partitions of 37 into prime power parts[239]
1269 = least number of triangles of the Spiral of Theodorus to complete 11 revolutions[240]
1270 = 25 + 24×26 + 23×27,[241] Mertens function zero
1271 = sum of first 40 composite numbers[210]
1272 = sum of first 41 nonprimes[242]
1273 = 19 × 67 = 19 × prime(19)[243]
1274 = sum of the nontriangular numbers between successive triangular numbers
1275 = triangular number,[66] sum of the first 50 natural numbers
1276 = number of irredundant sets in the 25-cocktail party graph[244]
1277 = the start of a prime constellation of length 9 (a "prime nonuple")
1278 = number of Narayana's cows and calves after 20 years[245]
1279 = Mertens function zero, Mersenne prime exponent
1280 = Mertens function zero, number of parts in all compositions of 9[246]
1281 = octagonal number[179]
1282 = Mertens function zero, number of partitions of 46 into pairwise relatively prime parts[192]
1283 = safe prime[60]
1284 = 641 + 643: sum of twin prime pair[222]
1285 = Mertens function zero, number of free nonominoes, number of parallelogram polyominoes with 10 cells.[247]
1286 = number of inequivalent connected planar figures that can be formed from five 1 X 2 rectangles (or dominoes) such that each pair of touching rectangles shares exactly one edge, of length 1, and the adjacency graph of the rectangles is a tree[248]
1287 = [math]\displaystyle{ {13 \choose 5} }[/math][249]
1288 = heptagonal number[104]
1289 = Sophie Germain prime,[52] Mertens function zero
1290 = [math]\displaystyle{ \frac{1289 + 1291}{2} }[/math], average of a twin prime pair[250]
1291 = largest prime < 64,[251] Mertens function zero
1292 = number such that phi(1292) = phi(sigma(1292)),[252] Mertens function zero
1293 = [math]\displaystyle{ \sum_{j=1}^n j \times prime(j) }[/math][253]
1294 = rounded volume of a regular octahedron with edge length 14[254]
1295 = number of edges in the join of two cycle graphs, both of order 35[173]
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[129]
1298 = number of partitions of 55 into prime parts
1299 = Mertens function zero, number of partitions of 52 such that the smallest part is greater than or equal to number of parts[255]

1300 to 1399

1300 = Sum of the first 4 fifth powers, mertens function zero, largest possible win margin in an NAQT match; smallest even odd-factor hyperperfect number
1301 = centered square number,[53] Honaker prime,[256] number of trees with 13 unlabeled nodes[257]
1302 = Mertens function zero, number of edges in the hexagonal triangle T(28)[153]
1303 = prime of form 21n+1 and 31n+1[258][259]
1304 = sum of 13046 and 1304 9 which is 328+976
1305 = triangular matchstick number[86]
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.[156]
1307 = safe prime[60]
1308 = sum of totient function for first 65 integers
1309 = the first sphenic number followed by two consecutive such number
1310 = smallest number in the middle of a set of three sphenic numbers
1311 = number of integer partitions of 32 with no part dividing all the others[260]
1312 = member of the Mian-Chowla sequence;[56]
1313 = sum of all parts of all partitions of 14 [261]
1314 = number of integer partitions of 41 whose distinct parts are connected[262]
1315 = 10^(2n+1)-7*10^n-1 is prime.[263]
1316 = Euler transformation of sigma(11)[264]
1317 = 1317 Only odd four digit number to divide the concatenation of all number up to itself in base 25[265]
1318512 + 1 is prime,[266] Mertens function zero
1319 = safe prime[60]
1320 = 659 + 661: sum of twin prime pair[222]
1321 = Friedlander-Iwaniec prime[137]
1322 = area of the 21st conjoined trapezoid[200]
1323 = Achilles number
1324 = if D(n) is the nth representation of 1, 2 arranged lexicographically. 1324 is the first non-1 number which is D(D(x))[267]
1325 = Markov number,[268] centered tetrahedral number[269]
1326 = triangular number,[66] hexagonal number,[67] 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[210]
1330 = tetrahedral number,[148] forms a Ruth–Aaron pair with 1331 under second definition
1331 = 113, centered heptagonal number,[105] 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[89]
1333 = 372 - 37 + 1 = H37 (the 37th Hogben number)[196]
1334 = maximal number of regions the plane is divided into by drawing 37 circles[236]
1335 = pentagonal number,[109] Mertens function zero
1336 = sum of gcd(x, y) for 1 <= x, y <= 24,[270] Mertens function zero
1337 = Used in the novel form of spelling called leet. Approximate melting point of gold in kelvins.
1338 = atomic number of the noble element of period 18,[271] Mertens function zero
1339 = First 4 digit number to appear twice in the sequence of sum of cubes of primes dividing n[272]
1340 = k such that 5 × 2k - 1 is prime[273]
1341 = First mountain number with 2 jumps of more than one.
1342 = [math]\displaystyle{ \sum_{k=1}^{40} \sigma(k) }[/math],[199] Mertens function zero
1343 = cropped hexagone[274]
1344 = 372 - 52, the only way to express 1344 as a difference of prime squares[275]
1345 = k such that k, k+1 and k+2 are products of two primes[276]
1346= number of locally disjointed rooted trees with 10 nodes[277]
1347 = concatenation of first 4 Lucas numbers [278]
1348 = number of ways to stack 22 pennies such that every penny is in a stack of one or two[279]
1349 = Stern-Jacobsthal number[280]
1350 = nonagonal number[211]
1351 = number of partitions of 28 into a prime number of parts[143]
1352 = number of surface points on a cube with edge-length 16,[57] Achilles number
1353 = 2 × 262 + 1 = number of different 2 × 2 determinants with integer entries from 0 to 26[229]
1354 = 2 × 262 + 2 = number of points on surface of tetrahedron with edgelength 26[172]
1355 appears for the first time in the Recamán's sequence at n = 325,374,625,245.[281] Or in other words A057167(1355) = 325,374,625,245[282][283]
1356 is not the sum of a pair of twin primes[164]
1357 = number of nonnegative solutions to x2 + y2 ≤ 412[284]
1358 = rounded total surface area of a regular tetrahedron with edge length 28[237]
1359 is the 42d term of Flavius Josephus's sieve[285]
1360 = 372 - 32, the only way to express 1360 as a difference of prime squares[275]
1361 = first prime following a prime gap of 34,[169] centered decagonal number, Honaker prime[256]
1362 = number of achiral integer partitions of 48[286]
1363 = the number of ways to modify a circular arrangement of 14 objects by swapping one or more adjacent pairs[287]
1364 = Lucas number[288]
1365 = pentatope number[289]
1366 = Arima number, after Yoriyuki Arima who in 1769 constructed this sequence as the number of moves of the outer ring in the optimal solution for the Chinese Rings puzzle[290]
1367 = safe prime,[60] 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),[130]
1368 = number of edges in the join of two cycle graphs, both of order 36[173]
1369 = 372, centered octagonal number[214]
1370 = σ2(37): sum of squares of divisors of 37[291]
1371 = sum of the first 28 primes
1372 = Achilles number
1373 = number of lattice points inside a circle of radius 21[151]
1374 = number of unimodular 2 × 2 matrices having all terms in {0,1,...,23}[145]
1375 = decagonal pyramidal number[292]
1376 = primitive abundant number (abundant number all of whose proper divisors are deficient numbers)[293]
1377 = maximal number of pieces that can be obtained by cutting an annulus with 51 cuts[150]
1378 = triangular number[66]
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[294]
1381 = centered pentagonal number[84] Mertens function zero
1382 = first 4 digit tetrachi number [295]
1383 = 3 × 461. 101383 + 7 is prime[296]
1384 = [math]\displaystyle{ \sum_{k=1}^{41} \sigma(k) }[/math][199]
1385 = up/down number[297]
1386 = octagonal pyramidal number[298]
1387 = 5th Fermat pseudoprime of base 2,[299] 22nd centered hexagonal number and the 19th decagonal number,[133] second Super-Poulet number.[300]
1388 = 4 × 192 - 3 × 19 + 1 and is therefore on the x-axis of Ulams spiral[301]
1389 = sum of first 42 composite numbers[210]
1390 = sum of first 43 nonprimes[242]
1391 = number of rational numbers which can be constructed from the set of integers between 1 and 47[183]
1392 = number of edges in the hexagonal triangle T(29)[153]
1393 = 7-Knödel number[161]
1394 = sum of totient function for first 67 integers
1395 = vampire number,[235] member of the Mian–Chowla sequence[56] triangular matchstick number[86]
1396 = centered triangular number[156]
1397 = [math]\displaystyle{ \left \lfloor 5^{\frac{9}{2}} \right \rfloor }[/math][302]
1398 = number of integer partitions of 40 whose distinct parts are connected[262]
1399 = emirp[303]

1400 to 1499

1400 = number of sum-free subsets of {1, ..., 15}[304]
1401 = pinwheel number[129]
1402 = number of integer partitions of 48 whose augmented differences are distinct[305]
1403 = smallest x such that M(x) = 11, where M() is Mertens function[306]
1404 = heptagonal number[104]
1405 = 262 + 272, 72 + 82 + ... + 162, centered square number[53]
1406 = pronic number,[89] semi-meandric number[307]
1407 = 382 - 38 + 1 = H38 (the 38th Hogben number)[196]
1408 = maximal number of regions the plane is divided into by drawing 38 circles[236]
1409 = super-prime, Sophie Germain prime,[52] smallest number whose eighth power is the sum of 8 eighth powers, Proth prime[171]
1410 = denominator of the 46th Bernoulli number[308]
1411 = LS(41)[309]
1412 = LS(42)[309]
1413 = LS(43)[309]
1414 = smallest composite that when added to sum of prime factors reaches a prime after 27 iterations[310]
1415 = the Mahonian number: T(8, 8)[219]
1416 = LS(46)[309]
1417 = number of partitions of 32 in which the number of parts divides 32[311]
1418 = smallest x such that M(x) = 13, where M() is Mertens function[306]
1419 = Zeisel number[312]
1420 = Number of partitions of 56 into prime parts
1421 = maximum dimension of Euclidean spaces which suffice for every smooth compact Riemannian 29-manifold to be realizable as a sub-manifold[313]
1422 = number of partitions of 15 with two parts marked[314]
1423 = 200 + 1223 and the 200th prime is 1223[315] Also Used as a Hate symbol
1424 = number of nonnegative solutions to x2 + y2 ≤ 422[284]
1425 = self-descriptive number in base 5
1426 = sum of totient function for first 68 integers, pentagonal number,[109] number of strict partions of 42[141]
1427 = twin prime together with 1429[316]
1428 = number of complete ternary trees with 6 internal nodes, or 18 edges[317]
1429 = number of partitions of 53 such that the smallest part is greater than or equal to number of parts[255]
1430 = Catalan number[318]
1431 = triangular number,[66] hexagonal number[67]
1432 = member of Padovan sequence[110]
1433 = super-prime, Honaker prime,[256] typical port used for remote connections to Microsoft SQL Server databases
1434 = rounded volume of a regular tetrahedron with edge length 23[319]
1435 = vampire number;[235] the standard railway gauge in millimetres, equivalent to 4 feet 8 1⁄2 inches (1.435 m)
1436 = discriminant of a totally real cubic field[320]
1437 = smallest number of complexity 20: smallest number requiring 20 1's to build using +, * and ^[321]
1438 = k such that 5 × 2k - 1 is prime[273]
1439 = Sophie Germain prime,[52] safe prime[60]
1440 = a highly totient number[170] 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[122]
1442 = number of parts in all partitions of 31 into distinct parts[83]
1443 = the sum of the second trio of three-digit permutable primes in decimal: 337, 373, and 733. Also the number of edges in the join of two cycle graphs, both of order 37[173]
1444 = 382, smallest pandigital number in Roman numerals
1445 = [math]\displaystyle{ \sum_{k=0}^3 \left( \binom{3}{k} \times \binom{3+k}{k} \right) ^2 }[/math][322]
1446 = number of points on surface of octahedron with edgelength 19[177]
1447 = super-prime, happy number
1448 = number k such that phi(prime(k)) is a square[323]
1449 = Stella octangula number
1450 = σ2(34): sum of squares of divisors of 34[291]
1451 = Sophie Germain prime[52]
1452 = first Zagreb index of the complete graph K12[324]
1453 = Sexy prime with 1459
1454 = 3 × 222 + 2 = number of points on surface of square pyramid of side-length 22[325]
1455 = k such that geometric mean of phi(k) and sigma(k) is an integer[326]
1456 = number of regions in regular 15-gon with all diagonals drawn[327]
1457 = 2 × 272 − 1 = a twin square[328]
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 = The number of years that would have to pass in the Julian calendar in order to accrue a full year's worth of leap days.
1461 = number of partitions of 38 into prime power parts[239]
1462 = (35 - 1) × (35 + 8) = the first Zagreb index of the wheel graph with 35 vertices[329]
1463 = total number of parts in all partitions of 16[101]
1464 = rounded total surface area of a regular icosahedron with edge length 13[330]
1465 = 5-Knödel number[165]
1466 = [math]\displaystyle{ \sum_{k=1}^{256} d(k) }[/math], where [math]\displaystyle{ d(k) }[/math] = number of divisors of [math]\displaystyle{ k }[/math][331]
1467 = number of partitions of 39 with zero crank[332]
1468 = number of polyhexes with 11 cells that tile the plane by translation[333]
1469 = octahedral number,[174] highly cototient number[81]
1470 = pentagonal pyramidal number,[334] sum of totient function for first 69 integers
1471 = super-prime, centered heptagonal number[105]
1472 = number of overpartitions of 15[335]
1473 = cropped hexagone[274]
1474 = [math]\displaystyle{ \frac{44(44 + 1)}{2} + \frac{44^2}{4} }[/math]: triangular number plus quarter square (i.e., A000217(44) + A002620(44))[336]
1475 = number of partitions of 33 into parts each of which is used a different number of times[337]
1476 = coreful perfect number[338]
1477 = 7-Knödel number[161]
1478 = total number of largest parts in all compositions of 11[339]
1479 = number of planar partitions of 12[340]
1480 = sum of the first 29 primes
1481 = Sophie Germain prime[52]
1482 = pronic number,[89] number of unimodal compositions of 15 where the maximal part appears once[341]
1483 = 392 - 39 + 1 = H39 (the 39th Hogben number)[196]
1484 = maximal number of regions the plane is divided into by drawing 39 circles[236]
1485 = triangular number
1486 = number of strict solid partitions of 19[125]
1487 = safe prime[60]
1488 = triangular matchstick number[86]
1489 = centered triangular number[156]
1490 = tetranacci number[342]
1491 = nonagonal number,[211] Mertens function zero
1492 = discriminant of a totally real cubic field,[320] Mertens function zero
1493 = Stern prime[193]
1494 = sum of totient function for first 70 integers
1495 = 9###[343]
1496 = square pyramidal number[55]
1497 = skiponacci number[152]
1498 = number of flat partitions of 41[344]
1499 = Sophie Germain prime,[52] super-prime

1500 to 1599

1500 = hypotenuse in three different Pythagorean triangles[345]
1501 = centered pentagonal number[84]
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[346]
1503 = least number of triangles of the Spiral of Theodorus to complete 12 revolutions[240]
1504 = primitive abundant number (abundant number all of whose proper divisors are deficient numbers)[293]
1505 = number of integer partitions of 41 with distinct differences between successive parts[347]
1506 = number of Golomb partitions of 28[348]
1507 = number of partitions of 32 that do not contain 1 as a part[72]
1508 = heptagonal pyramidal number[182]
1509 = pinwheel number[129]
1510 = deficient number, odious number
1511 = Sophie Germain prime,[52] balanced prime[130]
1512 = k such that geometric mean of phi(k) and sigma(k) is an integer[326]
1513 = centered square number[53]
1514 = sum of first 44 composite numbers[210]
1515 = maximum dimension of Euclidean spaces which suffice for every smooth compact Riemannian 30-manifold to be realizable as a sub-manifold[313]
1516 = [math]\displaystyle{ \left \lfloor 9^\frac{10}{3} \right \rfloor }[/math][349]
1517 = number of lattice points inside a circle of radius 22[151]
1518 = sum of first 32 semiprimes,[350] Mertens function zero
1519 = number of polyhexes with 8 cells,[351] Mertens function zero
1520 = pentagonal number,[109] Mertens function zero, forms a Ruth–Aaron pair with 1521 under second definition
1521 = 392, Mertens function zero, centered octagonal number,[214] forms a Ruth–Aaron pair with 1520 under second definition
1522 = k such that 5 × 2k - 1 is prime[273]
1523 = super-prime, Mertens function zero, safe prime,[60] member of the Mian–Chowla sequence[56]
1524 = Mertens function zero, k such that geometric mean of phi(k) and sigma(k) is an integer[326]
1525 = heptagonal number,[104] Mertens function zero
1526 = number of conjugacy classes in the alternating group A27[352]
1527 = number of 2-dimensional partitions of 11,[353] Mertens function zero
1528 = Mertens function zero, rounded total surface area of a regular octahedron with edge length 21[354]
1529 = composite de Polignac number[206]
1530 = vampire number[235]
1531 = prime number, centered decagonal number, Mertens function zero
1532 = number of series-parallel networks with 9 unlabeled edges,[355] Mertens function zero
1533 = 21 × 73 = 21 × 21st prime[243]
1534 = number of achiral integer partitions of 50[286]
1535 = Thabit number
1536 = a common size of microplate, 3-smooth number (29×3), number of threshold functions of exactly 4 variables[356]
1537 = Keith number,[131] Mertens function zero
1538 = number of surface points on a cube with edge-length 17[57]
1539 = maximal number of pieces that can be obtained by cutting an annulus with 54 cuts[150]
1540 = triangular number, hexagonal number,[67] decagonal number,[133] tetrahedral number[148]
1541 = octagonal number[179]
1542 = k such that 2^k starts with k[357]
1543 = prime dividing all Fibonacci sequences,[358] Mertens function zero
1544 = Mertens function zero, number of partitions of integer partitions of 17 where all parts have the same length[359]
1545 = number of reversible string structures with 9 beads using exactly three different colors[360]
1546 = number of 5 X 5 binary matrices with at most one 1 in each row and column,[361] Mertens function zero
1547 = hexagonal pyramidal number
1548 = coreful perfect number[338]
1549 = de Polignac prime[362]
1550 = [math]\displaystyle{ \frac {31 \times (3 \times 31 + 7)}{2} }[/math] = number of cards needed to build a 31-tier house of cards with a flat, one-card-wide roof[363]
1551 = 6920 - 5369 = A169952(24) - A169952(23) = A169942(24) = number of Golomb rulers of length 24[364][365]
1552 = Number of partitions of 57 into prime parts
1553 = 509 + 521 + 523 = a prime that is the sum of three consecutive primes[366]
1554 = 2 × 3 × 7 × 37 = product of four distinct primes[367]
15552 divides 61554[368]
1556 = sum of the squares of the first nine primes
1557 = number of graphs with 8 nodes and 13 edges[369]
1558 = number k such that k64 + 1 is prime
1559 = Sophie Germain prime[52]
1560 = pronic number[89]
1561 = a centered octahedral number,[178] number of series-reduced trees with 19 nodes[370]
1562 = maximal number of regions the plane is divided into by drawing 40 circles[236]
1563 = [math]\displaystyle{ \sum_{k=1}^{50} \frac{50}{\gcd(50,k)} }[/math][371]
1564 = sum of totient function for first 71 integers
1565 = [math]\displaystyle{ \sqrt{1036^2+1173^2} }[/math] and [math]\displaystyle{ 1036+1173=47^2 }[/math][372]
1566 = number k such that k64 + 1 is prime
1567 = number of partitions of 24 with at least one distinct part[230]
1568 = Achilles number[373]
1569 = 2 × 282 + 1 = number of different 2 × 2 determinants with integer entries from 0 to 28[229]
1570 = 2 × 282 + 2 = number of points on surface of tetrahedron with edgelength 28[172]
1571 = Honaker prime[256]
1572 = member of the Mian–Chowla sequence[56]
1573 = discriminant of a totally real cubic field[320]
1574256 + 1 is prime[374]
1575 = odd abundant number,[375] sum of the nontriangular numbers between successive triangular numbers, number of partitions of 24[232]
157614 == 1 (mod 15^2)[376]
1577 = sum of the quadratic residues of 83[377]
1578 = sum of first 45 composite numbers[210]
1579 = number of partitions of 54 such that the smallest part is greater than or equal to number of parts[255]
1580 = number of achiral integer partitions of 51[286]
1581 = number of edges in the hexagonal triangle T(31)[153]
1582 = a number such that the integer triangle [A070080(1582), A070081(1582), A070082(1582)] has an integer area[378]
1583 = Sophie Germain prime
1584 = triangular matchstick number[86]
1585 = Riordan number, centered triangular number[156]
1586 = area of the 23rd conjoined trapezoid[200]
1587 = 3 × 232 = number of edges of a complete tripartite graph of order 69, K23,23,23[379]
1588 = sum of totient function for first 72 integers
1589 = composite de Polignac number[206]
1590 = rounded volume of a regular icosahedron with edge length 9[380]
1591 = rounded volume of a regular octahedron with edge length 15[254]
1592 = sum of all divisors of the first 36 odd numbers[381]
1593 = sum of the first 30 primes
1594 = minimal cost of maximum height Huffman tree of size 17[382]
1595 = number of non-isomorphic set-systems of weight 10
1596 = triangular number
1597 = Fibonacci prime,[383] Markov prime,[268] super-prime, emirp
1598 = number of unimodular 2 × 2 matrices having all terms in {0,1,...,25}[145]
1599 = number of edges in the join of two cycle graphs, both of order 39[173]

1600 to 1699

1600 = 402, structured great rhombicosidodecahedral number,[384] 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 to 2015)
1601 = Sophie Germain prime, Proth prime,[171] the novel 1601 (Mark Twain)
1602 = number of points on surface of octahedron with edgelength 20[177]
1603 = number of partitions of 27 with nonnegative rank[385]
1604 = number of compositions of 22 into prime parts[386]
1605 = number of polyominoes consisting of 7 regular octagons[387]
1606 = enneagonal pyramidal number[388]
1607 = member of prime triple with 1609 and 1613[389]
1608 = [math]\displaystyle{ \sum_{k=1}^{44} \sigma(k) }[/math][199]
1609 = cropped hexagonal number[274]
1610 = number of strict partions of 43[141]
1611 = number of rational numbers which can be constructed from the set of integers between 1 and 51[183]
1612 = maximum dimension of Euclidean spaces which suffice for every smooth compact Riemannian 31-manifold to be realizable as a sub-manifold[313]
1613, 1607 and 1619 are all primes[390]
1614 = number of ways of refining the partition 8^1 to get 1^8[391]
1615 = composite number such that the square mean of its prime factors is a nonprime integer[392]
1616 = [math]\displaystyle{ \frac{16(16^2 + 3 \times 16 - 1)}{3} }[/math] = number of monotonic triples (x,y,z) in {1,2,...,16}3[393]
1617 = pentagonal number[109]
1618 = centered heptagonal number[105]
1619 = palindromic prime in binary, safe prime[60]
1620 = 809 + 811: sum of twin prime pair[222]
1621 = super-prime, pinwheel number[129]
1622 = semiprime of the form prime + 1[394]
1623 is not the sum of two triangular numbers and a fourth power[395]
1624 = number of squares in the Aztec diamond of order 28[396]
1625 = centered square number[53]
1626 = centered pentagonal number[84]
1627 = prime and 2 × 1627 - 1 = 3253 is also prime[397]
1628 = centered pentagonal number[84]
1629 = rounded volume of a regular tetrahedron with edge length 24[319]
1630 = number k such that k^64 + 1 is prime
1631 = [math]\displaystyle{ \sum_{k=0}^{5} (k+1)! \binom{5}{k} }[/math][398]
1632 = number of acute triangles made from the vertices of a regular 18-polygon[399]
1633 = star number[122]
1634 = Narcissistic number in base 10
1635 = number of partitions of 56 whose reciprocal sum is an integer[400]
1636 = number of nonnegative solutions to x2 + y2 ≤ 452[284]
1637 = prime island: least prime whose adjacent primes are exactly 30 apart[401]
1638 = harmonic divisor number,[402] 5 × 21638 - 1 is prime[273]
1639 = nonagonal number[211]
1640 = pronic number[89]
1641 = 412 - 41 + 1 = H41 (the 41st Hogben number)[196]
1642 = maximal number of regions the plane is divided into by drawing 41 circles[236]
1643 = sum of first 46 composite numbers[210]
1644 = 821 + 823: sum of twin prime pair[222]
1645 = number of 16-celled pseudo still lifes in Conway's Game of Life, up to rotation and reflection[403]
1646 = number of graphs with 8 nodes and 14 edges[369]
1647 and 1648 are both divisible by cubes[404]
1648 = number of partitions of 343 into distinct cubes[405]
1649 = highly cototient number,[81] Leyland number[148]
1650 = number of cards to build an 33-tier house of cards[195]
1651 = heptagonal number[104]
1652 = number of partitions of 29 into a prime number of parts[143]
1653 = triangular number, hexagonal number,[67] number of lattice points inside a circle of radius 23[151]
1654 = number of partitions of 42 into divisors of 42[406]
1655 = rounded volume of a regular dodecahedron with edge length 6[407]
1656 = 827 + 829: sum of twin prime pair[222]
1657 = cuban prime,[408] prime of the form 2p-1
1658 = smallest composite that when added to sum of prime factors reaches a prime after 25 iterations[310]
1659 = number of rational numbers which can be constructed from the set of integers between 1 and 52[183]
1660 = sum of totient function for first 73 integers
1661 = 11 × 151, palindrome that is a product of two palindromic primes[139]
1662 = number of partitions of 49 into pairwise relatively prime parts[192]
1663 = a prime number and 51663 - 41663 is a 1163-digit prime number[409]
1664 = k such that k, k+1 and k+2 are sums of 2 squares[410]
1665 = centered tetrahedral number[269]
1666 = largest efficient pandigital number in Roman numerals (each symbol occurs exactly once)
1667 = 228 + 1439 and the 228th prime is 1439[315]
1668 = number of partitions of 33 into parts all relatively prime to 33[411]
1669 = super-prime, smallest prime with a gap of exactly 24 to the next prime[412]
1670 = number of compositions of 12 such that at least two adjacent parts are equal[413]
1671 divides the sum of the first 1671 composite numbers[414]
1672 = 412 - 32, the only way to express 1672 as a difference of prime squares[275]
1673 = RMS number[415]
1674 = k such that geometric mean of phi(k) and sigma(k) is an integer[326]
1675 = Kin number[416]
1676 = number of partitions of 34 into parts each of which is used a different number of times[337]
1677 = 412 - 22, the only way to express 1677 as a difference of prime squares[275]
1678 = n such that n32 + 1 is prime[162]
1679 = highly cototient number,[81] semiprime (23 × 73, see also Arecibo message), number of parts in all partitions of 32 into distinct parts[83]
1680 = highly composite number,[234] number of edges in the join of two cycle graphs, both of order 40[173]
1681 = 412, smallest number yielded by the formula n2 + n + 41 that is not a prime; centered octagonal number[214]
1682 = and 1683 is a member of a Ruth–Aaron pair (first definition)
1683 = triangular matchstick number[86]
1684 = centered triangular number[156]
1685 = 5-Knödel number[165]
1686 = [math]\displaystyle{ \sum_{k=1}^{45} \sigma(k) }[/math][199]
1687 = 7-Knödel number[161]
1688 = number of finite connected sets of positive integers greater than one with least common multiple 72[417]
1689 = [math]\displaystyle{ 9!!\sum_{k=0}^{4} \frac{1}{2k+1} }[/math][418]
1690 = number of compositions of 14 into powers of 2[419]
1691 = the same upside down, which makes it a strobogrammatic number[420]
1692 = coreful perfect number[338]
1693 = smallest prime > 412.[180]
1694 = number of unimodular 2 × 2 matrices having all terms in {0,1,...,26}[145]
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
1697 = Friedlander-Iwaniec prime[137]
1698 = number of rooted trees with 47 vertices in which vertices at the same level have the same degree[238]
1699 = number of rooted trees with 48 vertices in which vertices at the same level have the same degree[238]

1700 to 1799

1700 = σ2(39): sum of squares of divisors of 39[291]
1701 = [math]\displaystyle{ \left\{ {8 \atop 4} \right\} }[/math], decagonal number, hull number of the U.S.S. Enterprise on Star Trek
1702 = palindromic in 3 consecutive bases: 89814, 78715, 6A616
1703 = 1703131131 / 1000077 and the divisors of 1703 are 1703, 131, 13 and 1[421]
1704 = sum of the squares of the parts in the partitions of 18 into two distinct parts[422]
1705 = tribonacci number[423]
1706 = 1 + 4 + 16 + 64 + 256 + 1024 + 256 + 64 + 16 + 4 + 1 sum of fifth row of triangle of powers of 4[424]
1707 = number of partitions of 30 in which the number of parts divides 30[311]
1708 = 22 × 7 × 61 a number whose product of prime indices 1 × 1 × 4 × 18 is divisible by its sum of prime factors 2 + 2 + 7 + 61[425]
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
1710 = maximal number of pieces that can be obtained by cutting an annulus with 57 cuts[150]
1711 = triangular number, centered decagonal number
1712 = number of irredundant sets in the 29-cocktail party graph[244]
1713 = number of aperiodic rooted trees with 12 nodes[426]
1714 = number of regions formed by drawing the line segments connecting any two of the 18 perimeter points of an 3 × 6 grid of squares[427]
1715 = k such that geometric mean of phi(k) and sigma(k) is an integer[326]
1716 = 857 + 859: sum of twin prime pair[222]
1717 = pentagonal number[109]
1718 = [math]\displaystyle{ \sum_{d|12} \binom{12}{d} }[/math][428]
1719 = composite de Polignac number[206]
1720 = sum of the first 31 primes
1721 = twin prime; number of squares between 422 and 424.[147]
1722 = Giuga number,[429] pronic number[89]
1723 = super-prime
1724 = maximal number of regions the plane is divided into by drawing 42 circles[236]
1725 = 472 - 222 = (prime(15))2 - (nonprime(15))2[430]
1726 = number of partitions of 44 into distinct and relatively prime parts[431]
1727 = area of the 24th conjoined trapezoid[200]
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.
1730 = 3 × 242 + 2 = number of points on surface of square pyramid of side-length 24[325]
1731 = k such that geometric mean of phi(k) and sigma(k) is an integer[326]
1732 = [math]\displaystyle{ \sum_{k=0}^5 \binom{5}{k}^k }[/math][432]
1733 = Sophie Germain prime, palindromic in bases 3, 18, 19.
1734 = surface area of a cube of edge length 17[433]
1735 = number of partitions of 55 such that the smallest part is greater than or equal to number of parts[255]
1736 = sum of totient function for first 75 integers, number of surface points on a cube with edge-length 18[57]
1737 = pinwheel number[129]
1738 = number of achiral integer partitions of 52[286]
1739 = number of 1s in all partitions of 30 into odd parts[434]
1740 = number of squares in the Aztec diamond of order 29[396]
1741 = super-prime, centered square number[53]
1742 = number of regions the plane is divided into by 30 ellipses[135]
1743 = wiener index of the windmill graph D(3,21)[159]
1744 = k such that k, k+1 and k+2 are sums of 2 squares[410]
1745 = 5-Knödel number[165]
1746 = number of unit-distance graphs on 8 nodes[435]
1747 = balanced prime[130]
1748 = number of partitions of 55 into distinct parts in which the number of parts divides 55[436]
1749 = number of integer partitions of 33 with no part dividing all the others[260]
1750 = hypotenuse in three different Pythagorean triangles[345]
1751 = cropped hexagone[274]
1752 = 792 - 672, the only way to express 1752 as a difference of prime squares[275]
1753 = balanced prime[130]
1754 = k such that 5*2k - 1 is prime[273]
1755 = number of integer partitions of 50 whose augmented differences are distinct[305]
1756 = centered pentagonal number[84]
1757 = least number of triangles of the Spiral of Theodorus to complete 13 revolutions[240]
1758 = [math]\displaystyle{ \sum_{k=1}^{46} \sigma(k) }[/math][199]
1759 = de Polignac prime[362]
1760 = the number of yards in a mile
1761 = k such that k, k+1 and k+2 are products of two primes[276]
1762 = number of binary sequences of length 12 and curling number 2[437]
1763 = number of edges in the join of two cycle graphs, both of order 41[173]
1764 = 422
1765 = number of stacks, or planar partitions of 15[438]
1766 = number of points on surface of octahedron with edgelength 21[177]
1767 = σ(282) = σ(352)[439]
1768 = number of nonequivalent dissections of an hendecagon into 8 polygons by nonintersecting diagonals up to rotation[440]
1769 = maximal number of pieces that can be obtained by cutting an annulus with 58 cuts[150]
1770 = triangular number, hexagonal number,[67] Seventeen Seventy, town in Australia
1771 = tetrahedral number[148]
1772 = centered heptagonal number,[105] sum of totient function for first 76 integers
1773 = number of words of length 5 over the alphabet {1,2,3,4,5} such that no two even numbers appear consecutively[441]
1774 = number of rooted identity trees with 15 nodes and 5 leaves[442]
1775 = [math]\displaystyle{ \sum_{1\leq i\leq 10}prime(i)\cdot(2\cdot i-1) }[/math]: sum of piles of first 10 primes[443]
1776 = square star number.[444] The number of pieces that could be seen in a 7 × 7 × 7× 7 Rubik's Tesseract.
1777 = smallest prime > 422.[180]
1778 = least k >= 1 such that the remainder when 6k is divided by k is 22[445]
1779 = number of achiral integer partitions of 53[286]
1780 = number of lattice paths from (0, 0) to (7, 7) using E (1, 0) and N (0, 1) as steps that horizontally cross the diagonal y = x with even many times[446]
1781 = the first 1781 digits of e form a prime[447]
1782 = heptagonal number[104]
1783 = de Polignac prime[362]
1784 = number of subsets of {1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12} such that every pair of distinct elements has a different quotient[448]
1785 = square pyramidal number,[55] triangular matchstick number[86]
1786 = centered triangular number[156]
1787 = super-prime, sum of eleven consecutive primes (137 + 139 + 149 + 151 + 157 + 163 + 167 + 173 + 179 + 181 + 191)
1788 = Euler transform of -1, -2, ..., -34[449]
1789 = number of wiggly sums adding to 17 (terms alternately increase and decrease or vice versa)[450]
1790 = number of partitions of 50 into pairwise relatively prime parts[192]
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[151]
1794 = nonagonal number,[211] number of partitions of 33 that do not contain 1 as a part[72]
1795 = number of heptagons with perimeter 38[451]
1796 = k such that geometric mean of phi(k) and sigma(k) is an integer[326]
1797 = number k such that phi(prime(k)) is a square[323]
1798 = 2 × 29 × 31 = 102 × 111012 × 111112, which yield zero when the prime factors are xored together[452]
1799 = 2 × 302 − 1 = a twin square[328]

1800 to 1899

1800 = pentagonal pyramidal number,[334] 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)[408]
1802 = 2 × 302 + 2 = number of points on surface of tetrahedron with edgelength 30,[172] number of partitions of 30 such that the number of odd parts is a part[204]
1803 = number of decahexes that tile the plane isohedrally but not by translation or by 180-degree rotation (Conway criterion)[453]
1804 = number k such that k^64 + 1 is prime
1805 = number of squares between 432 and 434.[147]
1806 = pronic number,[89] product of first four terms of Sylvester's sequence, primary pseudoperfect number,[454] only number for which n equals the denominator of the nth Bernoulli number,[455] Schröder number[456]
1807 = fifth term of Sylvester's sequence[457]
1808 = maximal number of regions the plane is divided into by drawing 43 circles[236]
1809 = sum of first 17 super-primes[458]
1810 = [math]\displaystyle{ \sum_{k=0}^4 \binom{4}{k}^4 }[/math][459]
1811 = Sophie Germain prime
1812 = n such that n32 + 1 is prime[162]
1813 = number of polyominoes with 26 cells, symmetric about two orthogonal axes[460]
1814 = 1 + 6 + 36 + 216 + 1296 + 216 + 36 + 6 + 1 = sum of 4th row of triangle of powers of six[461]
1815 = polygonal chain number [math]\displaystyle{ \#(P^3_{2,1}) }[/math][462]
1816 = number of strict partions of 44[141]
1817 = total number of prime parts in all partitions of 20[463]
1818 = n such that n32 + 1 is prime[162]
1819 = sum of the first 32 primes, minus 32[464]
1820 = pentagonal number,[109] pentatope number,[289] number of compositions of 13 whose run-lengths are either weakly increasing or weakly decreasing[465]
1821 = member of the Mian–Chowla sequence[56]
1822 = number of integer partitions of 43 whose distinct parts are connected[262]
1823 = super-prime, safe prime[60]
1824 = 432 - 52, the only way to express 1824 as a difference of prime squares[275]
1825 = octagonal number[179]
1826 = decagonal pyramidal number[292]
1827 = vampire number[235]
1828 = meandric number, open meandric number, appears twice in the first 10 decimal digits of e
1829 = composite de Polignac number[206]
1830 = triangular number
1831 = smallest prime with a gap of exactly 16 to next prime (1847)[466]
1832 = sum of totient function for first 77 integers
1833 = number of atoms in a decahedron with 13 shells[467]
1834 = octahedral number,[174] sum of the cubes of the first five primes
1835 = absolute value of numerator of [math]\displaystyle{ D_6^{(5)} }[/math][468]
1836 = factor by which a proton is more massive than an electron
1837 = star number[122]
1838 = number of unimodular 2 × 2 matrices having all terms in {0,1,...,27}[145]
1839 = [math]\displaystyle{ \lfloor \sqrt[3]{13!} \rfloor }[/math][469]
1840 = 432 - 32, the only way to express 1840 as a difference of prime squares[275]
1841 = solution to the postage stamp problem with 3 denominations and 29 stamps,[470] Mertens function zero
1842 = number of unlabeled rooted trees with 11 nodes[471]
1843 = k such that phi(k) is a perfect cube,[472] Mertens function zero
1844 = 37 - 73,[473] Mertens function zero
1845 = number of partitions of 25 containing at least one prime,[474] Mertens function zero
1846 = sum of first 49 composite numbers[210]
1847 = super-prime
1848 = number of edges in the join of two cycle graphs, both of order 42[173]
1849 = 432, palindromic in base 6 (= 123216), centered octagonal number[214]
1850 = Number of partitions of 59 into prime parts
1851 = sum of the first 32 primes
1852 = number of quantales on 5 elements, up to isomorphism[475]
1853 = sum of primitive roots of 27-th prime,[476] Mertens function zero
1854 = number of permutations of 7 elements with no fixed points,[477] Mertens function zero
1855 = rencontres number: number of permutations of [7] with exactly one fixed point[478]
1856 = sum of totient function for first 78 integers
1857 = Mertens function zero, pinwheel number[129]
1858 = number of 14-carbon alkanes C14H30 ignoring stereoisomers[479]
1859 = composite de Polignac number[206]
1860 = number of squares in the Aztec diamond of order 30[480]
1861 = centered square number,[53] 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, [math]\displaystyle{ \frac{1864!-2}{2} }[/math] is a prime[481]
1865 = 123456: Largest senary metadrome (number with digits in strict ascending order in base 6)[482]
1866 = Mertens function zero, number of plane partitions of 16 with at most two rows[483]
1867 = prime de Polignac number[362]
1868 = smallest number of complexity 21: smallest number requiring 21 1's to build using +, * and ^[321]
1869 = Hultman number: SH(7, 4)[484]
1870 = decagonal number[133]
1871 = the first prime of the 2 consecutive twin prime pairs: (1871, 1873) and (1877, 1879)[485]
1872 = first Zagreb index of the complete graph K13[324]
1873 = number of Narayana's cows and calves after 21 years[245]
1874 = area of the 25th conjoined trapezoid[200]
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[486]
1878 = n such that n32 + 1 is prime[162]
1879 = a prime with square index[487]
1880 = the 10th element of the self convolution of Lucas numbers[488]
1881 = tricapped prism number[489]
1882 = number of linearly separable Boolean functions in 4 variables[490]
1883 = number of conjugacy classes in the alternating group A28[352]
1884 = k such that 5*2k - 1 is prime[273]
1885 = Zeisel number[312]
1886 = number of partitions of 64 into fourth powers[491]
1887 = number of edges in the hexagonal triangle T(34)[153]
1888 = primitive abundant number (abundant number all of whose proper divisors are deficient numbers)[293]
1889 = Sophie Germain prime, highly cototient number[81]
1890 = triangular matchstick number[86]
1891 = triangular number, hexagonal number,[67] centered pentagonal number,[84] centered triangular number[156]
1892 = pronic number[89]
1893 = 442 - 44 + 1 = H44 (the 44th Hogben number)[196]
1894 = maximal number of regions the plane is divided into by drawing 44 circles[236]
1895 = Stern-Jacobsthal number[280]
1896 = member of the Mian-Chowla sequence[56]
1897 = member of Padovan sequence,[110] number of triangle-free graphs on 9 vertices[492]
1898 = smallest multiple of n whose digits sum to 26[493]
1899 = cropped hexagone[274]

1900 to 1999

1900 = number of primes <= 214.[63] Also 1900 (film) or Novecento, 1976 movie. 1900 was the year Thorold Gosset introduced his list of semiregular polytopes; it is also the year Max Brückner published his study of polyhedral models, including stellations of the icosahedron, such as the novel final stellation of the icosahedron.
1901 = Sophie Germain prime, centered decagonal number
1902 = number of symmetric plane partitions of 27[494]
1903 = generalized catalan number[495]
1904 = number of flat partitions of 43[344]
1905 = Fermat pseudoprime[134]
1906 = number n such that 3n - 8 is prime[496]
1907 = safe prime,[60] balanced prime[130]
1908 = coreful perfect number[338]
1909 = hyperperfect number[497]
1910 = number of compositions of 13 having exactly one fixed point[498]
1911 = heptagonal pyramidal number[182]
1912 = size of 6th maximum raising after one blind in pot-limit poker[499]
1913 = super-prime, Honaker prime[256]
1914 = number of bipartite partitions of 12 white objects and 3 black ones[500]
1915 = number of nonisomorphic semigroups of order 5[501]
1916 = sum of first 50 composite numbers[210]
1917 = number of partitions of 51 into pairwise relatively prime parts[192]
1918 = heptagonal number[104]
1919 = smallest number with reciprocal of period length 36 in base 10[502]
1920 = sum of the nontriangular numbers between successive triangular numbers
1921 = 4-dimensional centered cube number[503]
1922 = Area of a square with diagonal 62[92]
1923 = 2 × 312 + 1 = number of different 2 X 2 determinants with integer entries from 0 to 31[229]
1924 = 2 × 312 + 2 = number of points on surface of tetrahedron with edgelength 31[172]
1925 = number of ways to write 24 as an orderless product of orderless sums[142]
1926 = pentagonal number[109]
1927 = 211 - 112[504]
1928 = number of distinct values taken by 2^2^...^2 (with 13 2's and parentheses inserted in all possible ways)[505]
1929 = Mertens function zero, number of integer partitions of 42 whose distinct parts are connected[262]
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[346]
1931 = Sophie Germain prime
1932 = number of partitions of 40 into prime power parts[239]
1933 = centered heptagonal number,[105] Honaker prime[256]
1934 = sum of totient function for first 79 integers
1935 = number of edges in the join of two cycle graphs, both of order 43[173]
1936 = 442, 18-gonal number,[506] 324-gonal number.
1937 = number of chiral n-ominoes in 12-space, one cell labeled[507]
1938 = Mertens function zero, number of points on surface of octahedron with edgelength 22[177]
1939 = 7-Knödel number[161]
1940 = the Mahonian number: T(8, 9)[219]
1941 = maximal number of regions obtained by joining 16 points around a circle by straight lines[508]
1942 = number k for which 10k + 1, 10k + 3, 10k + 7, 10k + 9 and 10k + 13 are primes[509]
1943 = largest number not the sum of distinct tetradecagonal numbers[510]
1944 = 3-smooth number (23×35), Achilles number[373]
1945 = number of partitions of 25 into relatively prime parts such that multiplicities of parts are also relatively prime[511]
1946 = number of surface points on a cube with edge-length 19[57]
1947 = k such that 5·2k + 1 is a prime factor of a Fermat number 22m + 1 for some m[512]
1948 = number of strict solid partitions of 20[125]
1949 = smallest prime > 442.[180]
1950 = [math]\displaystyle{ 1 \cdot 2 \cdot 3 + 4 \cdot 5 \cdot 6 + 7 \cdot 8 \cdot 9 + 10 \cdot 11 \cdot 12 }[/math],[513] largest number not the sum of distinct pentadecagonal numbers[510]
1951 = cuban prime[408]
1952 = number of covers of {1, 2, 3, 4}[514]
1953 = triangular number
1954 = number of sum-free subsets of {1, ..., 16}[304]
1955 = number of partitions of 25 with at least one distinct part[230]
1956 = nonagonal number[211]
1957 = [math]\displaystyle{ \sum_{k=0}^{6} \frac{6!}{k!} }[/math] = total number of ordered k-tuples (k=0,1,2,3,4,5,6) of distinct elements from an 6-element set[515]
1958 = number of partitions of 25[232]
1959 = Heptanacci-Lucas number[516]
1960 = number of parts in all partitions of 33 into distinct parts[83]
1961 = number of lattice points inside a circle of radius 25[151]
1962 = number of edges in the join of the complete graph K36 and the cycle graph C36[517]
1963! - 1 is prime[518]
1964 = number of linear forests of planted planar trees with 8 nodes[519]
1965 = total number of parts in all partitions of 17[101]
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[520]
σ(1968) = σ(1967) + σ(1966)[521]
1969 = Only value less than four million for which a "mod-ification" of the standard Ackermann Function does not stabilize[522]
1970 = number of compositions of two types of 9 having no even parts[523]
1971 = [math]\displaystyle{ 3^7-6^3 }[/math][524]
1972 = n such that [math]\displaystyle{ \frac{n^{37}-1}{n-1} }[/math] is prime[525]
1973 = Sophie Germain prime, Leonardo prime
1974 = number of binary vectors of length 17 containing no singletons[212]
1975 = number of partitions of 28 with nonnegative rank[385]
1976 = octagonal number[179]
1977 = number of non-isomorphic multiset partitions of weight 9 with no singletons[526]
1978 = n such that n | (3n + 5)[527]
1979 = number of squares between 452 and 454.[147]
1980 = pronic number[89]
1981 = pinwheel number[129]
1982 = maximal number of regions the plane is divided into by drawing 45 circles[236]
1983 = skiponacci number[152]
1984 = 11111000000 in binary, see also: 1984 (disambiguation)
1985 = centered square number[53]
1986 = number of ways to write 25 as an orderless product of orderless sums[142]
1987 = 300th prime number
1988 = sum of the first 33 primes
1989 = number of 9-step mappings with 4 inputs[294]
1990 = Stella octangula number
1991 = 11 × 181, the 46th Gullwing number,[528] palindromic composite number with only palindromic prime factors[529]
1992 = number of nonisomorphic sets of nonempty subsets of a 4-set[530]
1993 = a number with the property that 41993 - 31993 is prime,[531] number of partitions of 30 into a prime number of parts[143]
1994 = Glaisher's function W(37)[532]
1995 = number of unlabeled graphs on 9 vertices with independence number 6[533]
1996 = a number with the property that (1996! + 3)/3 is prime[534]
1997 = [math]\displaystyle{ \sum_{k=1}^{21} {k \cdot \phi(k)} }[/math][535]
1998 = triangular matchstick number[86]
1999 = centered triangular number[536] number of regular forms in a myriagram.

Prime numbers

There are 135 prime numbers between 1000 and 2000:[537][538]

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

Notes

  1. ↑ 1000 is the fourth Wiener index of the grid [math]\displaystyle{ P_{4} \times P_{4} }[/math] where [math]\displaystyle{ P_{4} }[/math] is the path graph on four vertices.[7] A connected graph with a given Wiener index represents the sum of the distances between all unordered pairs of vertices in said graph.
  2. ↑ In the sequence of regular 1000-gonal numbers of the form [math]\displaystyle{ n \times (499n - 498) }[/math], the first non-trivial solution is 2997.[13] In Chowla's function, that counts the sum of divisors except for [math]\displaystyle{ 1 }[/math] and [math]\displaystyle{ n }[/math], 2997 is the first number to have a value of 1600,[15] which is the Euler totient of 4000 and 6000,[16] while the fifth member in the sequence 9985 (that follows 0, 1, 1000, 2997 and 5992)[13] has an average of divisors that is 2997;[17][18] with 5992 ÷ 2 = 2996, and 1000 + 2997 + 5992 = 9989 (a difference of 4 from the fourth member, after 1).
    There are 499 regular star polygrams to the regular chiliagon: 300 are regular compound star forms — a count that represents the twenty-fourth triangular number[19] — with the remaining 199 forms represented by simple regular star polygons.
  3. ↑ 1600, a repdigit in septenary (44447),[23] is the composite index of 1891, in turn the like-index of 2223.[22]
    2222 and 8888 are both numbers n such that n − 1 is prime (as with 4, 44, 444, and 888),[24] yielding respectively the 331st and 1107th prime numbers,[25] where the former (2221) is also the 64th super-prime.[26] These two prime indexes collectively have a range of 777 integers (1107 : 331), which as a number is also a repdigit in senary.[27]
  4. ↑ The sum (2 + 3 + 5 + ... + 29) of the first 10 prime numbers is 129, which is the 97th indexed composite number.[29][22] 9973 is also the 201st super-prime,[26] where 1000 − 201 = 799, which is the smallest number in decimal to have a digit sum of 25,[30] and the mirror permutation of digits of 997.
    When splitting four-digit 9973 into two two-digit numbers, 99 and 73, the latter is the composite index of 99, that, when added together is 172, the one hundred and thirty-second composite, with 132 itself the 99th composite;[22] 73 is the twenty-first prime number.[25]
    1601 is the 252nd prime,[25] itself a value with a composite index of 197,[22] where 1601 is the 40th and largest consecutive prime lucky number of Euler of the form n2 + n + 41.[31][32] The number of 4-digit prime numbers, in decimal, is its mirror permutation of digits 1061, the 172nd prime.[33]
    Also, 7, 97 and 997 are all three respectively at a difference of 3 from 10, 100 and 1000, where, on the other hand, 9973 is 27 = 33 away from 10000.
    Note, that 8 as a binary number is "1000",[34] and this representation, when written in factorial base, is equivalent to 2410.[35] In primorial base, it is equal to 3010.[36]

References

  1. ↑ "chiliad". Merriam-Webster. https://www.merriam-webster.com/dictionary/chiliad. 
  2. ↑ Sloane, N. J. A., ed. "Sequence A051876 (24-gonal numbers.)". OEIS Foundation. https://oeis.org/A051876. Retrieved 2022-11-30. 
  3. ↑ Sloane, N. J. A., ed. "Sequence A316729 (Generalized 30-gonal (or triacontagonal) numbers: m*(14*m - 13) with m equal to 0, +1, -1, +2, -2, +3, -3, ...)". OEIS Foundation. https://oeis.org/A316729. Retrieved 2024-01-21. 
  4. ↑ Sloane, N. J. A., ed. "Sequence A034828 (a(n) equal to floor(n^2/4)*(n/2).)". OEIS Foundation. https://oeis.org/A034828. Retrieved 2024-01-21. 
  5. ↑ Ngaokrajang, Kival. "Illustration for n equal to 1..10 [A034828."]. in Sloane, N. J. A.. OEIS Foundation. https://oeis.org/A034828/a034828.jpg. 
  6. ↑ Janjic, M.; Petkovic, B. (2013). "A Counting Function". pp. 14, 15. arXiv:1301.4550 [math.CO]. Bibcode: 2013arXiv1301.4550J
  7. ↑ Sloane, N. J. A., ed. "Sequence A143945 (Wiener index of the grid P_n x P_n, where P_n is the path graph on n vertices.)". OEIS Foundation. https://oeis.org/A143945. Retrieved 2024-01-21. 
  8. ↑ Sloane, N. J. A., ed. "Sequence A054501 (Multiplicity sequence for classification of nonattacking queens on n X n toroidal board.)". OEIS Foundation. https://oeis.org/A054501. Retrieved 2024-01-21. 
  9. ↑ Sloane, N. J. A., ed. "Sequence A054500 (Indicator sequence for classification of nonattacking queens on n X n toroidal board.)". OEIS Foundation. https://oeis.org/A054500. Retrieved 2024-01-21. 
  10. ↑ Sloane, N. J. A., ed. "Sequence A054502 (Counting sequence for classification of nonattacking queens on n X n toroidal board.)". OEIS Foundation. https://oeis.org/A054502. Retrieved 2024-01-21. 
  11. ↑ I. Rivin, I. Vardi and P. Zimmermann (1994). The n-queens problem. American Mathematical Monthly. Washington, D.C.: Mathematical Association of America. 101 (7): 629–639. doi:10.1080/00029890.1994.11997004 JSTOR 2974691
  12. ↑ Sloane, N. J. A., ed. "Sequence A364349 (Number of strict integer partitions of n containing the sum of no subset of the parts.)". OEIS Foundation. https://oeis.org/A364349. Retrieved 2024-01-21. 
  13. ↑ 13.0 13.1 13.2 Sloane, N. J. A., ed. "Sequence A195163 (1000-gonal numbers: a(n) equal to n*(499*n - 498).)". OEIS Foundation. https://oeis.org/A195163. Retrieved 2024-01-21. 
  14. ↑ Aṣiru, Muniru A. (2016). "All square chiliagonal numbers". International Journal of Mathematical Education in Science and Technology (Oxfordshire: Taylor & Francis) 47 (7): 1123–1134.. doi:10.1080/0020739X.2016.1164346. Bibcode: 2016IJMES..47.1123A. 
  15. ↑ Sloane, N. J. A., ed. "Sequence A048050 (Chowla's function: sum of divisors of n except for 1 and n.)". OEIS Foundation. https://oeis.org/A048050. Retrieved 2024-01-21. 
  16. ↑ 16.0 16.1 16.2 16.3 16.4 16.5 Sloane, N. J. A., ed. "Sequence A000010 (Euler totient function phi(n): count numbers less than or equal to n and prime to n.)". OEIS Foundation. https://oeis.org/A000010. Retrieved 2023-12-18. 
  17. ↑ Sloane, N. J. A., ed. "Sequence A003601 (Numbers n such that the average of the divisors of n is an integer: sigma_0(n) divides sigma_1(n).)". OEIS Foundation. https://oeis.org/A003601. Retrieved 2023-07-16. 
  18. ↑ Sloane, N. J. A., ed. "Sequence A102187 (Arithmetic means of divisors of arithmetic numbers (arithmetic numbers, A003601, are those for which the average of the divisors is an integer).)". OEIS Foundation. https://oeis.org/A102187. Retrieved 2023-07-16. 
  19. ↑ Sloane, N. J. A., ed. "Sequence A000217 (Triangular numbers: a(n) is the binomial(n+1,2): n*(n+1)/2 equal to 0 + 1 + 2 + ... + n.)". OEIS Foundation. https://oeis.org/A000217. Retrieved 2024-01-21. 
  20. ↑ Sloane, N. J. A., ed. "Sequence A002322 (Reduced totient function psi(n): least k such that x^k is congruent 1 (mod n) for all x prime to n; also known as the Carmichael lambda function (exponent of unit group mod n); also called the universal exponent of n.)". OEIS Foundation. https://oeis.org/A002322. Retrieved 2023-12-18. 
  21. ↑ Sloane, N. J. A., ed. "Sequence A002088 (Sum of totient function: a(n) is Sum_{k equal to1..n} phi(k), cf. A000010.)". OEIS Foundation. https://oeis.org/A002088. Retrieved 2023-12-18. 
  22. ↑ 22.0 22.1 22.2 22.3 22.4 Sloane, N. J. A., ed. "Sequence A002808 (The composite numbers: numbers n of the form x*y for x > 1 and y > 1.)". OEIS Foundation. https://oeis.org/A002808. Retrieved 2023-12-18. 
  23. ↑ Sloane, N. J. A., ed. "Sequence A048332 (Numbers that are repdigits in base 7.)". OEIS Foundation. https://oeis.org/A048332. Retrieved 2023-12-21. 
  24. ↑ Sloane, N. J. A., ed. "Sequence A028987 (Repdigit - 1 is prime.)". OEIS Foundation. https://oeis.org/A028987. Retrieved 2023-12-21. 
  25. ↑ 25.0 25.1 25.2 25.3 Cite error: Invalid <ref> tag; no text was provided for refs named PNum
  26. ↑ 26.0 26.1 Sloane, N. J. A., ed. "Sequence A006450 (Prime-indexed primes: primes with prime subscripts.)". OEIS Foundation. https://oeis.org/A006450. Retrieved 2023-12-19. 
  27. ↑ Sloane, N. J. A., ed. "Sequence A048331 (Numbers that are repdigits in base 6.)". OEIS Foundation. https://oeis.org/A048331. Retrieved 2023-12-21. 
  28. ↑ Sloane, N. J. A., ed. "Sequence A366581 (a(n) equal to phi(p(n)), where phi is Euler's totient function (A000010) and p(n) is the number of partitions of n (A000041).)". OEIS Foundation. https://oeis.org/A366581. Retrieved 2023-12-18. 
  29. ↑ Sloane, N. J. A., ed. "Sequence A127337 (Numbers that are the sum of 10 consecutive primes.)". OEIS Foundation. https://oeis.org/A127337. Retrieved 2023-12-18. 
  30. ↑ Sloane, N. J. A., ed. "Sequence A051885 (Smallest number whose sum of digits is n.)". OEIS Foundation. https://oeis.org/A051885. Retrieved 2023-12-20. 
  31. ↑ Sloane, N. J. A., ed. "Sequence A202018 (a(n) equal to n^2 + n + 41.)". OEIS Foundation. https://oeis.org/A202018. Retrieved 2023-12-22. 
  32. ↑ Sloane, N. J. A., ed. "Sequence A005846 (Primes of the form n^2 + n + 41.)". OEIS Foundation. https://oeis.org/A005846. Retrieved 2023-12-22. 
  33. ↑ Sloane, N. J. A., ed. "Sequence A006879 (Number of primes with n digits.)". OEIS Foundation. https://oeis.org/A006879. Retrieved 2023-12-21. 
  34. ↑ Sloane, N. J. A., ed. "Sequence A007088 (The binary numbers (or binary words, or binary vectors, or binary expansion of n): numbers written in base 2.)". OEIS Foundation. https://oeis.org/A007088. Retrieved 2023-12-21. 
  35. ↑ Sloane, N. J. A., ed. "Sequence A007623 (Integers written in factorial base.)". OEIS Foundation. https://oeis.org/A007623. Retrieved 2023-12-21. 
  36. ↑ Sloane, N. J. A., ed. "Sequence A049345 (n written in primorial base.)". OEIS Foundation. https://oeis.org/A049345. Retrieved 2024-01-21. 
  37. ↑ "1000". Prime Curious!. https://primes.utm.edu/curios/page.php/1000.html. 
  38. ↑ Sloane, N. J. A., ed. "Sequence A152396 (Let f(M,k) denote the decimal concatenation of k numbers starting with M: M | M-1 | M-2 | ... | M-k+1, k greater than 1. Then a(n) is the smallest M such that for all m in {1,..,n} an m-th prime occurs as f(M,k) for the smallest possible k, order prioritized m equal to 1 through n.)". OEIS Foundation. https://oeis.org/A152396. Retrieved 2023-12-22. 
  39. ↑ Sloane, N. J. A., ed. "Sequence A227949 (Primes obtained by concatenating decremented numbers starting at a power of 10.)". OEIS Foundation. https://oeis.org/A227949. Retrieved 2023-12-22. 
  40. ↑ Ronan, Mark (2006). Symmetry and the Monster: One of the Greatest Quests of Mathematics. New York: Oxford University Press. pp. vii, 1–255. doi:10.1007/s00283-008-9007-9. ISBN 978-0-19-280722-9. OCLC 180766312. 
  41. ↑ Sloane, N. J. A., ed. "Sequence A001228 (Orders of sporadic simple groups.)". OEIS Foundation. https://oeis.org/A001228. Retrieved 2023-12-18. 
  42. ↑ Sloane, N. J. A., ed. "Sequence A122189 (Heptanacci numbers)". OEIS Foundation. https://oeis.org/A122189. Retrieved 2017-07-13. 
  43. ↑ Sloane, N. J. A., ed. "Sequence A007585 (10-gonal (or decagonal) pyramidal numbers)". OEIS Foundation. https://oeis.org/A007585. Retrieved 2022-05-24. 
  44. ↑ Sloane, N. J. A., ed. "Sequence A332307 (Array read by antidiagonals: T(m,n) is the number of (undirected) Hamiltonian paths in the m X n grid graph)". OEIS Foundation. https://oeis.org/A332307. Retrieved 2023-01-08. 
  45. ↑ Sloane, N. J. A., ed. "Sequence A036063 (Increasing gaps among twin primes: size)". OEIS Foundation. https://oeis.org/A036063. Retrieved 2023-01-08. 
  46. ↑ 46.0 46.1 Sloane, N. J. A., ed. "Sequence A003352 (Numbers that are the sum of 7 positive 5th powers)". OEIS Foundation. https://oeis.org/A003352. Retrieved 2023-10-10. 
  47. ↑ Sloane, N. J. A., ed. "Sequence A061341 (A061341 Numbers not ending in 0 whose cubes are concatenations of other cubes)". OEIS Foundation. https://oeis.org/A061341. Retrieved 2023-01-08. 
  48. ↑ Sloane, N. J. A., ed. "Sequence A003353 (Numbers that are the sum of 8 positive 5th powers)". OEIS Foundation. https://oeis.org/A003353. Retrieved 2023-10-10. 
  49. ↑ Sloane, N. J. A., ed. "Sequence A034262 (a(n) = n^3 + n)". OEIS Foundation. https://oeis.org/A034262. Retrieved 2022-05-24. 
  50. ↑ 50.0 50.1 Sloane, N. J. A., ed. "Sequence A020473 (Egyptian fractions: number of partitions of 1 into reciprocals of positive integers < n+1)". OEIS Foundation. https://oeis.org/A020473. Retrieved 2022-05-24. 
  51. ↑ Sloane, N. J. A., ed. "Sequence A046092 (4 times triangular numbers: a(n) = 2*n*(n+1))". OEIS Foundation. https://oeis.org/A046092. Retrieved 2023-10-10. 
  52. ↑ 52.00 52.01 52.02 52.03 52.04 52.05 52.06 52.07 52.08 52.09 52.10 52.11 52.12 52.13 52.14 Sloane, N. J. A., ed. "Sequence A005384 (Sophie Germain primes p: 2p+1 is also prime)". OEIS Foundation. https://oeis.org/A005384. Retrieved 2016-06-12. 
  53. ↑ 53.0 53.1 53.2 53.3 53.4 53.5 53.6 53.7 53.8 53.9 Sloane, N. J. A., ed. "Sequence A001844 (Centered square numbers)". OEIS Foundation. https://oeis.org/A001844. Retrieved 2016-06-12. 
  54. ↑ Sloane, N. J. A., ed. "Sequence A000325 (2^n - n)". OEIS Foundation. https://oeis.org/A000325. Retrieved 2022-05-24. 
  55. ↑ 55.0 55.1 55.2 55.3 Sloane, N. J. A., ed. "Sequence A000330 (Square pyramidal numbers)". OEIS Foundation. https://oeis.org/A000330. Retrieved 2016-06-12. 
  56. ↑ 56.0 56.1 56.2 56.3 56.4 56.5 56.6 56.7 Sloane, N. J. A., ed. "Sequence A005282 (Mian-Chowla sequence)". OEIS Foundation. https://oeis.org/A005282. Retrieved 2016-06-12. 
  57. ↑ 57.0 57.1 57.2 57.3 57.4 57.5 Sloane, N. J. A., ed. "Sequence A005897 (6*n^2 + 2 for n > 0)". OEIS Foundation. https://oeis.org/A005897. 
  58. ↑ Sloane, N. J. A., ed. "Sequence A316729 (Generalized 30-gonal (or triacontagonal) numbers: m*(14*m - 13) with m = 0, +1, -1, +2, -2, +3, -3)". OEIS Foundation. https://oeis.org/A316729. Retrieved 2023-10-10. 
  59. ↑ Sloane, N. J. A., ed. "Sequence A006313 (Numbers n such that n^16 + 1 is prime)". OEIS Foundation. https://oeis.org/A006313. Retrieved 2022-05-24. 
  60. ↑ 60.00 60.01 60.02 60.03 60.04 60.05 60.06 60.07 60.08 60.09 60.10 60.11 Sloane, N. J. A., ed. "Sequence A005385 (Safe primes p: (p-1)/2 is also prime)". OEIS Foundation. https://oeis.org/A005385. Retrieved 2016-06-12. 
  61. ↑ Sloane, N. J. A., ed. "Sequence A034964 (Sums of five consecutive primes.)". OEIS Foundation. https://oeis.org/A034964. Retrieved 2022-11-01. 
  62. ↑ Sloane, N. J. A., ed. "Sequence A000162 (Number of 3-dimensional polyominoes (or polycubes) with n cells.)". OEIS Foundation. https://oeis.org/A000162. Retrieved 2022-11-01. 
  63. ↑ 63.0 63.1 Sloane, N. J. A., ed. "Sequence A007053 (Number of primes < 2^n+1)". OEIS Foundation. https://oeis.org/A007053. Retrieved 2022-06-02. 
  64. ↑ Sloane, N. J. A., ed. "Sequence A004023 (Indices of prime repunits: numbers n such that 11...111 (with n 1's)... is prime)". OEIS Foundation. https://oeis.org/A004023. Retrieved 2023-02-25. 
  65. ↑ Sloane, N. J. A., ed. "Sequence A004801 (Sum of 12 positive 9th powers)". OEIS Foundation. https://oeis.org/A004801. Retrieved 2023-10-10. 
  66. ↑ 66.0 66.1 66.2 66.3 66.4 66.5 66.6 66.7 Sloane, N. J. A., ed. "Sequence A000217 (Triangular numbers)". OEIS Foundation. https://oeis.org/A000217. Retrieved 2016-06-12. 
  67. ↑ 67.0 67.1 67.2 67.3 67.4 67.5 67.6 67.7 67.8 Sloane, N. J. A., ed. "Sequence A000384 (Hexagonal numbers)". OEIS Foundation. https://oeis.org/A000384. Retrieved 2016-06-12. 
  68. ↑ 68.0 68.1 Sloane, N. J. A., ed. "Sequence A000124 (Central polygonal numbers (the Lazy Caterer's sequence): n(n+1)/2 + 1; or, maximal number of pieces formed when slicing a pancake with n cuts)". OEIS Foundation. https://oeis.org/A000124. 
  69. ↑ Sloane, N. J. A., ed. "Sequence A161328 (E-toothpick sequence (see Comments lines for definition))". OEIS Foundation. https://oeis.org/A161328. Retrieved 2023-10-10. 
  70. ↑ Sloane, N. J. A., ed. "Sequence A023036 (Smallest positive even integer that is an unordered sum of two primes in exactly n ways)". OEIS Foundation. https://oeis.org/A023036. Retrieved 2023-10-10. 
  71. ↑ Sloane, N. J. A., ed. "Sequence A007522 (Primes of the form 8n+7, that is, primes congruent to -1 mod 8)". OEIS Foundation. https://oeis.org/A007522. Retrieved 2023-10-10. 
  72. ↑ 72.0 72.1 72.2 72.3 Sloane, N. J. A., ed. "Sequence A002865 (Number of partitions of n that do not contain 1 as a part)". OEIS Foundation. https://oeis.org/A002865. Retrieved 2022-06-02. 
  73. ↑ 73.0 73.1 Sloane, N. J. A., ed. "Sequence A000695 (Moser-de Bruijn sequence: sums of distinct powers of 4)". OEIS Foundation. https://oeis.org/A000695. Retrieved 2023-10-10. 
  74. ↑ "A003356 - Oeis". https://oeis.org/A003356. 
  75. ↑ 75.0 75.1 "A003357 - Oeis". https://oeis.org/A003357. 
  76. ↑ "A036301 - Oeis". https://oeis.org/A036301. 
  77. ↑ "A000567 - Oeis". https://oeis.org/A000567. 
  78. ↑ "A000025 - Oeis". https://oeis.org/A000025. 
  79. ↑ "A336130 - Oeis". https://oeis.org/A336130. 
  80. ↑ "A073576 - Oeis". https://oeis.org/A073576. 
  81. ↑ 81.0 81.1 81.2 81.3 81.4 81.5 81.6 "Sloane's A100827 : Highly cototient numbers". OEIS Foundation. https://oeis.org/A100827. 
  82. ↑ "Base converter | number conversion". https://www.rapidtables.com/convert/number/base-converter.html?x=1050&sel1=3&sel2=10. 
  83. ↑ 83.0 83.1 83.2 83.3 83.4 Sloane, N. J. A., ed. "Sequence A015723 (Number of parts in all partitions of n into distinct parts)". OEIS Foundation. https://oeis.org/A015723. 
  84. ↑ 84.0 84.1 84.2 84.3 84.4 84.5 84.6 84.7 84.8 "Sloane's A005891 : Centered pentagonal numbers". OEIS Foundation. https://oeis.org/A005891. 
  85. ↑ "A003365 - Oeis". https://oeis.org/A003365. 
  86. ↑ 86.00 86.01 86.02 86.03 86.04 86.05 86.06 86.07 86.08 86.09 86.10 Sloane, N. J. A., ed. "Sequence A045943 (Triangular matchstick numbers: 3*n*(n+1)/2)". OEIS Foundation. https://oeis.org/A045943. Retrieved 2022-06-02. 
  87. ↑ "A005448 - Oeis". https://oeis.org/A005448. 
  88. ↑ "A003368 - Oeis". https://oeis.org/A003368. 
  89. ↑ 89.00 89.01 89.02 89.03 89.04 89.05 89.06 89.07 89.08 89.09 89.10 89.11 89.12 "Sloane's A002378 : Oblong (or promic, pronic, or heteromecic) numbers". OEIS Foundation. https://oeis.org/A002378. 
  90. ↑ "A002061 - Oeis". https://oeis.org/A002061. 
  91. ↑ "A003349 - Oeis". https://oeis.org/A003349. 
  92. ↑ 92.0 92.1 92.2 92.3 Sloane, N. J. A., ed. "Sequence A001105 (2*n^2)". OEIS Foundation. https://oeis.org/A001105. 
  93. ↑ "A003294 - Oeis". https://oeis.org/A003294. 
  94. ↑ Sloane, N. J. A., ed. "Sequence A006879 (Number of primes with n digits.)". OEIS Foundation. https://oeis.org/A006879. 
  95. ↑ 95.0 95.1 95.2 "A035137 - Oeis". https://oeis.org/A035137. 
  96. ↑ "A347565: Primes p such that A241014(A000720(p)) is +1 or -1". OEIS Foundation. https://oeis.org/A347565. 
  97. ↑ "A003325 - Oeis". https://oeis.org/A003325. 
  98. ↑ "A195162 - Oeis". https://oeis.org/A195162. 
  99. ↑ "A006532 - Oeis". https://oeis.org/A006532. 
  100. ↑ "A341450 - Oeis". https://oeis.org/A341450. 
  101. ↑ 101.0 101.1 101.2 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)". OEIS Foundation. https://oeis.org/A006128. 
  102. ↑ 102.0 102.1 "A006567 - Oeis". https://oeis.org/A006567. 
  103. ↑ 103.0 103.1 "A003354 - Oeis". https://oeis.org/A003354. 
  104. ↑ 104.0 104.1 104.2 104.3 104.4 104.5 104.6 104.7 "Sloane's A000566 : Heptagonal numbers". OEIS Foundation. https://oeis.org/A000566. 
  105. ↑ 105.0 105.1 105.2 105.3 105.4 105.5 105.6 "Sloane's A069099 : Centered heptagonal numbers". OEIS Foundation. https://oeis.org/A069099. 
  106. ↑ "A273873 - Oeis". https://oeis.org/A273873. 
  107. ↑ "A292457 - Oeis". https://oeis.org/A292457. 
  108. ↑ "A073592 - Oeis". https://oeis.org/A073592. 
  109. ↑ 109.0 109.1 109.2 109.3 109.4 109.5 109.6 109.7 109.8 109.9 "Sloane's A000326 : Pentagonal numbers". OEIS Foundation. https://oeis.org/A000326. 
  110. ↑ 110.0 110.1 110.2 "Sloane's A000931 : Padovan sequence". OEIS Foundation. https://oeis.org/A000931. 
  111. ↑ "A077043 - Oeis". https://oeis.org/A077043. 
  112. ↑ "A056107 - Oeis". https://oeis.org/A056107. 
  113. ↑ "A025147 - Oeis". https://oeis.org/A025147. 
  114. ↑ "Sloane's A006753 : Smith numbers". OEIS Foundation. https://oeis.org/A006753. 
  115. ↑ "Sloane's A031157 : Numbers that are both lucky and prime". OEIS Foundation. https://oeis.org/A031157. 
  116. ↑ "A033996 - Oeis". https://oeis.org/A033996. 
  117. ↑ "A018900 - Oeis". https://oeis.org/A018900. 
  118. ↑ "A046308 - Oeis". https://oeis.org/A046308. 
  119. ↑ "Sloane's A001232 : Numbers n such that 9*n = (n written backwards)". OEIS Foundation. https://oeis.org/A001232. 
  120. ↑ "A003350 - Oeis". https://oeis.org/A003350. 
  121. ↑ Wells, D. The Penguin Dictionary of Curious and Interesting Numbers London: Penguin Group. (1987): 163
  122. ↑ 122.0 122.1 122.2 122.3 122.4 "Sloane's A003154 : Centered 12-gonal numbers. Also star numbers". OEIS Foundation. https://oeis.org/A003154. 
  123. ↑ "A003355 - Oeis". https://oeis.org/A003355. 
  124. ↑ "A051682 - Oeis". https://oeis.org/A051682. 
  125. ↑ 125.0 125.1 125.2 Sloane, N. J. A., ed. "Sequence A323657 (Number of strict solid partitions of n)". OEIS Foundation. https://oeis.org/A323657. 
  126. ↑ "A121029 - Oeis". https://oeis.org/A121029. 
  127. ↑ "A292449 - Oeis". https://oeis.org/A292449. 
  128. ↑ Sloane, N. J. A., ed. "Sequence A087188 (number of partitions of n into distinct squarefree parts)". OEIS Foundation. https://oeis.org/A087188. 
  129. ↑ 129.0 129.1 129.2 129.3 129.4 129.5 129.6 129.7 129.8 Sloane, N. J. A., ed. "Sequence A059993 (Pinwheel numbers: 2*n^2 + 6*n + 1)". OEIS Foundation. https://oeis.org/A059993. 
  130. ↑ 130.0 130.1 130.2 130.3 130.4 130.5 130.6 130.7 130.8 "Sloane's A006562 : Balanced primes". OEIS Foundation. https://oeis.org/A006562. 
  131. ↑ 131.0 131.1 "Sloane's A007629 : Repfigit (REPetitive FIbonacci-like diGIT) numbers (or Keith numbers)". OEIS Foundation. https://oeis.org/A007629. 
  132. ↑ "Sloane's A002997 : Carmichael numbers". OEIS Foundation. https://oeis.org/A002997. 
  133. ↑ 133.0 133.1 133.2 133.3 133.4 "Sloane's A001107 : 10-gonal (or decagonal) numbers". OEIS Foundation. https://oeis.org/A001107. 
  134. ↑ 134.0 134.1 Sloane, N. J. A., ed. "Sequence A001567 (Fermat pseudoprimes to base 2, also called Sarrus numbers or Poulet numbers)". OEIS Foundation. https://oeis.org/A001567. 
  135. ↑ 135.0 135.1 135.2 Sloane, N. J. A., ed. "Sequence A051890 (2*(n^2 - n + 1))". OEIS Foundation. https://oeis.org/A051890. 
  136. ↑ Sloane, N. J. A., ed. "Sequence A319560 (Number of non-isomorphic strict T_0 multiset partitions of weight n)". OEIS Foundation. https://oeis.org/A319560. 
  137. ↑ 137.0 137.1 137.2 Sloane, N. J. A., ed. "Sequence A028916 (Friedlander-Iwaniec primes: Primes of form a^2 + b^4)". OEIS Foundation. https://oeis.org/A028916. 
  138. ↑ Sloane, N. J. A., ed. "Sequence A057732 (Numbers k such that 2^k + 3 is prime)". OEIS Foundation. https://oeis.org/A057732. 
  139. ↑ 139.0 139.1 Sloane, N. J. A., ed. "Sequence A046376 (Palindromes with exactly 2 palindromic prime factors (counted with multiplicity), and no other prime factors)". OEIS Foundation. https://oeis.org/A046376. 
  140. ↑ Sloane, N. J. A., ed. "Sequence A128455 (Numbers k such that 9^k - 2 is a prime)". OEIS Foundation. https://oeis.org/A128455. 
  141. ↑ 141.0 141.1 141.2 141.3 141.4 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)". OEIS Foundation. https://oeis.org/A000009. 
  142. ↑ 142.0 142.1 142.2 142.3 Sloane, N. J. A., ed. "Sequence A318949 (Number of ways to write n as an orderless product of orderless sums)". OEIS Foundation. https://oeis.org/A318949. 
  143. ↑ 143.0 143.1 143.2 143.3 Sloane, N. J. A., ed. "Sequence A038499 (Number of partitions of n into a prime number of parts)". OEIS Foundation. https://oeis.org/A038499. 
  144. ↑ 144.0 144.1 Sloane, N. J. A., ed. "Sequence A006748 (Number of diagonally symmetric polyominoes with n cells)". OEIS Foundation. https://oeis.org/A006748. 
  145. ↑ 145.0 145.1 145.2 145.3 145.4 Sloane, N. J. A., ed. "Sequence A210000 (Number of unimodular 2 X 2 matrices having all terms in {0,1,...,n)". OEIS Foundation. https://oeis.org/A210000. }
  146. ↑ Sloane, N. J. A., ed. "Sequence A033995 (Number of bipartite graphs with n nodes)". OEIS Foundation. https://oeis.org/A033995. 
  147. ↑ 147.0 147.1 147.2 147.3 147.4 Sloane, N. J. A., ed. "Sequence A028387 (n + (n+1)^2)". OEIS Foundation. https://oeis.org/A028387. 
  148. ↑ 148.0 148.1 148.2 148.3 148.4 "Sloane's A076980 : Leyland numbers". OEIS Foundation. https://oeis.org/A076980. 
  149. ↑ Sloane, N. J. A., ed. "Sequence A062801 (Number of 2 X 2 non-singular integer matrices with entries from {0,...,n)". OEIS Foundation. https://oeis.org/A062801. }
  150. ↑ 150.0 150.1 150.2 150.3 150.4 150.5 Sloane, N. J. A., ed. "Sequence A000096 (n*(n+3)/2)". OEIS Foundation. https://oeis.org/A000096. 
  151. ↑ 151.0 151.1 151.2 151.3 151.4 151.5 151.6 Sloane, N. J. A., ed. "Sequence A000328". OEIS Foundation. https://oeis.org/A000328. 
  152. ↑ 152.0 152.1 152.2 Sloane, N. J. A., ed. "Sequence A001608 (Perrin sequence)". OEIS Foundation. https://oeis.org/A001608. 
  153. ↑ 153.0 153.1 153.2 153.3 153.4 153.5 Sloane, N. J. A., ed. "Sequence A140091 (3*n*(n + 3)/2)". OEIS Foundation. https://oeis.org/A140091. 
  154. ↑ Sloane, N. J. A., ed. "Sequence A005380". OEIS Foundation. https://oeis.org/A005380. 
  155. ↑ Sloane, N. J. A., ed. "Sequence A051026 (Number of primitive subsequences of 1, 2, ..., n)". OEIS Foundation. https://oeis.org/A051026. 
  156. ↑ 156.0 156.1 156.2 156.3 156.4 156.5 156.6 156.7 156.8 Sloane, N. J. A., ed. "Sequence A005448 (Centered triangular numbers: 3n(n-1)/2 + 1)". OEIS Foundation. https://oeis.org/A005448. 
  157. ↑ Sloane, N. J. A., ed. "Sequence A080040 (2*a(n-1) + 2*a(n-2) for n > 1)". OEIS Foundation. https://oeis.org/A080040. 
  158. ↑ Sloane, N. J. A., ed. "Sequence A264237 (Sum of values of vertices at level n of the hyperbolic Pascal pyramid)". OEIS Foundation. https://oeis.org/A264237. 
  159. ↑ 159.0 159.1 Sloane, N. J. A., ed. "Sequence A033991 (n*(4*n-1))". OEIS Foundation. https://oeis.org/A033991. 
  160. ↑ "Sloane's A000292 : Tetrahedral numbers". OEIS Foundation. https://oeis.org/A000292. 
  161. ↑ 161.0 161.1 161.2 161.3 161.4 161.5 Sloane, N. J. A., ed. "Sequence A208155 (7-Knödel numbers)". OEIS Foundation. https://oeis.org/A208155. 
  162. ↑ 162.0 162.1 162.2 162.3 162.4 Sloane, N. J. A., ed. "Sequence A006315 (Numbers n such that n^32 + 1 is prime)". OEIS Foundation. https://oeis.org/A006315. 
  163. ↑ Sloane, N. J. A., ed. "Sequence A185982 (Triangle read by rows: number of set partitions of n elements with k connectors)". OEIS Foundation. https://oeis.org/A185982. 
  164. ↑ 164.0 164.1 164.2 164.3 Sloane, N. J. A., ed. "Sequence A007534 (Even numbers that are not the sum of a pair of twin primes)". OEIS Foundation. https://oeis.org/A007534. 
  165. ↑ 165.0 165.1 165.2 165.3 165.4 Sloane, N. J. A., ed. "Sequence A050993 (5-Knödel numbers)". OEIS Foundation. https://oeis.org/A050993. 
  166. ↑ Sloane, N. J. A., ed. "Sequence A006094 (Products of 2 successive primes)". OEIS Foundation. https://oeis.org/A006094. 
  167. ↑ Sloane, N. J. A., ed. "Sequence A046368 (Products of two palindromic primes)". OEIS Foundation. https://oeis.org/A046368. 
  168. ↑ "1150 (number)". https://number.academy/1150. 
  169. ↑ 169.0 169.1 "Sloane's A000101 : Increasing gaps between primes (upper end)". OEIS Foundation. https://oeis.org/A000101. 
  170. ↑ 170.0 170.1 "Sloane's A097942 : Highly totient numbers". OEIS Foundation. https://oeis.org/A097942. 
  171. ↑ 171.0 171.1 171.2 171.3 "Sloane's A080076 : Proth primes". OEIS Foundation. https://oeis.org/A080076. 
  172. ↑ 172.0 172.1 172.2 172.3 172.4 172.5 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))". OEIS Foundation. https://oeis.org/A005893. 
  173. ↑ 173.0 173.1 173.2 173.3 173.4 173.5 173.6 173.7 173.8 173.9 Sloane, N. J. A., ed. "Sequence n*(n+2)". OEIS Foundation. https://oeis.org/n*(n+2). 
  174. ↑ 174.0 174.1 174.2 "Sloane's A005900 : Octahedral numbers". OEIS Foundation. https://oeis.org/A005900. 
  175. ↑ "Sloane's A069125 : a(n) = (11*n^2 - 11*n + 2)/2". OEIS Foundation. https://oeis.org/A069125. 
  176. ↑ "1157 (number)". https://number.academy/1157. 
  177. ↑ 177.0 177.1 177.2 177.3 177.4 Sloane, N. J. A., ed. "Sequence A005899 (Number of points on surface of octahedron)". OEIS Foundation. https://oeis.org/A005899. 
  178. ↑ 178.0 178.1 Sloane, N. J. A., ed. "Sequence A001845 (Centered octahedral numbers (crystal ball sequence for cubic lattice))". OEIS Foundation. https://oeis.org/A001845. Retrieved 2022-06-02. 
  179. ↑ 179.0 179.1 179.2 179.3 179.4 Sloane, N. J. A., ed. "Sequence A000567 (Octagonal numbers: n*(3*n-2). Also called star numbers)". OEIS Foundation. https://oeis.org/A000567. 
  180. ↑ 180.0 180.1 180.2 180.3 Sloane, N. J. A., ed. "Sequence A007491 (Smallest prime > n^2)". OEIS Foundation. https://oeis.org/A007491. 
  181. ↑ Sloane, N. J. A., ed. "Sequence A055887 (Number of ordered partitions of partitions)". OEIS Foundation. https://oeis.org/A055887. 
  182. ↑ 182.0 182.1 182.2 Sloane, N. J. A., ed. "Sequence A002413 (Heptagonal (or 7-gonal) pyramidal numbers)". OEIS Foundation. https://oeis.org/A002413. 
  183. ↑ 183.0 183.1 183.2 183.3 Sloane, N. J. A., ed. "Sequence A018805". OEIS Foundation. https://oeis.org/A018805. 
  184. ↑ Sloane, N. J. A., ed. "Sequence A024816 (Antisigma(n): Sum of the numbers less than n that do not divide n)". OEIS Foundation. https://oeis.org/A024816. 
  185. ↑ "A063776 - OEIS". https://oeis.org/A063776. 
  186. ↑ "A000256 - OEIS". https://oeis.org/A000256. 
  187. ↑ "1179 (number)". https://number.academy/1179. 
  188. ↑ "A000339 - OEIS". https://oeis.org/A000339. 
  189. ↑ "A271269 - OEIS". https://oeis.org/A271269. 
  190. ↑ "A000031 - OEIS". https://oeis.org/A000031. 
  191. ↑ Higgins, Peter (2008). Number Story: From Counting to Cryptography. New York: Copernicus. p. 61. ISBN 978-1-84800-000-1. https://archive.org/details/numberstoryfromc00higg_612. 
  192. ↑ 192.0 192.1 192.2 192.3 192.4 Sloane, N. J. A., ed. "Sequence A051424 (Number of partitions of n into pairwise relatively prime parts)". OEIS Foundation. https://oeis.org/A051424. 
  193. ↑ 193.0 193.1 "Sloane's A042978 : Stern primes". OEIS Foundation. https://oeis.org/A042978. 
  194. ↑ "A121038 - OEIS". https://oeis.org/A121038. 
  195. ↑ 195.0 195.1 Sloane, N. J. A., ed. "Sequence A005449 (Second pentagonal numbers: n*(3*n + 1)/2)". OEIS Foundation. https://oeis.org/A005449. 
  196. ↑ 196.0 196.1 196.2 196.3 196.4 196.5 Sloane, N. J. A., ed. "Sequence A002061 (Central polygonal numbers: n^2 - n + 1)". OEIS Foundation. https://oeis.org/A002061. 
  197. ↑ "A175654 - OEIS". https://oeis.org/A175654. 
  198. ↑ oeis.org/A062092
  199. ↑ 199.0 199.1 199.2 199.3 199.4 199.5 Sloane, N. J. A., ed. "Sequence A024916 (Sum_1^n sigma(k))". OEIS Foundation. https://oeis.org/A024916. 
  200. ↑ 200.0 200.1 200.2 200.3 200.4 >Sloane, N. J. A., ed. "Sequence A080663 (3*n^2 - 1)". OEIS Foundation. https://oeis.org/A080663. 
  201. ↑ Meehan, Eileen R., Why TV is not our fault: television programming, viewers, and who's really in control Lanham, MD: Rowman & Littlefield, 2005
  202. ↑ "A265070 - OEIS". https://oeis.org/A265070. 
  203. ↑ "1204 (number)". https://number.academy/1204. 
  204. ↑ 204.0 204.1 Sloane, N. J. A., ed. "Sequence A240574 (Number of partitions of n such that the number of odd parts is a part)". OEIS Foundation. https://oeis.org/A240574. 
  205. ↑ "A303815 - OEIS". https://oeis.org/A303815. 
  206. ↑ 206.0 206.1 206.2 206.3 206.4 206.5 206.6 206.7 Sloane, N. J. A., ed. "Sequence A098237 (Composite de Polignac numbers)". OEIS Foundation. https://oeis.org/A098237. 
  207. ↑ Sloane, N. J. A., ed. "Sequence A337070 (Number of strict chains of divisors starting with the superprimorial A006939(n))". OEIS Foundation. https://oeis.org/A337070. 
  208. ↑ Higgins, ibid.
  209. ↑ Sloane, N. J. A., ed. "Sequence A000070 (Sum_{0..n} A000041(k))". OEIS Foundation. https://oeis.org/A000070. 
  210. ↑ 210.0 210.1 210.2 210.3 210.4 210.5 210.6 210.7 210.8 Sloane, N. J. A., ed. "Sequence A053767 (Sum of first n composite numbers)". OEIS Foundation. https://oeis.org/A053767. 
  211. ↑ 211.0 211.1 211.2 211.3 211.4 211.5 "Sloane's A001106 : 9-gonal (or enneagonal or nonagonal) numbers". OEIS Foundation. https://oeis.org/A001106. 
  212. ↑ 212.0 212.1 Sloane, N. J. A., ed. "Sequence A006355 (Number of binary vectors of length n containing no singletons)". OEIS Foundation. https://oeis.org/A006355. 
  213. ↑ "Sloane's A001110 : Square triangular numbers". OEIS Foundation. https://oeis.org/A001110. 
  214. ↑ 214.0 214.1 214.2 214.3 214.4 "Sloane's A016754 : Odd squares: a(n) = (2n+1)^2. Also centered octagonal numbers". OEIS Foundation. https://oeis.org/A016754. 
  215. ↑ Sloane, N. J. A., ed. "Sequence A303815 (Generalized 29-gonal (or icosienneagonal) numbers)". OEIS Foundation. https://oeis.org/A303815. 
  216. ↑ Sloane, N. J. A., ed. "Sequence A249911 (60-gonal (hexacontagonal) numbers)". OEIS Foundation. https://oeis.org/A249911. 
  217. ↑ "A004111 - OEIS". https://oeis.org/A004111. 
  218. ↑ "A061262 - OEIS". https://oeis.org/A061262. 
  219. ↑ 219.0 219.1 219.2 Sloane, N. J. A., ed. "Sequence A008302 (Triangle of Mahonian numbers T(n,k): coefficients in expansion of Product{0..n-1} (1 + x + ... + x^i), where k ranges from 0 to A000217(n-1). Also enumerates permutations by their major index)". OEIS Foundation. https://oeis.org/A008302. 
  220. ↑ "A006154 - OEIS". https://oeis.org/A006154. 
  221. ↑ "A000045 - OEIS". https://oeis.org/A000045. 
  222. ↑ 222.0 222.1 222.2 222.3 222.4 222.5 222.6 Sloane, N. J. A., ed. "Sequence A054735 (Sums of twin prime pairs)". OEIS Foundation. https://oeis.org/A054735. 
  223. ↑ "A160160 - OEIS". https://oeis.org/A160160. 
  224. ↑ "Sloane's A005898 : Centered cube numbers". OEIS Foundation. https://oeis.org/A005898. 
  225. ↑ Sloane, N. J. A., ed. "Sequence A126796 (Number of complete partitions of n)". OEIS Foundation. https://oeis.org/A126796. 
  226. ↑ oeis.org/A305843
  227. ↑ "A007690 - OEIS". https://oeis.org/A007690. 
  228. ↑ "Sloane's A033819 : Trimorphic numbers". OEIS Foundation. https://oeis.org/A033819. 
  229. ↑ 229.0 229.1 229.2 229.3 Sloane, N. J. A., ed. "Sequence A058331 (2*n^2 + 1)". OEIS Foundation. https://oeis.org/A058331. 
  230. ↑ 230.0 230.1 230.2 Sloane, N. J. A., ed. "Sequence A144300 (Number of partitions of n minus number of divisors of n)". OEIS Foundation. https://oeis.org/A144300. 
  231. ↑ Sloane, N. J. A., ed. "Sequence A000837 (Number of partitions of n into relatively prime parts. Also aperiodic partitions.)". OEIS Foundation. https://oeis.org/A000837. 
  232. ↑ 232.0 232.1 232.2 Sloane, N. J. A., ed. "Sequence A000041 (a(n) is the number of partitions of n (the partition numbers))". OEIS Foundation. https://oeis.org/A000041. 
  233. ↑ 233.0 233.1 Sloane, N. J. A., ed. "Sequence A193757 (Numbers which can be written with their digits in order and using only a plus and a squaring operator)". OEIS Foundation. https://oeis.org/A193757. 
  234. ↑ 234.0 234.1 "Sloane's A002182 : Highly composite numbers". OEIS Foundation. https://oeis.org/A002182. 
  235. ↑ 235.0 235.1 235.2 235.3 235.4 "Sloane's A014575 : Vampire numbers". OEIS Foundation. https://oeis.org/A014575. 
  236. ↑ 236.0 236.1 236.2 236.3 236.4 236.5 236.6 236.7 236.8 236.9 Sloane, N. J. A., ed. "Sequence A014206 (n^2 + n + 2)". OEIS Foundation. https://oeis.org/A014206. 
  237. ↑ 237.0 237.1 Sloane, N. J. A., ed. "Sequence A070169 (Rounded total surface area of a regular tetrahedron with edge length n)". OEIS Foundation. https://oeis.org/A070169. 
  238. ↑ 238.0 238.1 238.2 Sloane, N. J. A., ed. "Sequence A003238 (Number of rooted trees with n vertices in which vertices at the same level have the same degree)". OEIS Foundation. https://oeis.org/A003238. 
  239. ↑ 239.0 239.1 239.2 Sloane, N. J. A., ed. "Sequence A023894 (Number of partitions of n into prime power parts)". OEIS Foundation. https://oeis.org/A023894. 
  240. ↑ 240.0 240.1 240.2 Sloane, N. J. A., ed. "Sequence A072895 (Least k for the Theodorus spiral to complete n revolutions)". OEIS Foundation. https://oeis.org/A072895. 
  241. ↑ Sloane, N. J. A., ed. "Sequence A100040 (2*n^2 + n - 5)". OEIS Foundation. https://oeis.org/A100040. 
  242. ↑ 242.0 242.1 Sloane, N. J. A., ed. "Sequence A051349 (Sum of first n nonprimes)". OEIS Foundation. https://oeis.org/A051349. 
  243. ↑ 243.0 243.1 Sloane, N. J. A., ed. "Sequence A033286 (n * prime(n))". OEIS Foundation. https://oeis.org/A033286. 
  244. ↑ 244.0 244.1 Sloane, N. J. A., ed. "Sequence A084849 (1 + n + 2*n^2)". OEIS Foundation. https://oeis.org/A084849. 
  245. ↑ 245.0 245.1 Sloane, N. J. A., ed. "Sequence A000930 (Narayana's cows sequence)". OEIS Foundation. https://oeis.org/A000930. 
  246. ↑ Sloane, N. J. A., ed. "Sequence A001792 ((n+2)*2^(n-1))". OEIS Foundation. https://oeis.org/A001792. 
  247. ↑ Sloane, N. J. A., ed. "Sequence A006958 (Number of parallelogram polyominoes with n cells (also called staircase polyominoes, although that term is overused))". OEIS Foundation. https://oeis.org/A006958. 
  248. ↑ Sloane, N. J. A., ed. "Sequence A216492 (Number of inequivalent connected planar figures that can be formed from n 1 X 2 rectangles (or dominoes) such that each pair of touching rectangles shares exactly one edge, of length 1, and the adjacency graph of the rectangles is a tree)". OEIS Foundation. https://oeis.org/A216492. 
  249. ↑ Sloane, N. J. A., ed. "Sequence A007318 (Pascal's triangle read by rows)". OEIS Foundation. https://oeis.org/A007318. 
  250. ↑ Sloane, N. J. A., ed. "Sequence A014574 (Average of twin prime pairs)". OEIS Foundation. https://oeis.org/A014574. 
  251. ↑ Sloane, N. J. A., ed. "Sequence A173831 (Largest prime < n^4)". OEIS Foundation. https://oeis.org/A173831. 
  252. ↑ Sloane, N. J. A., ed. "Sequence A006872 (Numbers k such that phi(k) equals phi(sigma(k)))". OEIS Foundation. https://oeis.org/A006872. 
  253. ↑ Sloane, N. J. A., ed. "Sequence A014285 (Sum_{1..n} j*prime(j))". OEIS Foundation. https://oeis.org/A014285. 
  254. ↑ 254.0 254.1 Sloane, N. J. A., ed. "Sequence A071400 (Rounded volume of a regular octahedron with edge length n)". OEIS Foundation. https://oeis.org/A071400. 
  255. ↑ 255.0 255.1 255.2 255.3 Sloane, N. J. A., ed. "Sequence A003114 (Number of partitions of n into parts 5k+1 or 5k+4)". OEIS Foundation. https://oeis.org/A003114. 
  256. ↑ 256.0 256.1 256.2 256.3 256.4 256.5 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)". OEIS Foundation. https://oeis.org/A033548. 
  257. ↑ Sloane, N. J. A., ed. "Sequence A000055 (Number of trees with n unlabeled nodes)". OEIS Foundation. https://oeis.org/A000055. 
  258. ↑ "A124826 - OEIS". https://oeis.org/A124826. 
  259. ↑ "A142005 - OEIS". https://oeis.org/A142005. 
  260. ↑ 260.0 260.1 Sloane, N. J. A., ed. "Sequence A338470 (Number of integer partitions of n with no part dividing all the others)". OEIS Foundation. https://oeis.org/A338470. 
  261. ↑ "A066186 - OEIS". https://oeis.org/A066186. 
  262. ↑ 262.0 262.1 262.2 262.3 Sloane, N. J. A., ed. "Sequence A304716 (Number of integer partitions of n whose distinct parts are connected)". OEIS Foundation. https://oeis.org/A304716. 
  263. ↑ "A115073 - OEIS". https://oeis.org/A115073. 
  264. ↑ "A061256 - OEIS". https://oeis.org/A061256. 
  265. ↑ "A061954 - OEIS". https://oeis.org/A061954. 
  266. ↑ Sloane, N. J. A., ed. "Sequence A057465 (Numbers k such that k^512 + 1 is prime)". OEIS Foundation. https://oeis.org/A057465. 
  267. ↑ "A030299 - OEIS". https://oeis.org/A030299. 
  268. ↑ 268.0 268.1 "Sloane's A002559 : Markoff (or Markov) numbers". OEIS Foundation. https://oeis.org/A002559. 
  269. ↑ 269.0 269.1 Sloane, N. J. A., ed. "Sequence A005894 (Centered tetrahedral numbers)". OEIS Foundation. https://oeis.org/A005894. 
  270. ↑ Sloane, N. J. A., ed. "Sequence A018806 (Sum of gcd(x, y))". OEIS Foundation. https://oeis.org/A018806. 
  271. ↑ Sloane, N. J. A., ed. "Sequence A018227 (Magic numbers: atoms with full shells containing any of these numbers of electrons are considered electronically stable)". OEIS Foundation. https://oeis.org/A018227. 
  272. ↑ "A005064 - OEIS". https://oeis.org/A005064. 
  273. ↑ 273.0 273.1 273.2 273.3 273.4 273.5 Sloane, N. J. A., ed. "Sequence A001770 (Numbers k such that 5*2^k - 1 is prime)". OEIS Foundation. https://oeis.org/A001770. 
  274. ↑ 274.0 274.1 274.2 274.3 274.4 Sloane, N. J. A., ed. "Sequence A144391 (3*n^2 + n - 1)". OEIS Foundation. https://oeis.org/A144391. 
  275. ↑ 275.0 275.1 275.2 275.3 275.4 275.5 275.6 Sloane, N. J. A., ed. "Sequence A090781 (Numbers that can be expressed as the difference of the squares of primes in just one distinct way)". OEIS Foundation. https://oeis.org/A090781. 
  276. ↑ 276.0 276.1 Sloane, N. J. A., ed. "Sequence A056809 (Numbers k such that k, k+1 and k+2 are products of two primes)". OEIS Foundation. https://oeis.org/A056809. 
  277. ↑ "A316473 - OEIS". https://oeis.org/A316473. 
  278. ↑ "A000032 - OEIS". https://oeis.org/A000032. 
  279. ↑ "1348 (number)". https://number.academy/1348. 
  280. ↑ 280.0 280.1 Sloane, N. J. A., ed. "Sequence A101624 (Stern-Jacobsthal number)". OEIS Foundation. https://oeis.org/A101624. 
  281. ↑ Sloane, N. J. A., ed. "Sequence A064228 (From Recamán's sequence (A005132): values of n achieving records in A057167)". OEIS Foundation. https://oeis.org/A064228. 
  282. ↑ Sloane, N. J. A., ed. "Sequence A057167 (Term in Recamán's sequence A005132 where n appears for first time, or -1 if n never appears)". OEIS Foundation. https://oeis.org/A057167. 
  283. ↑ Sloane, N. J. A., ed. "Sequence A064227 (From Recamán's sequence (A005132): record values in A057167)". OEIS Foundation. https://oeis.org/A064227. 
  284. ↑ 284.0 284.1 284.2 Sloane, N. J. A., ed. "Sequence A000603". OEIS Foundation. https://oeis.org/A000603. 
  285. ↑ Sloane, N. J. A., ed. "Sequence A000960 (Flavius Josephus's sieve: Start with the natural numbers; at the k-th sieving step, remove every (k+1)-st term of the sequence remaining after the (k-1)-st sieving step; iterate)". OEIS Foundation. https://oeis.org/A000960. 
  286. ↑ 286.0 286.1 286.2 286.3 286.4 Sloane, N. J. A., ed. "Sequence A330224 (Number of achiral integer partitions of n)". OEIS Foundation. https://oeis.org/A330224. 
  287. ↑ Sloane, N. J. A., ed. "Sequence A001610 (a(n-1) + a(n-2) + 1)". OEIS Foundation. https://oeis.org/A001610. 
  288. ↑ Sloane, N. J. A., ed. "Sequence A000032 (Lucas numbers: L(n-1) + L(n-2))". OEIS Foundation. https://oeis.org/A000032. 
  289. ↑ 289.0 289.1 "Sloane's A000332 : Binomial coefficient binomial(n,4) = n*(n-1)*(n-2)*(n-3)/24". OEIS Foundation. https://oeis.org/A000332. 
  290. ↑ Sloane, N. J. A., ed. "Sequence A005578 (Arima sequence)". OEIS Foundation. https://oeis.org/A005578. 
  291. ↑ 291.0 291.1 291.2 Sloane, N. J. A., ed. "Sequence A001157 (sigma_2(n): sum of squares of divisors of n)". OEIS Foundation. https://oeis.org/A001157. 
  292. ↑ 292.0 292.1 Sloane, N. J. A., ed. "Sequence A007585 (10-gonal (or decagonal) pyramidal numbers)". OEIS Foundation. https://oeis.org/A007585. 
  293. ↑ 293.0 293.1 293.2 Sloane, N. J. A., ed. "Sequence A071395 (Primitive abundant numbers (abundant numbers all of whose proper divisors are deficient numbers))". OEIS Foundation. https://oeis.org/A071395. 
  294. ↑ 294.0 294.1 Sloane, N. J. A., ed. "Sequence A005945 (Number of n-step mappings with 4 inputs)". OEIS Foundation. https://oeis.org/A005945. 
  295. ↑ "A001631 - OEIS". https://oeis.org/A001631. Retrieved 25 June 2023. 
  296. ↑ Sloane, N. J. A., ed. "Sequence A088274 (Numbers k such that 10^k + 7 is prime)". OEIS Foundation. https://oeis.org/A088274. 
  297. ↑ Sloane, N. J. A., ed. "Sequence A000111 (Euler or up/down numbers: e.g.f. sec(x) + tan(x))". OEIS Foundation. https://oeis.org/A000111. 
  298. ↑ Sloane, N. J. A., ed. "Sequence A002414 (Octagonal pyramidal numbers)". OEIS Foundation. https://oeis.org/A002414. 
  299. ↑ "Sloane's A001567 : Fermat pseudoprimes to base 2". OEIS Foundation. https://oeis.org/A001567. 
  300. ↑ "Sloane's A050217 : Super-Poulet numbers". OEIS Foundation. https://oeis.org/A050217. 
  301. ↑ Sloane, N. J. A., ed. "Sequence A054552 (4*n^2 - 3*n + 1)". OEIS Foundation. https://oeis.org/A054552. 
  302. ↑ Sloane, N. J. A., ed. "Sequence A017919 (Powers of sqrt(5) rounded down)". OEIS Foundation. https://oeis.org/A017919. 
  303. ↑ Sloane, N. J. A., ed. "Sequence A109308 (Lesser emirps (primes whose digit reversal is a larger prime))". OEIS Foundation. https://oeis.org/A109308. 
  304. ↑ 304.0 304.1 Sloane, N. J. A., ed. "Sequence A007865 (Number of sum-free subsets of {1, ..., n)". OEIS Foundation. https://oeis.org/A007865. }
  305. ↑ 305.0 305.1 Sloane, N. J. A., ed. "Sequence A325349 (Number of integer partitions of n whose augmented differences are distinct)". OEIS Foundation. https://oeis.org/A325349. 
  306. ↑ 306.0 306.1 Sloane, N. J. A., ed. "Sequence A051400 (Smallest value of x such that M(x) equals n, where M() is Mertens's function A002321)". OEIS Foundation. https://oeis.org/A051400. 
  307. ↑ "Sloane's A000682 : Semimeanders". OEIS Foundation. https://oeis.org/A000682. 
  308. ↑ Sloane, N. J. A., ed. "Sequence A002445 (Denominators of Bernoulli numbers B_{2n)". OEIS Foundation. https://oeis.org/A002445. }
  309. ↑ 309.0 309.1 309.2 309.3 Sloane, N. J. A., ed. "Sequence A045918 (Describe n. Also called the "Say What You See" or "Look and Say" sequence LS(n))". OEIS Foundation. https://oeis.org/A045918. 
  310. ↑ 310.0 310.1 Sloane, N. J. A., ed. "Sequence A050710 (Smallest composite that when added to sum of prime factors reaches a prime after n iterations)". OEIS Foundation. https://oeis.org/A050710. 
  311. ↑ 311.0 311.1 Sloane, N. J. A., ed. "Sequence A067538 (Number of partitions of n in which the number of parts divides n)". OEIS Foundation. https://oeis.org/A067538. 
  312. ↑ 312.0 312.1 "Sloane's A051015 : Zeisel numbers". OEIS Foundation. https://oeis.org/A051015. 
  313. ↑ 313.0 313.1 313.2 Sloane, N. J. A., ed. "Sequence A059845 (n*(3*n + 11)/2)". OEIS Foundation. https://oeis.org/A059845. 
  314. ↑ Sloane, N. J. A., ed. "Sequence A000097 (Number of partitions of n if there are two kinds of 1's and two kinds of 2's)". OEIS Foundation. https://oeis.org/A000097. 
  315. ↑ 315.0 315.1 Sloane, N. J. A., ed. "Sequence A061068 (Primes which are the sum of a prime and its subscript)". OEIS Foundation. https://oeis.org/A061068. 
  316. ↑ Sloane, N. J. A., ed. "Sequence A001359 (Lesser of twin primes)". OEIS Foundation. https://oeis.org/A001359. 
  317. ↑ Sloane, N. J. A., ed. "Sequence A001764 (binomial(3*n,n)/(2*n+1) (enumerates ternary trees and also noncrossing trees))". OEIS Foundation. https://oeis.org/A001764. 
  318. ↑ "Sloane's A000108 : Catalan numbers". OEIS Foundation. https://oeis.org/A000108. 
  319. ↑ 319.0 319.1 Sloane, N. J. A., ed. "Sequence A071399 (Rounded volume of a regular tetrahedron with edge length n)". OEIS Foundation. https://oeis.org/A071399. 
  320. ↑ 320.0 320.1 320.2 Sloane, N. J. A., ed. "Sequence A006832 (Discriminants of totally real cubic fields)". OEIS Foundation. https://oeis.org/A006832. 
  321. ↑ 321.0 321.1 Sloane, N. J. A., ed. "Sequence A003037 (Smallest number of complexity n: smallest number requiring n 1's to build using +, * and ^)". OEIS Foundation. https://oeis.org/A003037. 
  322. ↑ Sloane, N. J. A., ed. "Sequence A005259 (Apery (Apéry) numbers: Sum_0^n (binomial(n,k)*binomial(n+k,k))^2)". OEIS Foundation. https://oeis.org/A005259. 
  323. ↑ 323.0 323.1 Sloane, N. J. A., ed. "Sequence A062325 (Numbers k for which phi(prime(k)) is a square)". OEIS Foundation. https://oeis.org/A062325. 
  324. ↑ 324.0 324.1 Sloane, N. J. A., ed. "Sequence A011379 (n^2*(n+1))". OEIS Foundation. https://oeis.org/A011379. 
  325. ↑ 325.0 325.1 Sloane, N. J. A., ed. "Sequence A005918 (Number of points on surface of square pyramid: 3*n^2 + 2 (n>0))". OEIS Foundation. https://oeis.org/A005918. 
  326. ↑ 326.0 326.1 326.2 326.3 326.4 326.5 326.6 Sloane, N. J. A., ed. "Sequence A011257 (Geometric mean of phi(n) and sigma(n) is an integer)". OEIS Foundation. https://oeis.org/A011257. 
  327. ↑ Sloane, N. J. A., ed. "Sequence A007678 (Number of regions in regular n-gon with all diagonals drawn)". OEIS Foundation. https://oeis.org/A007678. 
  328. ↑ 328.0 328.1 Sloane, N. J. A., ed. "Sequence A056220 (2*n^2 - 1)". OEIS Foundation. https://oeis.org/A056220. 
  329. ↑ Sloane, N. J. A., ed. "Sequence A028569 (n*(n + 9))". OEIS Foundation. https://oeis.org/A028569. 
  330. ↑ Sloane, N. J. A., ed. "Sequence A071398 (Rounded total surface area of a regular icosahedron with edge length n)". OEIS Foundation. https://oeis.org/A071398. 
  331. ↑ Sloane, N. J. A., ed. "Sequence A085831 (Sum_1^{2^n} d(k) where d(k) is the number of divisors of k (A000005))". OEIS Foundation. https://oeis.org/A085831. 
  332. ↑ Sloane, N. J. A., ed. "Sequence A064410 (Number of partitions of n with zero crank)". OEIS Foundation. https://oeis.org/A064410. 
  333. ↑ Sloane, N. J. A., ed. "Sequence A075207 (Number of polyhexes with n cells that tile the plane by translation)". OEIS Foundation. https://oeis.org/A075207. 
  334. ↑ 334.0 334.1 "Sloane's A002411 : Pentagonal pyramidal numbers". OEIS Foundation. https://oeis.org/A002411. 
  335. ↑ Sloane, N. J. A., ed. "Sequence A015128 (Number of overpartitions of n: an overpartition of n is an ordered sequence of nonincreasing integers that sum to n, where the first occurrence of each integer may be overlined)". OEIS Foundation. https://oeis.org/A015128. 
  336. ↑ Sloane, N. J. A., ed. "Sequence A006578 (Triangular numbers plus quarter squares: n*(n+1)/2 + floor(n^2/4) (i.e., A000217(n) + A002620(n)))". OEIS Foundation. https://oeis.org/A006578. 
  337. ↑ 337.0 337.1 Sloane, N. J. A., ed. "Sequence A098859 (Number of partitions of n into parts each of which is used a different number of times)". OEIS Foundation. https://oeis.org/A098859. 
  338. ↑ 338.0 338.1 338.2 338.3 Sloane, N. J. A., ed. "Sequence A307958 (Coreful perfect numbers)". OEIS Foundation. https://oeis.org/A307958. 
  339. ↑ Sloane, N. J. A., ed. "Sequence A097979 (Total number of largest parts in all compositions of n)". OEIS Foundation. https://oeis.org/A097979. 
  340. ↑ Sloane, N. J. A., ed. "Sequence A000219 (Number of planar partitions (or plane partitions) of n)". OEIS Foundation. https://oeis.org/A000219. 
  341. ↑ Sloane, N. J. A., ed. "Sequence A006330 (Number of corners, or planar partitions of n with only one row and one column)". OEIS Foundation. https://oeis.org/A006330. 
  342. ↑ "Sloane's A000078 : Tetranacci numbers". OEIS Foundation. https://oeis.org/A000078. 
  343. ↑ Sloane, N. J. A., ed. "Sequence A114411 (Triple primorial n###)". OEIS Foundation. https://oeis.org/A114411. 
  344. ↑ 344.0 344.1 Sloane, N. J. A., ed. "Sequence A034296 (Number of flat partitions of n)". OEIS Foundation. https://oeis.org/A034296. 
  345. ↑ 345.0 345.1 Sloane, N. J. A., ed. "Sequence A084647 (Hypotenuses for which there exist exactly 3 distinct integer triangles)". OEIS Foundation. https://oeis.org/A084647. 
  346. ↑ 346.0 346.1 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)". OEIS Foundation. https://oeis.org/A002071. 
  347. ↑ Sloane, N. J. A., ed. "Sequence A325325 (Number of integer partitions of n with distinct differences between successive parts)". OEIS Foundation. https://oeis.org/A325325. 
  348. ↑ Sloane, N. J. A., ed. "Sequence A325858 (Number of Golomb partitions of n)". OEIS Foundation. https://oeis.org/A325858. 
  349. ↑ Sloane, N. J. A., ed. "Sequence A018000 (Powers of cube root of 9 rounded down)". OEIS Foundation. https://oeis.org/A018000. 
  350. ↑ Sloane, N. J. A., ed. "Sequence A062198 (Sum of first n semiprimes)". OEIS Foundation. https://oeis.org/A062198. 
  351. ↑ Sloane, N. J. A., ed. "Sequence A038147 (Number of polyhexes with n cells)". OEIS Foundation. https://oeis.org/A038147. 
  352. ↑ 352.0 352.1 Sloane, N. J. A., ed. "Sequence A000702 (number of conjugacy classes in the alternating group A_n)". OEIS Foundation. https://oeis.org/A000702. 
  353. ↑ Sloane, N. J. A., ed. "Sequence A001970 (Functional determinants; partitions of partitions; Euler transform applied twice to all 1's sequence)". OEIS Foundation. https://oeis.org/A001970. 
  354. ↑ Sloane, N. J. A., ed. "Sequence A071396 (Rounded total surface area of a regular octahedron with edge length n)". OEIS Foundation. https://oeis.org/A071396. 
  355. ↑ Sloane, N. J. A., ed. "Sequence A000084 (Number of series-parallel networks with n unlabeled edges. Also called yoke-chains by Cayley and MacMahon)". OEIS Foundation. https://oeis.org/A000084. 
  356. ↑ Sloane, N. J. A., ed. "Sequence A000615 (Threshold functions of exactly n variables)". OEIS Foundation. https://oeis.org/A000615. 
  357. ↑ Sloane, N. J. A., ed. "Sequence A100129 (Numbers k such that 2^k starts with k)". OEIS Foundation. https://oeis.org/A100129. 
  358. ↑ Sloane, N. J. A., ed. "Sequence A000057 (Primes dividing all Fibonacci sequences)". OEIS Foundation. https://oeis.org/A000057. 
  359. ↑ Sloane, N. J. A., ed. "Sequence A319066 (Number of partitions of integer partitions of n where all parts have the same length)". OEIS Foundation. https://oeis.org/A319066. 
  360. ↑ Sloane, N. J. A., ed. "Sequence A056327 (Number of reversible string structures with n beads using exactly three different colors)". OEIS Foundation. https://oeis.org/A056327. 
  361. ↑ Sloane, N. J. A., ed. "Sequence A002720 (Number of partial permutations of an n-set; number of n X n binary matrices with at most one 1 in each row and column)". OEIS Foundation. https://oeis.org/A002720. 
  362. ↑ 362.0 362.1 362.2 362.3 Sloane, N. J. A., ed. "Sequence A065381 (Primes not of the form p + 2^k)". OEIS Foundation. https://oeis.org/A065381. 
  363. ↑ Sloane, N. J. A., ed. "Sequence A140090 (n*(3*n + 7)/2)". OEIS Foundation. https://oeis.org/A140090. 
  364. ↑ Sloane, N. J. A., ed. "Sequence A169942 (Number of Golomb rulers of length n)". OEIS Foundation. https://oeis.org/A169942. 
  365. ↑ Sloane, N. J. A., ed. "Sequence A169952 (Second entry in row n of triangle in A169950)". OEIS Foundation. https://oeis.org/A169952. 
  366. ↑ Sloane, N. J. A., ed. "Sequence A034962 (Primes that are the sum of three consecutive primes)". OEIS Foundation. https://oeis.org/A034962. 
  367. ↑ Sloane, N. J. A., ed. "Sequence A046386 (Products of four distinct primes)". OEIS Foundation. https://oeis.org/A046386. 
  368. ↑ Sloane, N. J. A., ed. "Sequence A127106 (Numbers n such that n^2 divides 6^n-1)". OEIS Foundation. https://oeis.org/A127106. 
  369. ↑ 369.0 369.1 Sloane, N. J. A., ed. "Sequence A008406 (Triangle T(n,k) read by rows, giving number of graphs with n nodes and k edges))". OEIS Foundation. https://oeis.org/A008406. 
  370. ↑ Sloane, N. J. A., ed. "Sequence A000014 (Number of series-reduced trees with n nodes)". OEIS Foundation. https://oeis.org/A000014. 
  371. ↑ Sloane, N. J. A., ed. "Sequence A057660 (Sum_{1..n} n/gcd(n,k))". OEIS Foundation. https://oeis.org/A057660. 
  372. ↑ Sloane, N. J. A., ed. "Sequence A088319 (Ordered hypotenuses of primitive Pythagorean triangles having legs that add up to a square)". OEIS Foundation. https://oeis.org/A088319. 
  373. ↑ 373.0 373.1 Sloane, N. J. A., ed. "Sequence A052486 (Achilles numbers)". OEIS Foundation. https://oeis.org/A052486. 
  374. ↑ Sloane, N. J. A., ed. "Sequence A056995 (Numbers k such that k^256 + 1 is prime)". OEIS Foundation. https://oeis.org/A056995. 
  375. ↑ "Sloane's A005231 : Odd abundant numbers". OEIS Foundation. https://oeis.org/A005231. 
  376. ↑ Sloane, N. J. A., ed. "Sequence A056026 (Numbers k such that k^14 is congruent with 1 (mod 15^2))". OEIS Foundation. https://oeis.org/A056026. 
  377. ↑ Sloane, N. J. A., ed. "Sequence A076409 (Sum of the quadratic residues of prime(n))". OEIS Foundation. https://oeis.org/A076409. 
  378. ↑ Sloane, N. J. A., ed. "Sequence A070142 (Numbers n such that [A070080(n), A070081(n), A070082(n) is an integer triangle with integer area)"]. OEIS Foundation. https://oeis.org/A070142. 
  379. ↑ Sloane, N. J. A., ed. "Sequence A033428 (3*n^2)". OEIS Foundation. https://oeis.org/A033428. 
  380. ↑ Sloane, N. J. A., ed. "Sequence A071402 (Rounded volume of a regular icosahedron with edge length n)". OEIS Foundation. https://oeis.org/A071402. 
  381. ↑ Sloane, N. J. A., ed. "Sequence A326123 (a(n) is the sum of all divisors of the first n odd numbers)". OEIS Foundation. https://oeis.org/A326123. 
  382. ↑ Sloane, N. J. A., ed. "Sequence A006327 (Fibonacci(n) - 3. Number of total preorders)". OEIS Foundation. https://oeis.org/A006327. 
  383. ↑ "Sloane's A000045 : Fibonacci numbers". OEIS Foundation. https://oeis.org/A000045. 
  384. ↑ Sloane, N. J. A., ed. "Sequence A100145 (Structured great rhombicosidodecahedral numbers)". OEIS Foundation. https://oeis.org/A100145. 
  385. ↑ 385.0 385.1 Sloane, N. J. A., ed. "Sequence A064174 (Number of partitions of n with nonnegative rank)". OEIS Foundation. https://oeis.org/A064174. 
  386. ↑ Sloane, N. J. A., ed. "Sequence A023360 (Number of compositions of n into prime parts)". OEIS Foundation. https://oeis.org/A023360. 
  387. ↑ Sloane, N. J. A., ed. "Sequence A103473 (Number of polyominoes consisting of 7 regular unit n-gons)". OEIS Foundation. https://oeis.org/A103473. 
  388. ↑ Sloane, N. J. A., ed. "Sequence A007584 (9-gonal (or enneagonal) pyramidal numbers)". OEIS Foundation. https://oeis.org/A007584. 
  389. ↑ Sloane, N. J. A., ed. "Sequence A022004 (Initial members of prime triples (p, p+2, p+6))". OEIS Foundation. https://oeis.org/A022004. 
  390. ↑ Sloane, N. J. A., ed. "Sequence A006489 (Numbers k such that k-6, k, and k+6 are primes)". OEIS Foundation. https://oeis.org/A006489. 
  391. ↑ Sloane, N. J. A., ed. "Sequence A213427 (Number of ways of refining the partition n^1 to get 1^n)". OEIS Foundation. https://oeis.org/A213427. 
  392. ↑ Sloane, N. J. A., ed. "Sequence A134602 (Composite numbers such that the square mean of their prime factors is a nonprime integer (where the prime factors are taken with multiplicity and the square mean of c and d is sqrt((c^2+d^2)/2)))". OEIS Foundation. https://oeis.org/A134602. 
  393. ↑ Sloane, N. J. A., ed. "Sequence A084990 (n*(n^2+3*n-1)/3)". OEIS Foundation. https://oeis.org/A084990. 
  394. ↑ Sloane, N. J. A., ed. "Sequence A077068 (Semiprimes of the form prime + 1)". OEIS Foundation. https://oeis.org/A077068. 
  395. ↑ Sloane, N. J. A., ed. "Sequence A115160 (Numbers that are not the sum of two triangular numbers and a fourth power)". OEIS Foundation. https://oeis.org/A115160. 
  396. ↑ 396.0 396.1 Sloane, N. J. A., ed. "Sequence A046092 (4 times triangular numbers)". OEIS Foundation. https://oeis.org/A046092. 
  397. ↑ Sloane, N. J. A., ed. "Sequence A005382 (Primes p such that 2p-1 is also prime)". OEIS Foundation. https://oeis.org/A005382. 
  398. ↑ Sloane, N. J. A., ed. "Sequence A001339 (Sum_{0..n} (k+1)! binomial(n,k))". OEIS Foundation. https://oeis.org/A001339. 
  399. ↑ Sloane, N. J. A., ed. "Sequence A007290 (2*binomial(n,3))". OEIS Foundation. https://oeis.org/A007290. 
  400. ↑ Sloane, N. J. A., ed. "Sequence A058360 (Number of partitions of n whose reciprocal sum is an integer)". OEIS Foundation. https://oeis.org/A058360. 
  401. ↑ Sloane, N. J. A., ed. "Sequence A046931 (Prime islands: least prime whose adjacent primes are exactly 2n apart)". OEIS Foundation. https://oeis.org/A046931. 
  402. ↑ "Sloane's A001599 : Harmonic or Ore numbers". OEIS Foundation. https://oeis.org/A001599. 
  403. ↑ Sloane, N. J. A., ed. "Sequence A056613 (Number of n-celled pseudo still lifes in Conway's Game of Life, up to rotation and reflection)". OEIS Foundation. https://oeis.org/A056613. 
  404. ↑ Sloane, N. J. A., ed. "Sequence A068140 (Smaller of two consecutive numbers each divisible by a cube greater than one)". OEIS Foundation. https://oeis.org/A068140. 
  405. ↑ Sloane, N. J. A., ed. "Sequence A030272 (Number of partitions of n^3 into distinct cubes)". OEIS Foundation. https://oeis.org/A030272. 
  406. ↑ Sloane, N. J. A., ed. "Sequence A018818 (Number of partitions of n into divisors of n)". OEIS Foundation. https://oeis.org/A018818. 
  407. ↑ Sloane, N. J. A., ed. "Sequence A071401 (Rounded volume of a regular dodecahedron with edge length n)". OEIS Foundation. https://oeis.org/A071401. 
  408. ↑ 408.0 408.1 408.2 "Sloane's A002407 : Cuban primes". OEIS Foundation. https://oeis.org/A002407. 
  409. ↑ Sloane, N. J. A., ed. "Sequence A059802 (Numbers k such that 5^k - 4^k is prime)". OEIS Foundation. https://oeis.org/A059802. 
  410. ↑ 410.0 410.1 Sloane, N. J. A., ed. "Sequence A082982 (Numbers k such that k, k+1 and k+2 are sums of 2 squares)". OEIS Foundation. https://oeis.org/A082982. 
  411. ↑ Sloane, N. J. A., ed. "Sequence A057562 (Number of partitions of n into parts all relatively prime to n)". OEIS Foundation. https://oeis.org/A057562. 
  412. ↑ Sloane, N. J. A., ed. "Sequence A000230 (smallest prime p such that there is a gap of exactly 2n between p and next prime)". OEIS Foundation. https://oeis.org/A000230. 
  413. ↑ Sloane, N. J. A., ed. "Sequence A261983 (Number of compositions of n such that at least two adjacent parts are equal)". OEIS Foundation. https://oeis.org/A261983. 
  414. ↑ Sloane, N. J. A., ed. "Sequence A053781 (Numbers k that divide the sum of the first k composite numbers)". OEIS Foundation. https://oeis.org/A053781. 
  415. ↑ Sloane, N. J. A., ed. "Sequence A140480 (RMS numbers: numbers n such that root mean square of divisors of n is an integer)". OEIS Foundation. https://oeis.org/A140480. 
  416. ↑ Sloane, N. J. A., ed. "Sequence A023108 (Positive integers which apparently never result in a palindrome under repeated applications of the function A056964(x))". OEIS Foundation. https://oeis.org/A023108. 
  417. ↑ Sloane, N. J. A., ed. "Sequence A286518 (Number of finite connected sets of positive integers greater than one with least common multiple n)". OEIS Foundation. https://oeis.org/A286518. 
  418. ↑ Sloane, N. J. A., ed. "Sequence A004041 (Scaled sums of odd reciprocals: (2*n + 1)!!*(Sum_{0..n} 1/(2*k + 1)))". OEIS Foundation. https://oeis.org/A004041. 
  419. ↑ Sloane, N. J. A., ed. "Sequence A023359 (Number of compositions (ordered partitions) of n into powers of 2)". OEIS Foundation. https://oeis.org/A023359. 
  420. ↑ Sloane, N. J. A., ed. "Sequence A000787 (Strobogrammatic numbers: the same upside down)". OEIS Foundation. https://oeis.org/A000787. 
  421. ↑ Sloane, N. J. A., ed. "Sequence A224930 (Numbers n such that n divides the concatenation of all divisors in descending order)". OEIS Foundation. https://oeis.org/A224930. 
  422. ↑ Sloane, N. J. A., ed. "Sequence A294286 (Sum of the squares of the parts in the partitions of n into two distinct parts)". OEIS Foundation. https://oeis.org/A294286. 
  423. ↑ "Sloane's A000073 : Tribonacci numbers". OEIS Foundation. https://oeis.org/A000073. 
  424. ↑ Sloane, N. J. A., ed. "Sequence A020989 ((5*4^n - 2)/3)". OEIS Foundation. https://oeis.org/A020989. 
  425. ↑ Sloane, N. J. A., ed. "Sequence A331378 (Numbers whose product of prime indices is divisible by their sum of prime factors)". OEIS Foundation. https://oeis.org/A331378. 
  426. ↑ Sloane, N. J. A., ed. "Sequence A301700 (Number of aperiodic rooted trees with n nodes)". OEIS Foundation. https://oeis.org/A301700. 
  427. ↑ Sloane, N. J. A., ed. "Sequence A331452 (number of regions (or cells) formed by drawing the line segments connecting any two of the 2*(m+n) perimeter points of an m X n grid of squares)". OEIS Foundation. https://oeis.org/A331452. 
  428. ↑ Sloane, N. J. A., ed. "Sequence A056045 ("Sum_{d divides n}(binomial(n,d))")". OEIS Foundation. https://oeis.org/A056045. 
  429. ↑ "Sloane's A007850 : Giuga numbers". OEIS Foundation. https://oeis.org/A007850. 
  430. ↑ Sloane, N. J. A., ed. "Sequence A161757 ((prime(n))^2 - (nonprime(n))^2)". OEIS Foundation. https://oeis.org/A161757. 
  431. ↑ Sloane, N. J. A., ed. "Sequence A078374 (Number of partitions of n into distinct and relatively prime parts)". OEIS Foundation. https://oeis.org/A078374. 
  432. ↑ Sloane, N. J. A., ed. "Sequence A167008 (Sum_{0..n} C(n,k)^k)". OEIS Foundation. https://oeis.org/A167008. 
  433. ↑ Sloane, N. J. A., ed. "Sequence A033581 (6*n^2)". OEIS Foundation. https://oeis.org/A033581. 
  434. ↑ Sloane, N. J. A., ed. "Sequence A036469 (Partial sums of A000009 (partitions into distinct parts))". OEIS Foundation. https://oeis.org/A036469. 
  435. ↑ Sloane, N. J. A., ed. "Sequence A350507 (Number of (not necessarily connected) unit-distance graphs on n nodes)". OEIS Foundation. https://oeis.org/A350507. 
  436. ↑ Sloane, N. J. A., ed. "Sequence A102627 (Number of partitions of n into distinct parts in which the number of parts divides n)". OEIS Foundation. https://oeis.org/A102627. 
  437. ↑ Sloane, N. J. A., ed. "Sequence A216955 (number of binary sequences of length n and curling number k)". OEIS Foundation. https://oeis.org/A216955. 
  438. ↑ Sloane, N. J. A., ed. "Sequence A001523 (Number of stacks, or planar partitions of n; also weakly unimodal compositions of n)". OEIS Foundation. https://oeis.org/A001523. 
  439. ↑ Sloane, N. J. A., ed. "Sequence A065764 (Sum of divisors of square numbers)". OEIS Foundation. https://oeis.org/A065764. 
  440. ↑ Sloane, N. J. A., ed. "Sequence A220881 (Number of nonequivalent dissections of an n-gon into n-3 polygons by nonintersecting diagonals up to rotation)". OEIS Foundation. https://oeis.org/A220881. 
  441. ↑ Sloane, N. J. A., ed. "Sequence A154964 (3*a(n-1) + 6*a(n-2))". OEIS Foundation. https://oeis.org/A154964. 
  442. ↑ Sloane, N. J. A., ed. "Sequence A055327 (Triangle of rooted identity trees with n nodes and k leaves)". OEIS Foundation. https://oeis.org/A055327. 
  443. ↑ Sloane, N. J. A., ed. "Sequence A316322 (Sum of piles of first n primes)". OEIS Foundation. https://oeis.org/A316322. 
  444. ↑ Sloane, N. J. A., ed. "Sequence A045944 (Rhombic matchstick numbers: n*(3*n+2))". OEIS Foundation. https://oeis.org/A045944. 
  445. ↑ Sloane, N. J. A., ed. "Sequence A127816 (least k such that the remainder when 6^k is divided by k is n)". OEIS Foundation. https://oeis.org/A127816. 
  446. ↑ Sloane, N. J. A., ed. "Sequence A005317 ((2^n + C(2*n,n))/2)". OEIS Foundation. https://oeis.org/A005317. 
  447. ↑ Sloane, N. J. A., ed. "Sequence A064118 (Numbers k such that the first k digits of e form a prime)". OEIS Foundation. https://oeis.org/A064118. 
  448. ↑ Sloane, N. J. A., ed. "Sequence A325860 (Number of subsets of {1..n} such that every pair of distinct elements has a different quotient)". OEIS Foundation. https://oeis.org/A325860. 
  449. ↑ Sloane, N. J. A., ed. "Sequence A073592 (Euler transform of negative integers)". OEIS Foundation. https://oeis.org/A073592. 
  450. ↑ Sloane, N. J. A., ed. "Sequence A025047 (Alternating compositions, i.e., compositions with alternating increases and decreases, starting with either an increase or a decrease)". OEIS Foundation. https://oeis.org/A025047. 
  451. ↑ Sloane, N. J. A., ed. "Sequence A288253 (Number of heptagons that can be formed with perimeter n)". OEIS Foundation. https://oeis.org/A288253. 
  452. ↑ Sloane, N. J. A., ed. "Sequence A235488 (Squarefree numbers which yield zero when their prime factors are xored together)". OEIS Foundation. https://oeis.org/A235488. 
  453. ↑ Sloane, N. J. A., ed. "Sequence A075213 (Number of polyhexes with n cells that tile the plane isohedrally but not by translation or by 180-degree rotation (Conway criterion))". OEIS Foundation. https://oeis.org/A075213. 
  454. ↑ "Sloane's A054377 : Primary pseudoperfect numbers". OEIS Foundation. https://oeis.org/A054377. 
  455. ↑ Kellner, Bernard C.; 'The equation denom(Bn) = n has only one solution'
  456. ↑ Sloane, N. J. A., ed. "Sequence A006318 (Large Schröder numbers)". OEIS Foundation. https://oeis.org/A006318. Retrieved 2016-05-22. 
  457. ↑ "Sloane's A000058 : Sylvester's sequence". OEIS Foundation. https://oeis.org/A000058. 
  458. ↑ Sloane, N. J. A., ed. "Sequence A083186 (Sum of first n primes whose indices are primes)". OEIS Foundation. https://oeis.org/A083186. 
  459. ↑ Sloane, N. J. A., ed. "Sequence A005260 (Sum_{0..n} binomial(n,k)^4)". OEIS Foundation. https://oeis.org/A005260. 
  460. ↑ Sloane, N. J. A., ed. "Sequence A056877 (Number of polyominoes with n cells, symmetric about two orthogonal axes)". OEIS Foundation. https://oeis.org/A056877. 
  461. ↑ Sloane, N. J. A., ed. "Sequence A061801 ((7*6^n - 2)/5)". OEIS Foundation. https://oeis.org/A061801. 
  462. ↑ Sloane, N. J. A., ed. "Sequence A152927 (Number of sets (in the Hausdorff metric geometry) at each location between two sets defining a polygonal configuration consisting of k 4-gonal polygonal components chained with string components of length 1 as k varies)". OEIS Foundation. https://oeis.org/A152927. 
  463. ↑ Sloane, N. J. A., ed. "Sequence A037032 (Total number of prime parts in all partitions of n)". OEIS Foundation. https://oeis.org/A037032. 
  464. ↑ Sloane, N. J. A., ed. "Sequence A101301 (The sum of the first n primes, minus n)". OEIS Foundation. https://oeis.org/A101301. 
  465. ↑ Sloane, N. J. A., ed. "Sequence A332835 (Number of compositions of n whose run-lengths are either weakly increasing or weakly decreasing)". OEIS Foundation. https://oeis.org/A332835. Retrieved 2022-06-02. 
  466. ↑ Sloane, N. J. A., ed. "Sequence A000230 (smallest prime p such that there is a gap of exactly 2n between p and next prime, or -1 if no such prime exists)". OEIS Foundation. https://oeis.org/A000230. 
  467. ↑ Sloane, N. J. A., ed. "Sequence A004068 (Number of atoms in a decahedron with n shells)". OEIS Foundation. https://oeis.org/A004068. 
  468. ↑ Sloane, N. J. A., ed. "Sequence A001905 (From higher-order Bernoulli numbers: absolute value of numerator of D-number D2n(2n-1))". OEIS Foundation. https://oeis.org/A001905. 
  469. ↑ Sloane, N. J. A., ed. "Sequence A214083 (floor(n!^(1/3)))". OEIS Foundation. https://oeis.org/A214083. 
  470. ↑ Sloane, N. J. A., ed. "Sequence A001208 (solution to the postage stamp problem with 3 denominations and n stamps)". OEIS Foundation. https://oeis.org/A001208. 
  471. ↑ Sloane, N. J. A., ed. "Sequence A000081 (Number of unlabeled rooted trees with n nodes (or connected functions with a fixed point))". OEIS Foundation. https://oeis.org/A000081. 
  472. ↑ Sloane, N. J. A., ed. "Sequence A039771 (Numbers k such that phi(k) is a perfect cube)". OEIS Foundation. https://oeis.org/A039771. 
  473. ↑ Sloane, N. J. A., ed. "Sequence A024026 (3^n - n^3)". OEIS Foundation. https://oeis.org/A024026. 
  474. ↑ Sloane, N. J. A., ed. "Sequence A235945 (Number of partitions of n containing at least one prime)". OEIS Foundation. https://oeis.org/A235945. 
  475. ↑ Sloane, N. J. A., ed. "Sequence A354493 (Number of quantales on n elements, up to isomorphism)". OEIS Foundation. https://oeis.org/A354493. 
  476. ↑ Sloane, N. J. A., ed. "Sequence A088144 (Sum of primitive roots of n-th prime)". OEIS Foundation. https://oeis.org/A088144. 
  477. ↑ Sloane, N. J. A., ed. "Sequence A000166 (Subfactorial or rencontres numbers, or derangements: number of permutations of n elements with no fixed points)". OEIS Foundation. https://oeis.org/A000166. 
  478. ↑ Sloane, N. J. A., ed. "Sequence A000240 (Rencontres numbers: number of permutations of [n with exactly one fixed point)"]. OEIS Foundation. https://oeis.org/A000240. 
  479. ↑ Sloane, N. J. A., ed. "Sequence A000602 (Number of n-node unrooted quartic trees; number of n-carbon alkanes C(n)H(2n+2) ignoring stereoisomers)". OEIS Foundation. https://oeis.org/A000602. 
  480. ↑ ""Aztec Diamond"". https://mathworld.wolfram.com/AztecDiamond.html. 
  481. ↑ Sloane, N. J. A., ed. "Sequence A082671 (Numbers n such that (n!-2)/2 is a prime)". OEIS Foundation. https://oeis.org/A082671. 
  482. ↑ Sloane, N. J. A., ed. "Sequence A023811 (Largest metadrome (number with digits in strict ascending order) in base n)". OEIS Foundation. https://oeis.org/A023811. 
  483. ↑ Sloane, N. J. A., ed. "Sequence A000990 (Number of plane partitions of n with at most two rows)". OEIS Foundation. https://oeis.org/A000990. 
  484. ↑ Sloane, N. J. A., ed. "Sequence A164652 (Hultman numbers)". OEIS Foundation. https://oeis.org/A164652. 
  485. ↑ Sloane, N. J. A., ed. "Sequence A007530 (Prime quadruples: numbers k such that k, k+2, k+6, k+8 are all prime)". OEIS Foundation. https://oeis.org/A007530. 
  486. ↑ Sloane, N. J. A., ed. "Sequence A057568 (Number of partitions of n where n divides the product of the parts)". OEIS Foundation. https://oeis.org/A057568. 
  487. ↑ Sloane, N. J. A., ed. "Sequence A011757 (prime(n^2))". OEIS Foundation. https://oeis.org/A011757. 
  488. ↑ Sloane, N. J. A., ed. "Sequence A004799 (Self convolution of Lucas numbers)". OEIS Foundation. https://oeis.org/A004799. 
  489. ↑ Sloane, N. J. A., ed. "Sequence A005920 (Tricapped prism numbers)". OEIS Foundation. https://oeis.org/A005920. 
  490. ↑ Sloane, N. J. A., ed. "Sequence A000609 (Number of threshold functions of n or fewer variables)". OEIS Foundation. https://oeis.org/A000609. 
  491. ↑ Sloane, N. J. A., ed. "Sequence A259793 (Number of partitions of n^4 into fourth powers)". OEIS Foundation. https://oeis.org/A259793. 
  492. ↑ Sloane, N. J. A., ed. "Sequence A006785 (Number of triangle-free graphs on n vertices)". OEIS Foundation. https://oeis.org/A006785. 
  493. ↑ Sloane, N. J. A., ed. "Sequence A002998 (Smallest multiple of n whose digits sum to n)". OEIS Foundation. https://oeis.org/A002998. 
  494. ↑ Sloane, N. J. A., ed. "Sequence A005987 (Number of symmetric plane partitions of n)". OEIS Foundation. https://oeis.org/A005987. 
  495. ↑ Sloane, N. J. A., ed. "Sequence A023431 (Generalized Catalan Numbers)". OEIS Foundation. https://oeis.org/A023431. 
  496. ↑ Sloane, N. J. A., ed. "Sequence A217135 (Numbers n such that 3^n - 8 is prime)". OEIS Foundation. https://oeis.org/A217135. 
  497. ↑ "Sloane's A034897 : Hyperperfect numbers". OEIS Foundation. https://oeis.org/A034897. 
  498. ↑ Sloane, N. J. A., ed. "Sequence A240736 (Number of compositions of n having exactly one fixed point)". OEIS Foundation. https://oeis.org/A240736. 
  499. ↑ Sloane, N. J. A., ed. "Sequence A007070 (4*a(n-1) - 2*a(n-2))". OEIS Foundation. https://oeis.org/A007070. 
  500. ↑ Sloane, N. J. A., ed. "Sequence A000412 (Number of bipartite partitions of n white objects and 3 black ones)". OEIS Foundation. https://oeis.org/A000412. 
  501. ↑ Sloane, N. J. A., ed. "Sequence A027851 (Number of nonisomorphic semigroups of order n)". OEIS Foundation. https://oeis.org/A027851. 
  502. ↑ Sloane, N. J. A., ed. "Sequence A003060 (Smallest number with reciprocal of period length n in decimal (base 10))". OEIS Foundation. https://oeis.org/A003060. 
  503. ↑ Sloane, N. J. A., ed. "Sequence A008514 (4-dimensional centered cube numbers)". OEIS Foundation. https://oeis.org/A008514. 
  504. ↑ Sloane, N. J. A., ed. "Sequence A024012 (2^n - n^2)". OEIS Foundation. https://oeis.org/A024012. 
  505. ↑ 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))". OEIS Foundation. https://oeis.org/A002845. 
  506. ↑ "Sloane's A051870 : 18-gonal numbers". OEIS Foundation. https://oeis.org/A051870. 
  507. ↑ Sloane, N. J. A., ed. "Sequence A045648 (Number of chiral n-ominoes in (n-1)-space, one cell labeled)". OEIS Foundation. https://oeis.org/A045648. 
  508. ↑ 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)". OEIS Foundation. https://oeis.org/A000127. 
  509. ↑ Sloane, N. J. A., ed. "Sequence A178084 (Numbers k for which 10k + 1, 10k + 3, 10k + 7, 10k + 9 and 10k + 13 are primes)". OEIS Foundation. https://oeis.org/A178084. 
  510. ↑ 510.0 510.1 Sloane, N. J. A., ed. "Sequence A007419 (Largest number not the sum of distinct n-th-order polygonal numbers)". OEIS Foundation. https://oeis.org/A007419. 
  511. ↑ 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)". OEIS Foundation. https://oeis.org/A100953. 
  512. ↑ 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)". OEIS Foundation. https://oeis.org/A226366. 
  513. ↑ 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))". OEIS Foundation. https://oeis.org/A319014. 
  514. ↑ Sloane, N. J. A., ed. "Sequence A055621 (Number of covers of an unlabeled n-set)". OEIS Foundation. https://oeis.org/A055621. 
  515. ↑ Sloane, N. J. A., ed. "Sequence A000522 (Total number of ordered k-tuples of distinct elements from an n-element set)". OEIS Foundation. https://oeis.org/A000522. 
  516. ↑ Sloane, N. J. A., ed. "Sequence A104621 (Heptanacci-Lucas numbers)". OEIS Foundation. https://oeis.org/A104621. 
  517. ↑ Sloane, N. J. A., ed. "Sequence A005449 (Second pentagonal numbers)". OEIS Foundation. https://oeis.org/A005449. 
  518. ↑ Sloane, N. J. A., ed. "Sequence A002982 (Numbers n such that n! - 1 is prime)". OEIS Foundation. https://oeis.org/A002982. 
  519. ↑ Sloane, N. J. A., ed. "Sequence A030238 (Backwards shallow diagonal sums of Catalan triangle A009766)". OEIS Foundation. https://oeis.org/A030238. 
  520. ↑ 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)". OEIS Foundation. https://oeis.org/A089046. 
  521. ↑ Sloane, N. J. A., ed. "Sequence A065900 (Numbers n such that sigma(n) equals sigma(n-1) + sigma(n-2))". OEIS Foundation. https://oeis.org/A065900. 
  522. ↑ 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. https://archive.org/details/sim_american-mathematical-monthly_1993-02_100_2/page/180. 
  523. ↑ Sloane, N. J. A., ed. "Sequence A052542 (2*a(n-1) + a(n-2))". OEIS Foundation. https://oeis.org/A052542. 
  524. ↑ Sloane, N. J. A., ed. "Sequence A024069 (6^n - n^7)". OEIS Foundation. https://oeis.org/A024069. 
  525. ↑ Sloane, N. J. A., ed. "Sequence A217076 (Numbers n such that (n^37-1)/(n-1) is prime)". OEIS Foundation. https://oeis.org/A217076. 
  526. ↑ Sloane, N. J. A., ed. "Sequence A302545 (Number of non-isomorphic multiset partitions of weight n with no singletons)". OEIS Foundation. https://oeis.org/A302545. 
  527. ↑ Sloane, N. J. A., ed. "Sequence A277288 (Positive integers n such that n divides (3^n + 5))". OEIS Foundation. https://oeis.org/A277288. 
  528. ↑ Sloane, N. J. A., ed. "Sequence A187220 (Gullwing sequence)". OEIS Foundation. https://oeis.org/A187220. 
  529. ↑ Sloane, N. J. A., ed. "Sequence A046351 (Palindromic composite numbers with only palindromic prime factors)". OEIS Foundation. https://oeis.org/A046351. 
  530. ↑ Sloane, N. J. A., ed. "Sequence A000612 (Number of P-equivalence classes of switching functions of n or fewer variables, divided by 2)". OEIS Foundation. https://oeis.org/A000612. 
  531. ↑ OEIS: A059801
  532. ↑ Sloane, N. J. A., ed. "Sequence A002470 (Glaisher's function W(n))". OEIS Foundation. https://oeis.org/A002470. 
  533. ↑ 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)". OEIS Foundation. https://oeis.org/A263341. 
  534. ↑ Sloane, N. J. A., ed. "Sequence A089085 (Numbers k such that (k! + 3)/3 is prime)". OEIS Foundation. https://oeis.org/A089085. 
  535. ↑ Sloane, N. J. A., ed. "Sequence A011755 (Sum_{1..n} k*phi(k))". OEIS Foundation. https://oeis.org/A011755. 
  536. ↑ Sloane, N. J. A., ed. "Sequence A005448 (Centered triangular numbers: 3n(n-1)/2 + 1)". OEIS Foundation. https://oeis.org/A005448. ,
  537. ↑ Sloane, N. J. A., ed. "Sequence A038823 (Number of primes between n*1000 and (n+1)*1000)". OEIS Foundation. https://oeis.org/A038823. 
  538. ↑ Stein, William A. (10 February 2017). "The Riemann Hypothesis and The Birch and Swinnerton-Dyer Conjecture". https://wstein.org/talks/2017-02-10-wing-rh_and_bsd/. 



Retrieved from "https://handwiki.org/wiki/index.php?title=1000_(number)&oldid=3384755"