fbpx
Wikipedia

1000 (number)

August 31, 2023

"1,000", "Thousand", and "Chiliad" redirect here. For other uses, see 1000 (disambiguation) or, for the military unit, see Chiliarchy.

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.

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
Senary43446
Octal17508
Duodecimal6B412
Hexadecimal3E816
Tamil௲
Chinese千
Punjabi੧੦੦੦
Look up thousand or 1000 in Wiktionary, the free dictionary.

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 Edit

  • 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 Edit

There are 168 prime numbers less than 1000.[2]

1000 is the 10th icositetragonal number, or 24-gonal number.[3]

1000 has a reduced totient value of 100, and totient of 400. It is equal to the sum of Euler's totient function over the first 57 integers, with 11 integers having a totient value of 1000.

1000 is the smallest number that generates three primes in the fastest way possible by concatenation of decremented numbers: (1,000,999), (1,000,999,998,997), and (1,000,999,998,997,996,995,994,993) are all prime.[4]

The 1000th prime number is 7919. It is a difference of 1 from the order of the smallest sporadic group:   = 7920.

Selected numbers in the range 1001–1999 Edit

1001 to 1099 Edit

1001 = sphenic number (7 × 11 × 13), pentagonal number, pentatope number
1002 = sphenic number, Mertens function zero, abundant number, number of partitions of 22
1003 = the product of some prime p and the pth prime, namely p = 17.
1004 = heptanacci number[5]
1005 = Mertens function zero, decagonal pyramidal number[6]
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;[7] record gap between twin primes;[8] number that is the sum of 7 positive 5th powers.[9] 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)[10]
1007 = number that is the sum of 8 positive 5th powers[11]
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,[12] Mertens function zero
1011 = the largest n such that 2n contains 101 and doesn't contain 11011, Harshad number in bases 5, 10, 15, 20, 25, 30, 35, 40, 45, 50, 55, 60, 65, 70, 75 (and 202 other bases), number of partitions of 1 into reciprocals of positive integers <= 16 Egyptian fraction[13]
1012 = ternary number, (3210) quadruple triangular number (triangular number is 253),[14] number of partitions of 1 into reciprocals of positive integers <= 17 Egyptian fraction[13]
1013 = Sophie Germain prime,[15] centered square number,[16] Mertens function zero
1014 = 210-10,[17] Mertens function zero, sum of the nontriangular numbers between successive triangular numbers
1015 = square pyramidal number[18]
1016 = member of the Mian–Chowla sequence,[19] stella octangula number, number of surface points on a cube with edge-length 14[20]
1017 = generalized triacontagonal number[21]
1018 = Mertens function zero, 101816 + 1 is prime[22]
1019 = Sophie Germain prime,[15] safe prime,[23] 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);[24] the number of three-dimensional polycubes with 7 cells;[25] 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.[26]
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,[27] Sophie Germain prime,[15] 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[28]
1035 = triangular number,[29] hexagonal number[30]
1036 = central polygonal number[31]
1037 = number in E-toothpick sequence[32]
1038 = even integer that is an unordered sum of two primes in exactly n ways[33]
1039 = prime of the form 8n+7,[34] number of partitions of 30 that do not contain 1 as a part,[35] Chen prime
1040 = 45 + 42: sum of distinct powers of 4.[36] The number of pieces that could be seen in a 6 × 6 × 6× 6 Rubik's Tesseract.
1041 = sum of 11 positive 5th powers[37]
1042 = sum of 12 positive 5th powers[38]
1043 = number whose sum of even digits and sum of odd digits are even[39]
1044 = sum of distinct powers of 4[36]
1045 = octagonal number[40]
1046 = coefficient of f(q) (3rd order mock theta function)[41]
1047 = number of ways to split a strict composition of n into contiguous subsequences that have the same sum[42]
1048 = number of partitions of n into squarefree parts[43]
1049 = Sophie Germain prime,[15] highly cototient number,[44] Chen prime
1050 = 10508 to decimal becomes a pronic number (55210),[45] number of parts in all partitions of 29 into distinct parts[46]
1051 = centered pentagonal number,[47] centered decagonal number
1052 = number that is the sum of 9 positive 6th powers[48]
1053 = triangular matchstick number[49]
1054 = centered triangular number[50]
1055 = number that is the sum of 12 positive 6th powers[51]
1056 = pronic number[52]
1057 = central polygonal number[53]
1058 = number that is the sum of 4 positive 5th powers,[54] area of a square with diagonal 46[55]
1059 = number n such that n4 is written in the form of a sum of four positive 4th powers[56]
1060 = sum of the first 25 primes
1061 = emirp, twin prime with 1063
1062 = number that is not the sum of two palindromes[57]
1063 = super-prime, sum of seven consecutive primes (137 + 139 + 149 + 151 + 157 + 163 + 167); near-wall-sun-sun prime[58]
1064 = sum of two positive cubes[59]
1065 = generalized duodecagonal[60]
1066 = number whose sum of their divisors is a square[61]
1067 = number of strict integer partitions of n in which are empty or have smallest part not dividing the other ones[62]
1068 = number that is the sum of 7 positive 5th powers,[9] total number of parts in all partitions of 15[63]
1069 = emirp[64]
1070 = number that is the sum of 9 positive 5th powers[65]
1071 = heptagonal number[66]
1072 = centered heptagonal number[67]
1073 = number that is the sum of 12 positive 5th powers[38]
1074 = number that is not the sum of two palindromes[57]
1075 = number non-sum of two palindromes[57]
1076 = number of strict trees weight n[68]
1077 = number where 7 outnumbers every other digit in the number[69]
1078 = Euler transform of negative integers[70]
1079 = every positive integer is the sum of at most 1079 tenth powers.
1080 = pentagonal number[71]
1081 = triangular number,[29] member of Padovan sequence[72]
1082 = central polygonal number[31]
1083 = three-quarter square,[73] number of partitions of 53 into prime parts
1084 = third spoke of a hexagonal spiral,[74] 108464 + 1 is prime
1085 = number of partitions of n into distinct parts > or = 2[75]
1086 = Smith number,[76] sum of totient function for first 59 integers
1087 = super-prime, cousin prime, lucky prime[77]
1088 = octo-triangular number, (triangular number result being 136)[78] sum of two distinct powers of 2, (1024 + 64)[79] number that is divisible by exactly seven primes with the inclusion of multiplicity[80]
1089 = 332, nonagonal number, centered octagonal number, first natural number whose digits in its decimal representation get reversed when multiplied by 9.[81]
1090 = sum of 5 positive 5th powers[82]
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[83]), twin prime with 1091 and star number[84]
1094 = sum of 9 positive 5th powers,[65] 109464 + 1 is prime
1095 = sum of 10 positive 5th powers,[85] number that is not the sum of two palindromes
1096 = hendecagonal number,[86] number of strict solid partitions of 18[87]
1097 = emirp,[64] Chen prime
1098 = multiple of 9 containing digit 9 in its base-10 representation[88]
1099 = number where 9 outnumbers every other digit[89]

1100 to 1199 Edit

1100 = number of partitions of 61 into distinct squarefree parts[90]
1101 = pinwheel number[91]
1102 = sum of totient function for first 60 integers
1103 = Sophie Germain prime,[15] balanced prime[92]
1104 = Keith number[93]
1105 = 332 + 42 = 322 + 92 = 312 + 122 = 232 + 242, Carmichael number,[94] magic constant of n × n normal magic square and n-queens problem for n = 13, decagonal number,[95] centered square number,[16] Fermat pseudoprime[96]
1106 = number of regions into which the plane is divided when drawing 24 ellipses[97]
1107 = number of non-isomorphic strict T0 multiset partitions of weight 8[98]
1108 = number k such that k64 + 1 is prime
1109 = Friedlander-Iwaniec prime,[99] Chen prime
1110 = k such that 2k + 3 is prime[100]
1111 = 11 × 101, palindrome that is a product of two palindromic primes[101]
1112 = k such that 9k - 2 is a prime[102]
1113 = number of strict partions of 40[103]
1114 = number of ways to write 22 as an orderless product of orderless sums[104]
1115 = number of partitions of 27 into a prime number of parts[105]
1116 = divisible by the number of primes below it
1117 = number of diagonally symmetric polyominoes with 16 cells,[106] Chen prime
1118 = number of unimodular 2 × 2 matrices having all terms in {0,1,...,21}[107]
1119 = number of bipartite graphs with 9 nodes[108]
1120 = number k such that k64 + 1 is prime
1121 = number of squares between 342 and 344.[109]
1122 = pronic number,[52] divisible by the number of primes below it
1123 = balanced prime[92]
1124 = Leyland number[110]
1125 = Achilles number
1126 = number of 2 × 2 non-singular integer matrices with entries from {0, 1, 2, 3, 4, 5}[111]
1127 = maximal number of pieces that can be obtained by cutting an annulus with 46 cuts[112]
1128 = triangular number,[29] hexagonal number,[30] divisible by the number of primes below it
1129 = number of lattice points inside a circle of radius 19[113]
1130 = skiponacci number[114]
1131 = number of edges in the hexagonal triangle T(26)[115]
1132 = number of simple unlabeled graphs with 9 nodes of 2 colors whose components are complete graphs[116]
1133 = number of primitive subsequences of {1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15}[117]
1134 = divisible by the number of primes below it, triangular matchstick number[49]
1135 = centered triangular number[118]
1136 = number of independent vertex sets and vertex covers in the 7-sunlet graph[119]
1137 = sum of values of vertices at level 5 of the hyperbolic Pascal pyramid[120]
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)[121]
1140 = tetrahedral number[122]
1141 = 7-Knödel number[123]
1142 = n such that n32 + 1 is prime[124]
1143 = number of set partitions of 8 elements with 2 connectors[125]
1144 is not the sum of a pair of twin primes[126]
1145 = 5-Knödel number[127]
1146 is not the sum of a pair of twin primes[126]
1147 = 31 × 37 (a product of 2 successive primes)[128]
1148 is not the sum of a pair of twin primes[126]
1149 = a product of two palindromic primes[129]
1150 = number of 11-iamonds without bilateral symmetry.[130]
1151 = first prime following a prime gap of 22,[131] Chen prime
1152 = highly totient number,[132] 3-smooth number (27×32), area of a square with diagonal 48,[55] Achilles number
1153 = super-prime, Proth prime[133]
1154 = 2 × 242 + 2 = number of points on surface of tetrahedron with edgelength 24[134]
1155 = number of edges in the join of two cycle graphs, both of order 33[135]
1156 = 342, octahedral number,[136] centered pentagonal number,[47] centered hendecagonal number.[137]
1157 = smallest number that can be written as n^2+1 without any prime factors that can be written as a^2+1.[138]
1158 = number of points on surface of octahedron with edgelength 17[139]
1159 = member of the Mian–Chowla sequence,[19] a centered octahedral number[140]
1160 = octagonal number[141]
1161 = sum of the first 26 primes
1162 = pentagonal number,[71] sum of totient function for first 61 integers
1163 = smallest prime > 342.[142] 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[143]
1165 = 5-Knödel number[127]
1166 = heptagonal pyramidal number[144]
1167 = number of rational numbers which can be constructed from the set of integers between 1 and 43[145]
1168 = antisigma(49)[146]
1169 = highly cototient number[44]
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[147]
1173 = number of simple triangulation on a plane with 9 nodes[148]
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[112]
1176 = triangular number[29]
1177 = heptagonal number[66]
1178 = number of surface points on a cube with edge-length 15[20]
1179 = number of different permanents of binary 7*7 matrices[149]
1180 = smallest number of non-integral partitions into non-integral power >1000.[150]
1181 = smallest k over 1000 such that 8*10^k-49 is prime.[151]
1182 = number of necklaces possible with 14 beads of 2 colors (that cannot be turned over)[152]
1183 = pentagonal pyramidal number
1184 = amicable number with 1210[153]
1185 = number of partitions of 45 into pairwise relatively prime parts[154]
1186 = number of diagonally symmetric polyominoes with 15 cells,[106] number of partitions of 54 into prime parts
1187 = safe prime,[23] Stern prime,[155] balanced prime,[92] Chen prime
1188 = first 4 digit multiple of 18 to contain 18[156]
1189 = number of squares between 352 and 354.[109]
1190 = pronic number,[52] number of cards to build an 28-tier house of cards[157]
1191 = 352 - 35 + 1 = H35 (the 35th Hogben number)[158]
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[159]
1195 = smallest four digit number for which a−1(n) is an integer is a(n) is 2*a(n-1) - (-1)n[160]
1196 =  [161]
1197 = pinwheel number[91]
1198 = centered heptagonal number[67]
1199 = area of the 20th conjoined trapezoid[162]

1200 to 1299 Edit

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,[163] number k such that k64 + 1 is prime
1201 = centered square number,[16] super-prime, centered decagonal number
1202 = number of regions the plane is divided into by 25 ellipses[97]
1203: first 4 digit number in the coordinating sequence for the (2,6,∞) tiling of the hyperbolic plane[164]
1204: magic constant of a 7 × 7 × 7 magic cube[165]
1205 = number of partitions of 28 such that the number of odd parts is a part[166]
1206 = 29-gonal number [167]
1207 = composite de Polignac number[168]
1208 = number of strict chains of divisors starting with the superprimorial A006939(3)[169]
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[170]
1211 = composite de Polignac number[168]
1212 =  , where   is the number of partions of  [171]
1213 = emirp
1214 = sum of first 39 composite numbers[172]
1215 = number of edges in the hexagonal triangle T(27)[115]
1216 = nonagonal number[173]
1217 = super-prime, Proth prime[133]
1218 = triangular matchstick number[49]
1219 = Mertens function zero, centered triangular number[118]
1220 = Mertens function zero, number of binary vectors of length 16 containing no singletons[174]
1221 = product of the first two digit, and three digit repdigit
1222 = hexagonal pyramidal number
1223 = Sophie Germain prime,[15] balanced prime, 200th prime number[92]
1224 = number of edges in the join of two cycle graphs, both of order 34[135]
1225 = 352, square triangular number,[175] hexagonal number,[30] centered octagonal number[176]
1226 = number of rooted identity trees with 15 nodes [177]
1227 = smallest number representable as the sum of 3 triangular numbers in 27 ways[178]
1228 = sum of totient function for first 63 integers
1229 = Sophie Germain prime,[15] number of primes between 0 and 10000, emirp
1230 = the Mahonian number: T(9, 6)[179]
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[180]
1233 = 122 + 332
1234 = number of parts in all partitions of 30 into distinct parts,[46] smallest whole number containing all numbers from 1 to 4
1235 = excluding duplicates, contains the first four Fibbonacci numbers [181]
1236 = 617 + 619: sum of twin prime pair[182]
1237 = prime of the form 2p-1
1238 = number of partitions of 31 that do not contain 1 as a part[35]
1239 = toothpick number in 3D[183]
1240 = square pyramidal number[18]
1241 = centered cube number[184]
1242 = decagonal number[95]
1243 = composite de Polignac number[168]
1244 = number of complete partitions of 25[185]
1245 = Number of labeled spanning intersecting set-systems on 5 vertices.[186]
1246 = number of partitions of 38 such that no part occurs more than once[187]
1247 = pentagonal number[71]
1248 = the first four powers of 2 concatenated together
1249 = emirp, trimorphic number[188]
1250 = area of a square with diagonal 50[55]
1251 = 2 × 252 + 1 = number of different 2 × 2 determinants with integer entries from 0 to 25[189]
1252 = 2 × 252 + 2 = number of points on surface of tetrahedron with edgelength 25[134]
1253 = number of partitions of 23 with at least one distinct part[190]
1254 = number of partitions of 23 into relatively prime parts[191]
1255 = Mertens function zero, number of ways to write 23 as an orderless product of orderless sums,[104] number of partitions of 23[192]
1256 = Mertens function zero
1257 = number of lattice points inside a circle of radius 20[113]
1258 = Mertens function zero
1259 = highly cototient number[44]
1260 = highly composite number,[193] pronic number,[52] the smallest vampire number,[194] sum of totient function for first 64 integers, number of strict partions of 41[103] and appears twice in the Book of Revelation
1261 = star number,[84] Mertens function zero
1262 = maximal number of regions the plane is divided into by drawing 36 circles[195]
1263 = rounded total surface area of a regular tetrahedron with edge length 27[196]
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[197]
1266 = centered pentagonal number,[47] Mertens function zero
1267 = 7-Knödel number[123]
1268 = number of partitions of 37 into prime power parts[198]
1269 = least number of triangles of the Spiral of Theodorus to complete 11 revolutions[199]
1270 = 25 + 24×26 + 23×27,[200] Mertens function zero
1271 = sum of first 40 composite numbers[172]
1272 = sum of first 41 nonprimes[201]
1273 = 19 × 67 = 19 × prime(19)[202]
1274 = sum of the nontriangular numbers between successive triangular numbers
1275 = triangular number,[29] sum of the first 50 natural numbers
1276 = number of irredundant sets in the 25-cocktail party graph[203]
1277 = the start of a prime constellation of length 9 (a "prime nonuple")
1278 = number of Narayana's cows and calves after 20 years[204]
1279 = Mertens function zero, Mersenne prime exponent
1280 = Mertens function zero, number of parts in all compositions of 9[205]
1281 = octagonal number[141]
1282 = Mertens function zero, number of partitions of 46 into pairwise relatively prime parts[154]
1283 = safe prime[23]
1284 = 641 + 643: sum of twin prime pair[182]
1285 = Mertens function zero, number of free nonominoes, number of parallelogram polyominoes with 10 cells.[206]
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[207]
1287 =  [208]
1288 = heptagonal number[66]
1289 = Sophie Germain prime,[15] Mertens function zero
1290 =  , average of a twin prime pair[209]
1291 = largest prime < 64,[210] Mertens function zero
1292 = number such that phi(1292) = phi(sigma(1292)),[211] Mertens function zero
1293 =  [212]
1294 = rounded volume of a regular octahedron with edge length 14[213]
1295 = number of edges in the join of two cycle graphs, both of order 35[135]
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[91]
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[214]

1300 to 1399 Edit

1300 = Sum of the first 4 fifth powers, mertens function zero, largest possible win margin in an NAQT match
1301 = centered square number,[16] Honaker prime,[215] number of trees with 13 unlabeled nodes[216]
1302 = Mertens function zero, number of edges in the hexagonal triangle T(28)[115]
1303 = prime of form 21n+1 and 31n+1[217] [218]
1304 = sum of 13046 and 1304 9 which is 328+976
1305 = triangular matchstick number[49]
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.[118]
1307 = safe prime[23]
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[219]
1312 = member of the Mian-Chowla sequence;[19]
1313 = sum of all parts of all partitions of 14 [220]
1314 = number of integer partitions of 41 whose distinct parts are connected[221]
1315 = 10^(2n+1)-7*10^n-1 is prime.[222]
1316 = Euler transformation of sigma(11)[223]
1317 = 1317 Only odd four digit number to divide the concatenation of all number up to itself in base 25[224]
1318 = Mertens function zero
1319 = safe prime[23]
1320 = 659 + 661: sum of twin prime pair[182]
1321 = Friedlander-Iwaniec prime[99]
1322 = area of the 21th conjoined trapezoid[162]
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))[225]
1325 = Markov number,[226] centered tetrahedral number[227]
1326 = triangular number,[29] hexagonal number,[30] 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[172]
1330 = tetrahedral number,[110] forms a Ruth–Aaron pair with 1331 under second definition
1331 = 113, centered heptagonal number,[67] 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[52]
1333 = 372 - 37 + 1 = H37 (the 37th Hogben number)[158]
1334 = maximal number of regions the plane is divided into by drawing 37 circles[195]
1335 = pentagonal number,[71] Mertens function zero
1336 = Mertens function zero
1337 = Used in the novel form of spelling called leet. Approximate melting point of gold in kelvins.
1338 = Mertens function zero
1339 = First 4 digit number to appear twice in the sequence of sum of cubes of primes dividing n[228]
1340 = k such that 5 × 2k - 1 is prime[229]
1341 = First mountain number with 2 jumps of more than one.
1342 =  ,[161] Mertens function zero
1343 = cropped hexagone[230]
1344 = 372 - 52, the only way to express 1344 as a difference of prime squares[231]
1345 = k such that k, k+1 and k+2 are products of two primes[232]
1346= number of locally disjointed rooted trees with 10 nodes[233]
1347 = concatenation of first 4 Lucas numbers [234]
1348 = number of ways to stack 22 pennies such that every penny is in a stack of one or two[235]
1349 = Stern-Jacobsthal number[236]
1350 = nonagonal number[173]
1351 = number of partitions of 28 into a prime number of parts[105]
1352 = number of surface points on a cube with edge-length 16,[20] Achilles number
1353 = 2 × 262 + 1 = number of different 2 × 2 determinants with integer entries from 0 to 26[189]
1354 = 2 × 262 + 2 = number of points on surface of tetrahedron with edgelength 26[134]
1355 appears for the first time in the Recamán's sequence at n = 325,374,625,245.[237] Or in other words A057167(1355) = 325,374,625,245[238][239]
1356 is not the sum of a pair of twin primes[126]
1357 = number of nonnegative solutions to x2 + y2 ≤ 412[240]
1358 = rounded total surface area of a regular tetrahedron with edge length 28[196]
1359 is the 42d term of Flavius Josephus's sieve[241]
1360 = 372 - 32, the only way to express 1360 as a difference of prime squares[231]
1361 = first prime following a prime gap of 34,[131] centered decagonal number, Honaker prime[215]
1362 = number of achiral integer partitions of 48[242]
1363 = the number of ways to modify a circular arrangement of 14 objects by swapping one or more adjacent pairs[243]
1364 = Lucas number[244]
1365 = pentatope number[245]
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[246]
1367 = safe prime,[23] 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),[92]
1368 = number of edges in the join of two cycle graphs, both of order 36[135]
1369 = 372, centered octagonal number[176]
1370 = σ2(37): sum of squares of divisors of 37[247]
1371 = sum of the first 28 primes
1372 = Achilles number
1373 = number of lattice points inside a circle of radius 21[113]
1374 = number of unimodular 2 × 2 matrices having all terms in {0,1,...,23}[107]
1375 = decagonal pyramidal number[248]
1376 = primitive abundant number (abundant number all of whose proper divisors are deficient numbers)[249]
1377 = maximal number of pieces that can be obtained by cutting an annulus with 51 cuts[112]
1378 = triangular number[29]
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[250]
1381 = centered pentagonal number[47]Mertens function zero
1382 = first 4 digit tetrachi number [251]
1383 = 3 × 461. 101383 + 7 is prime[252]
1384 =  [161]
1385 = up/down number[253]
1386 = octagonal pyramidal number[254]
1387 = 5th Fermat pseudoprime of base 2,[255] 22nd centered hexagonal number and the 19th decagonal number,[95] second Super-Poulet number.[256]
1388 = 4 × 192 - 3 × 19 + 1 and is therfore on the x-axis of Ulams spiral[257]
1389 = sum of first 42 composite numbers[172]
1390 = sum of first 43 nonprimes[258]
1391 = number of rational numbers which can be constructed from the set of integers between 1 and 47[145]
1392 = number of edges in the hexagonal triangle T(29)[115]
1393 = 7-Knödel number[123]
1394 = sum of totient function for first 67 integers
1395 = vampire number,[194] member of the Mian–Chowla sequence[19] triangular matchstick number[49]
1396 = centered triangular number[118]
1397 =  [259]
1398 = number of integer partitions of 40 whose distinct parts are connected[221]
1399 = emirp[260]

1400 to 1499 Edit

1400 = number of sum-free subsets of {1, ..., 15}[261]
1401 = pinwheel number[91]
1402 = number of integer partitions of 48 whose augmented differences are distinct[262]
1403 = smallest x such that M(x) = 11, where M() is Mertens function[263]
1404 = heptagonal number[66]
1405 = 262 + 272, 72 + 82 + ... + 162, centered square number[16]
1406 = pronic number,[52] semi-meandric number[264]
1407 = 382 - 38 + 1 = H38 (the 38th Hogben number)[158]
1408 = maximal number of regions the plane is divided into by drawing 38 circles[195]
1409 = super-prime, Sophie Germain prime,[15] smallest number whose eighth power is the sum of 8 eighth powers, Proth prime[133]
1410 = denominator of the 46th Bernoulli number[265]
1411 = LS(41)[266]
1412 = LS(42)[267]
1413 = LS(43)[268]
1414 = smallest composite that when added to sum of prime factors reaches a prime after 27 iterations[269]
1415 = the Mahonian number: T(8, 8)[179]
1416 = LS(46)[270]
1417 = number of partitions of 32 in which the number of parts divides 32[271]
1418 = smallest x such that M(x) = 13, where M() is Mertens function[272]
1419 = Zeisel number[273]
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[274]
1422 = number of partitions of 15 with two parts marked[275]
1423 = 200 + 1223 and the 200th prime is 1223[276] Also Used as a Hate symbol
1424 = number of nonnegative solutions to x2 + y2 ≤ 422[240]
1425 = self-descriptive number in base 5
1426 = sum of totient function for first 68 integers, pentagonal number,[71] number of strict partions of 42[103]
1427 = twin prime together with 1429[277]
1428 = number of complete ternary trees with 6 internal nodes, or 18 edges[278]
1429 = number of partitions of 53 such that the smallest part is greater than or equal to number of parts[214]
1430 = Catalan number[279]
1431 = triangular number,[29] hexagonal number[30]
1432 = member of Padovan sequence[72]
1433 = super-prime, Honaker prime,[215] typical port used for remote connections to Microsoft SQL Server databases
1434 = rounded volume of a regular tetrahedron with edge length 23[280]
1435 = vampire number;[194] 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[281]
1437 = smallest number of complexity 20: smallest number requiring 20 1's to build using +, * and ^[282]
1438 = k such that 5 × 2k - 1 is prime[229]
1439 = Sophie Germain prime,[15] safe prime[23]
1440 = a highly totient number[132] 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[84]
1442 = number of parts in all partitions of 31 into distinct parts[46]
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[135]
1444 = 382, smallest pandigital number in Roman numerals
1445 =  [283]
1446 = number of points on surface of octahedron with edgelength 19[139]
1447 = super-prime, happy number
1448 = number k such that phi(prime(k)) is a square[284]
1449 = Stella octangula number
1450 = σ2(34): sum of squares of divisors of 34[247]
1451 = Sophie Germain prime[15]
1452 = first Zagreb index of the complete graph K12[285]
1453 = Sexy prime with 1459
1454 = 3 × 222 + 2 = number of points on surface of square pyramid of side-length 22[286]
1455 = k such that geometric mean of phi(k) and sigma(k) is an integer[287]
1456 = number of regions in regular 15-gon with all diagonals drawn[288]
1457 = 2 × 272 − 1 = a twin square[289]
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[198]
1462 = (35 - 1) × (35 + 8) = the first Zagreb index of the wheel graph with 35 vertices[290]
1463 = total number of parts in all partitions of 16[63]
1464 = rounded total surface area of a regular icosahedron with edge length 13[291]
1465 = 5-Knödel number[127]
1466 =  , where   = number of divisors of  [292]
1467 = number of partitions of 39 with zero crank[293]
1468 = number of polyhexes with 11 cells that tile the plane by translation[294]
1469 = octahedral number,[136] highly cototient number[44]
1470 = pentagonal pyramidal number,[295] sum of totient function for first 69 integers
1471 = super-prime, centered heptagonal number[67]
1472 = number of overpartitions of 15[296]
1473 = cropped hexagone[230]
1474 =  : triangular number plus quarter square (i.e., A000217(44) + A002620(44))[297]
1475 = number of partitions of 33 into parts each of which is used a different number of times[298]
1476 = coreful perfect number[299]
1477 = 7-Knödel number[123]
1478 = total number of largest parts in all compositions of 11[300]
1479 = number of planar partitions of 12[301]
1480 = sum of the first 29 primes
1481 = Sophie Germain prime[15]
1482 = pronic number,[52] number of unimodal compositions of 15 where the maximal part appears once[302]
1483 = 392 - 39 + 1 = H39 (the 39th Hogben number)[158]
1484 = maximal number of regions the plane is divided into by drawing 39 circles[195]
1485 = triangular number
1486 = number of strict solid partitions of 19[87]
1487 = safe prime[23]
1488 = triangular matchstick number[49]
1489 = centered triangular number[118]
1490 = tetranacci number[303]
1491 = nonagonal number,[173] Mertens function zero
1492 = discriminant of a totally real cubic field,[304] Mertens function zero
1493 = Stern prime[155]
1494 = sum of totient function for first 70 integers
1495 = 9###[305]
1496 = square pyramidal number[18]
1497 = skiponacci number[114]
1498 = number of flat partitions of 41[306]
1499 = Sophie Germain prime,[15] super-prime

1500 to 1599 Edit

1500 = hypotenuse in three different Pythagorean triangles[307]
1501 = centered pentagonal number[47]
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[308]
1503 = least number of triangles of the Spiral of Theodorus to complete 12 revolutions[199]
1504 = primitive abundant number (abundant number all of whose proper divisors are deficient numbers)[249]
1505 = number of integer partitions of 41 with distinct differences between successive parts[309]
1506 = number of Golomb partitions of 28[310]
1507 = number of partitions of 32 that do not contain 1 as a part[35]
1508 = heptagonal pyramidal number[144]
1509 = pinwheel number[91]
1510 = deficient number, odious number
1511 = Sophie Germain prime,[15] balanced prime[92]
1512 = k such that geometric mean of phi(k) and sigma(k) is an integer[287]
1513 = centered square number[16]
1514 = sum of first 44 composite numbers[172]
1515 = maximum dimension of Euclidean spaces which suffice for every smooth compact Riemannian 30-manifold to be realizable as a sub-manifold[311]
1516 =  [312]
1517 = number of lattice points inside a circle of radius 22[113]
1518 = Mertens function zero
1519 = Mertens function zero
1520 = pentagonal number,[71] Mertens function zero, forms a Ruth–Aaron pair with 1521 under second definition
1521 = 392, Mertens function zero, centered octagonal number,[176] forms a Ruth–Aaron pair with 1520 under second definition
1522 = k such that 5 × 2k - 1 is prime[229]
1523 = super-prime, Mertens function zero, safe prime,[23] member of the Mian–Chowla sequence[19]
1524 = Mertens function zero, k such that geometric mean of phi(k) and sigma(k) is an integer[287]
1525 = heptagonal number,[66] Mertens function zero
1526 = number of conjugacy classes in the alternating group A27[313]
1527 = Mertens function zero
1528 = Mertens function zero, rounded total surface area of a regular octahedron with edge length 21[314]
1529 = composite de Polignac number[168]
1530 = vampire number[194]
1531 = prime number, centered decagonal number, Mertens function zero
1532 = Mertens function zero
1533 = 21 × 73 = 21 × 21st prime[315]
1534 = number of achiral integer partitions of 50[242]
1535 = Thabit number
1536 = a common size of microplate, 3-smooth number (29×3), number of threshold functions of exactly 4 variables[316]
1537 = Keith number,[93] Mertens function zero
1538 = number of surface points on a cube with edge-length 17[20]
1539 = maximal number of pieces that can be obtained by cutting an annulus with 54 cuts[112]
1540 = triangular number, hexagonal number,[30] decagonal number,[95] tetrahedral number[110]
1541 = octagonal number[141]
1542 = k such that 2^k starts with k[317]
1543 = Mertens function zero
1544 = Mertens function zero, number of partitions of integer partitions of 17 where all parts have the same length[318]
1545 = number of reversible string structures with 9 beads using exactly three different colors[319]
1546 = Mertens function zero
1547 = hexagonal pyramidal number
1548 = coreful perfect number[299]
1549 = de Polignac prime[320]
1550 =   = number of cards needed to build a 31-tier house of cards with a flat, one-card-wide roof[321]
1551 = 6920 - 5369 = A169952(24) - A169952(23) = A169942(24) = number of Golomb rulers of length 24[322][323]
1552 = Number of partitions of 57 into prime parts
1553 = 509 + 521 + 523 = a prime that is the sum of three consecutive primes[324]
1554 = 2 × 3 × 7 × 37 = product of four distinct primes[325]
15552 divides 61554[326]
1556 = sum of the squares of the first nine primes
1557 = number of graphs with 8 nodes and 13 edges[327]
1558 = number k such that k64 + 1 is prime
1559 = Sophie Germain prime[15]
1560 = pronic number[52]
1561 = a centered octahedral number,[140] number of series-reduced trees with 19 nodes[328]
1562 = maximal number of regions the plane is divided into by drawing 40 circles[195]
1563 =  [329]
1564 = sum of totient function for first 71 integers
1565 =   and  [330]
1566 = number k such that k64 + 1 is prime
1567 = number of partitions of 24 with at least one distinct part[190]
1568 = Achilles number[331]
1569 = 2 × 282 + 1 = number of different 2 × 2 determinants with integer entries from 0 to 28[189]
1570 = 2 × 282 + 2 = number of points on surface of tetrahedron with edgelength 28[134]
1571 = Honaker prime[215]
1572 = member of the Mian–Chowla sequence[19]
1573 = discriminant of a totally real cubic field[332]
1574256 + 1 is prime[333]
1575 = odd abundant number,[334] sum of the nontriangular numbers between successive triangular numbers, number of partitions of 24[192]
157614 == 1 (mod 15^2)[335]
1577 = sum of the quadratic residues of 83[336]
1578 = sum of first 45 composite numbers[172]
1579 = number of partitions of 54 such that the smallest part is greater than or equal to number of parts[214]
1580 = number of achiral integer partitions of 51[242]
1581 = number of edges in the hexagonal triangle T(31)[115]
1582 = a number such that the integer triangle [A070080(1582), A070081(1582), A070082(1582)] has an integer area[337]
1583 = Sophie Germain prime
1584 = triangular matchstick number[49]
1585 = Riordan number, centered triangular number[118]
1586 = area of the 23th conjoined trapezoid[162]
1587 = 3 × 232 = number of edges of a complete tripartite graph of order 69, K23,23,23[338]
1588 = sum of totient function for first 72 integers
1589 = composite de Polignac number[168]
1590 = rounded volume of a regular icosahedron with edge length 9[339]
1591 = rounded volume of a regular octahedron with edge length 15[213]
1592 = sum of all divisors of the first 36 odd numbers[340]
1593 = sum of the first 30 primes
1594 = minimal cost of maximum height Huffman tree of size 17[341]
1595 = number of non-isomorphic set-systems of weight 10
1596 = triangular number
1597 = Fibonacci prime,[342] Markov prime,[226] super-prime, emirp
1598 = number of unimodular 2 × 2 matrices having all terms in {0,1,...,25}[107]
1599 = number of edges in the join of two cycle graphs, both of order 39[135]

1600 to 1699 Edit

1600 = 402, structured great rhombicosidodecahedral number,[343] 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,[133] the novel 1601 (Mark Twain)
1602 = number of points on surface of octahedron with edgelength 20[139]
1603 = number of partitions of 27 with nonnegative rank[344]
1604 = number of compositions of 22 into prime parts[345]
1605 = number of polyominoes consisting of 7 regular octagons[346]
1606 = enneagonal pyramidal number[347]
1607 = member of prime triple with 1609 and 1613[348]
1608 =  [161]
1609 = cropped hexagonal number[230]
1610 = number of strict partions of 43[103]
1611 = number of rational numbers which can be constructed from the set of integers between 1 and 51[145]
1612 = maximum dimension of Euclidean spaces which suffice for every smooth compact Riemannian 31-manifold to be realizable as a sub-manifold[349]
1613, 1607 and 1619 are all primes[350]
1614 = number of ways of refining the partition 8^1 to get 1^8[351]
1615 = composite number such that the square mean of its prime factors is a nonprime integer[352]
1616 =   = number of monotonic triples (x,y,z) in {1,2,...,16}3[353]
1617 = pentagonal number[71]
1618 = centered heptagonal number[67]
1619 = palindromic prime in binary, safe prime[23]
1620 = 809 + 811: sum of twin prime pair[182]
1621 = super-prime, pinwheel number[91]
1622 = semiprime of the form prime + 1[354]
1623 is not the sum of two triangular numbers and a fourth power[355]
1624 = number of squares in the Aztec diamond of order 28[356]
1625 = centered square number[16]
1626 = centered pentagonal number[47]
1627 = prime and 2 × 1627 - 1 = 3253 is also prime[357]
1628 = centered pentagonal number[47]
1629 = rounded volume of a regular tetrahedron with edge length 24[280]
1630 = number k such that k^64 + 1 is prime
1631 =  [358]
1632 = number of acute triangles made from the vertices of a regular 18-polygon[359]
1633 = star number[84]
1634 = Narcissistic number in base 10
1635 = number of partitions of 56 whose reciprocal sum is an integer[360]
1636 = number of nonnegative solutions to x2 + y2 ≤ 452[240]
1637 = prime island: least prime whose adjacent primes are exactly 30 apart[361]
1638 = harmonic divisor number,[362] 5 × 21638 - 1 is prime[229]
1639 = nonagonal number[173]
1640 = pronic number[52]
1641 = 412 - 41 + 1 = H41 (the 41st Hogben number)[158]
1642 = maximal number of regions the plane is divided into by drawing 41 circles[195]
1643 = sum of first 46 composite numbers[172]
1644 = 821 + 823: sum of twin prime pair[182]
1645 = number of 16-celled pseudo still lifes in Conway's Game of Life, up to rotation and reflection[363]
1646 = number of graphs with 8 nodes and 14 edges[327]
1647 and 1648 are both divisible by cubes[364]
1648 = number of partitions of 343 into distinct cubes[365]
1649 = highly cototient number,[44] Leyland number[110]
1650 = number of cards to build an 33-tier house of cards[157]
1651 = heptagonal number[66]
1652 = number of partitions of 29 into a prime number of parts[105]
1653 = triangular number, hexagonal number,[30] number of lattice points inside a circle of radius 23[113]
1654 = number of partitions of 42 into divisors of 42[366]
1655 = rounded volume of a regular dodecahedron with edge length 6[367]
1656 = 827 + 829: sum of twin prime pair[182]
1657 = cuban prime,[368] prime of the form 2p-1
1658 = smallest composite that when added to sum of prime factors reaches a prime after 25 iterations[269]
1659 = number of rational numbers which can be constructed from the set of integers between 1 and 52[145]
1660 = sum of totient function for first 73 integers
1661 = 11 × 151, palindrome that is a product of two palindromic primes[101]
1662 = number of partitions of 49 into pairwise relatively prime parts[154]
1663 = a prime number and 51663 - 41663 is a 1163-digit prime number[369]
1664 = k such that k, k+1 and k+2 are sums of 2 squares[370]
1665 = centered tetrahedral number[227]
1666 = largest efficient pandigital number in Roman numerals (each symbol occurs exactly once)
1667 = 228 + 1439 and the 228th prime is 1439[276]
1668 = number of partitions of 33 into parts all relatively prime to 33[371]
1669 = super-prime, smallest prime with a gap of exactly 24 to the next prime[372]
1670 = number of compositions of 12 such that at least two adjacent parts are equal[373]
1671 divides the sum of the first 1671 composite numbers[374]
1672 = 412 - 22, the only way to express 1672 as a difference of prime squares[231]
1673 = RMS number[375]
1674 = k such that geometric mean of phi(k) and sigma(k) is an integer[287]
1675 = Kin number[376]
1676 = number of partitions of 34 into parts each of which is used a different number of times[377]
1677 = 412 - 32, the only way to express 1677 as a difference of prime squares[231]
1678 = n such that n32 + 1 is prime[124]
1679 = highly cototient number,[44] semiprime (23 × 73, see also Arecibo message), number of parts in all partitions of 32 into distinct parts[46]
1680 = highly composite number,[193] number of edges in the join of two cycle graphs, both of order 40[135]
1681 = 412, smallest number yielded by the formula n2 + n + 41 that is not a prime; centered octagonal number[176]
1682 = and 1683 is a member of a Ruth–Aaron pair (first definition)
1683 = triangular matchstick number[49]
1684 = centered triangular number[118]
1685 = 5-Knödel number[127]
1686 =  [161]
1687 = 7-Knödel number[123]
1688 = number of finite connected sets of positive integers greater than one with least common multiple 72[378]
1689 =  [379]
1690 = number of compositions of 14 into powers of 2[380]
1691 = the same upside down, which makes it a strobogrammatic number[381]
1692 = coreful perfect number[299]
1693 = smallest prime > 412.[142]
1694 = number of unimodular 2 × 2 matrices having all terms in {0,1,...,26}[107]
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[99]
1698 = number of rooted trees with 47 vertices in which vertices at the same level have the same degree[197]
1699 = number of rooted trees with 48 vertices in which vertices at the same level have the same degree[197]

1700 to 1799 Edit

1700 = σ2(39): sum of squares of divisors of 39[247]
1701 =  , 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[382]
1704 = sum of the squares of the parts in the partitions of 18 into two distinct parts[383]
1705 = tribonacci number[384]
1706 = 1 + 4 + 16 + 64 + 256 + 1024 + 256 + 64 + 16 + 4 + 1 sum of fifth row of triangle of powers of 4[385]
1707 = number of partitions of 30 in which the number of parts divides 30[271]
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[386]
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[112]
1711 = triangular number, centered decagonal number
1712 = number of irredundant sets in the 29-cocktail party graph[203]
1713 = number of aperiodic rooted trees with 12 nodes[387]
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[388]
1715 = k such that geometric mean of phi(k) and sigma(k) is an integer[287]
1716 = 857 + 859: sum of twin prime pair[182]
1717 = pentagonal number[71]
1718 =  [389]
1719 = composite de Polignac number[168]
1720 = sum of the first 31 primes
1721 = twin prime; number of squares between 422 and 424.[109]
1722 = Giuga number,[390] pronic number[52]
1723 = super-prime
1724 = maximal number of regions the plane is divided into by drawing 42 circles[195]
1725 = 472 - 222 = (prime(15))2 - (nonprime(15))2[391]
1726 = number of partitions of 44 into distinct and relatively prime parts[392]
1727 = area of the 24th conjoined trapezoid[162]
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[286]
1731 = k such that geometric mean of phi(k) and sigma(k) is an integer[287]
1732 =  [393]
1733 = Sophie Germain prime, palindromic in bases 3, 18, 19.
1734 = surface area of a cube of edge length 17[394]
1735 = number of partitions of 55 such that the smallest part is greater than or equal to number of parts[214]
1736 = sum of totient function for first 75 integers, number of surface points on a cube with edge-length 18[20]
1737 = pinwheel number[91]
1738 = number of achiral integer partitions of 52[242]
1739 = number of 1s in all partitions of 30 into odd parts[395]
1740 = number of squares in the Aztec diamond of order 29[356]
1741 = super-prime, centered square number[16]
1742 = number of regions the plane is divided into by 30 ellipses[97]
1743 = wiener index of the windmill graph D(3,21)[121]
1744 = k such that k, k+1 and k+2 are sums of 2 squares[370]
1745 = 5-Knödel number[127]
1746 = number of unit-distance graphs on 8 nodes[396]
1747 = balanced prime[92]
1748 = number of partitions of 55 into distinct parts in which the number of parts divides 55[397]
1749 = number of integer partitions of 33 with no part dividing all the others[219]
1750 = hypotenuse in three different Pythagorean triangles[307]
1751 = cropped hexagone[230]
1752 = 792 - 672, the only way to express 1752 as a difference of prime squares[231]
1753 = balanced prime[92]
1754 = k such that 5*2k - 1 is prime[229]
1755 = number of integer partitions of 50 whose augmented differences are distinct[262]
1756 = centered pentagonal number[47]
1757 = least number of triangles of the Spiral of Theodorus to complete 13 revolutions[199]
1758 =  [161]
1759 = de Polignac prime[320]
1760 = the number of yards in a mile
1761 = k such that k, k+1 and k+2 are products of two primes[232]
1762 = number of binary sequences of length 12 and curling number 2[398]
1763 = number of edges in the join of two cycle graphs, both of order 41[135]
1764 = 422
1765 = number of stacks, or planar partitions of 15[399]
1766 = number of points on surface of octahedron with edgelength 21[139]
1767 = σ(282) = σ(352)[400]
1768 = number of nonequivalent dissections of an hendecagon into 8 polygons by nonintersecting diagonals up to rotation[401]
1769 = maximal number of pieces that can be obtained by cutting an annulus with 58 cuts[112]
1770 = triangular number, hexagonal number,[30] Seventeen Seventy, town in Australia
1771 = tetrahedral number[110]
1772 = centered heptagonal number,[67] 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[402]
1774 = number of rooted identity trees with 15 nodes and 5 leaves[403]
1775 =  : sum of piles of first 10 primes[404]
1776 = square star number.[405] The number of pieces that could be seen in a 7 × 7 × 7× 7 Rubik's Tesseract.
1777 = smallest prime > 422.[142]
1778 = least k >= 1 such that the remainder when 6k is divided by k is 22[406]
1779 = number of achiral integer partitions of 53[242]
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[407]
1781 = the first 1781 digits of e form a prime[408]
1782 = heptagonal number[66]
1783 = de Polignac prime[320]
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[409]
1785 = square pyramidal number,[18] triangular matchstick number[49]
1786 = centered triangular number[118]
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[410]
1789 = number of wiggly sums adding to 17 (terms alternately increase and decrease or vice versa)[411]
1790 = number of partitions of 50 into pairwise relatively prime parts[154]
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[113]
1794 = nonagonal number,[173] number of partitions of 33 that do not contain 1 as a part[35]
1795 = number of heptagons with perimeter 38[412]
1796 = k such that geometric mean of phi(k) and sigma(k) is an integer[287]
1797 = number k such that phi(prime(k)) is a square[284]
1798 = 2 × 29 × 31 = 102 × 111012 × 111112, which yield zero when the prime factors are xored together[413]
1799 = 2 × 302 − 1 = a twin square[289]

1800 to 1899 Edit

1800 = pentagonal pyramidal number,[295] 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)[368]
1802 = 2 × 302 + 2 = number of points on surface of tetrahedron with edgelength 30,[134] number of partitions of 30 such that the number of odd parts is a part[166]
1803 = number of decahexes that tile the plane isohedrally but not by translation or by 180-degree rotation (Conway criterion)[414]
1804 = number k such that k^64 + 1 is prime
1805 = number of squares between 432 and 434.[109]
1806 = pronic number,[52] product of first four terms of Sylvester's sequence, primary pseudoperfect number,[415] only number for which n equals the denominator of the nth Bernoulli number,[416] Schröder number[417]
1807 = fifth term of Sylvester's sequence[418]
1808 = maximal number of regions the plane is divided into by drawing 43 circles[195]
1809 = sum of first 17 super-primes[419]
1810 =  [420]
1811 = Sophie Germain prime
1812 = n such that n32 + 1 is prime[124]
1813 = number of polyominoes with 26 cells, symmetric about two orthogonal axes[421]
1814 = 1 + 6 + 36 + 216 + 1296 + 216 + 36 + 6 + 1 = sum of 4th row of triangle of powers of six[422]
1815 = polygonal chain number  [423]
1816 = number of strict partions of 44[103]
1817 = total number of prime parts in all partitions of 20[424]
1818 = n such that n32 + 1 is prime[124]
1819 = sum of the first 32 primes, minus 32[425]
1820 = pentagonal number,[71] pentatope number,[245] number of compositions of 13 whose run-lengths are either weakly increasing or weakly decreasing[426]
1821 = member of the Mian–Chowla sequence[19]
1822 = number of integer partitions of 43 whose distinct parts are connected[221]
1823 = super-prime, safe prime[23]
1824 = 432 - 52, the only way to express 1824 as a difference of prime squares[231]
1825 = octagonal number[141]
1826 = decagonal pyramidal number[248]
1827 = vampire number[194]
1828 = meandric number, open meandric number, appears twice in the first 10 decimal digits of e
1829 = composite de Polignac number[168]
1830 = triangular number
1831 = smallest prime with a gap of exactly 16 to next prime (1847)[427]
1832 = sum of totient function for first 77 integers
1833 = number of atoms in a decahedron with 13 shells[428]
1834 = octahedral number,[136] sum of the cubes of the first five primes
1835 = absolute value of numerator of  [429]
1836 = factor by which a proton is more massive than an electron
1837 = star number[84]
1838 = number of unimodular 2 × 2 matrices having all terms in {0,1,...,27}[107]
1839 =  [430]
1840 = 432 - 32, the only way to express 1840 as a difference of prime squares[231]
1841 = Mertens function zero
1842 = number of unlabeled rooted trees with 11 nodes[431]
1843 = Mertens function zero
1844 = Mertens function zero
1845 = Mertens function zero
1846 = sum of first 49 composite numbers[172]
1847 = super-prime
1848 = number of edges in the join of two cycle graphs, both of order 42[135]
1849 = 432, palindromic in base 6 (= 123216), centered octagonal number[176]
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[432]
1853 = Mertens function zero
1854 = Mertens function zero
1855 = rencontres number: number of permutations of [7] with exactly one fixed point[433]
1856 = sum of totient function for first 78 integers
1857 = Mertens function zero, pinwheel number[91]
1858 = number of 14-carbon alkanes C14H30 ignoring stereoisomers[434]
1859 = composite de Polignac number[168]
1860 = number of squares in the Aztec diamond of order 30[435]
1861 = centered square number,[16] 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,   is a prime[436]
1865 = 123456: Largest senary metadrome (number with digits in strict ascending order in base 6)[437]
1866 = Mertens function zero, number of plane partitions of 16 with at most two rows[438]
1867 = prime de Polignac number[320]
1868 = smallest number of complexity 21: smallest number requiring 21 1's to build using +, * and ^[282]
1869 = Hultman number: SH(7, 4)[439]
1870 = decagonal number[95]
1871 = the first prime of the 2 consecutive twin prime pairs: (1871, 1873) and (1877, 1879)[440]
1872 = first Zagreb index of the complete graph K13[285]
1873 = number of Narayana's cows and calves after 21 years[204]
1874 = area of the 25th conjoined trapezoid[162]
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[441]
1878 = n such that n32 + 1 is prime[124]
1879 = a prime with square index[442]
1880 = the 10th element of the self convolution of Lucas numbers[443]
1881 = tricapped prism number[444]
1882 = number of linearly separable Boolean functions in 4 variables[445]
1883 = number of conjugacy classes in the alternating group A28[313]
1884 = k such that 5*2k - 1 is prime[229]
1885 = Zeisel number[273]
1886 = number of partitions of 64 into fourth powers[446]
1887 = number of edges in the hexagonal triangle T(34)[115]
1888 = primitive abundant number (abundant number all of whose proper divisors are deficient numbers)[249]
1889 = Sophie Germain prime, highly cototient number[44]
1890 = triangular matchstick number[49]
1891 = triangular number, hexagonal number,[30] centered pentagonal number,[47] centered triangular number[118]
1892 = pronic number[52]
1893 = 442 - 44 + 1 = H44 (the 44th Hogben number)[158]
1894 = maximal number of regions the plane is divided into by drawing 44 circles[195]
1895 = Stern-Jacobsthal number[236]
1896 = member of the Mian-Chowla sequence[19]
1897 = member of Padovan sequence,[72] number of triangle-free graphs on 9 vertices[447]
1898 = smallest multiple of n whose digits sum to 26[448]
1899 = cropped hexagone[230]

1900 to 1999 Edit

1900 = number of primes <= 214.[26] 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[449]
1903 = generalized catalan number[450]
1904 = number of flat partitions of 43[306]
1905 = Fermat pseudoprime[96]
1906 = number n such that 3n - 8 is prime[451]
1907 = safe prime,[23] balanced prime[92]
1908 = coreful perfect number[299]
1909 = hyperperfect number[452]
1910 = number of compositions of 13 having exactly one fixed point[453]
1911 = heptagonal pyramidal number[144]
1912 = size of 6th maximum raising after one blind in pot-limit poker[454]
1913 = super-prime, Honaker prime[215]
1914 = number of bipartite partitions of 12 white objects and 3 black ones[455]
1915 = number of nonisomorphic semigroups of order 5[456]
1916 = sum of first 50 composite numbers[172]
1917 = number of partitions of 51 into pairwise relatively prime parts[154]
1918 = heptagonal number[66]
1919 = smallest number with reciprocal of period length 36 in base 10[457]
1920 = sum of the nontriangular numbers between successive triangular numbers
1921 = 4-dimensional centered cube number[458]
1922 = Area of a square with diagonal 62[55]
1923 = 2 × 312 + 1 = number of different 2 X 2 determinants with integer entries from 0 to 31[189]
1924 = 2 × 312 + 2 = number of points on surface of tetrahedron with edgelength 31[134]
1925 = number of ways to write 24 as an orderless product of orderless sums[104]
1926 = pentagonal number[71]
1927 = 211 - 112[459]
1928 = number of distinct values taken by 2^2^...^2 (with 13 2's and parentheses inserted in all possible ways)[460]
1929 = Mertens function zero, number of integer partitions of 42 whose distinct parts are connected[221]
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[308]
1931 = Sophie Germain prime
1932 = number of partitions of 40 into prime power parts[198]
1933 = centered heptagonal number,[67] Honaker prime[215]
1934 = sum of totient function for first 79 integers
1935 = number of edges in the join of two cycle graphs, both of order 43[135]
1936 = 442, 18-gonal number,[461] 324-gonal number.
1937 = number of chiral n-ominoes in 12-space, one cell labeled[462]
1938 = Mertens function zero, number of points on surface of octahedron with edgelength 22[139]
1939 = 7-Knödel number[123]
1940 = the Mahonian number: T(8, 9)[179]
1941 = maximal number of regions obtained by joining 16 points around a circle by straight lines[463]
1942 = number k for which 10k + 1, 10k + 3, 10k + 7, 10k + 9 and 10k + 13 are primes[464]
1943 = largest number not the sum of distinct tetradecagonal numbers[465]
1944 = 3-smooth number (23×35), Achilles number[331]
1945 = number of partitions of 25 into relatively prime parts such that multiplicities of parts are also relatively prime[466]
1946 = number of surface points on a cube with edge-length 19[20]
1947 = k such that 5·2k + 1 is a prime factor of a Fermat number 22m + 1 for some m[467]
1948 = number of strict solid partitions of 20[87]
1949 = smallest prime > 442.[142]
1950 =  ,[468] largest number not the sum of distinct pentadecagonal numbers[465]
1951 = cuban prime[368]
1952 = number of covers of {1, 2, 3, 4}[469]
1953 = triangular number
1956 = number of sum-free subsets of {1, ..., 16}[261]
1955 = number of partitions of 25 with at least one distinct part[190]
1956 = nonagonal number[173]
1957 =   = total number of ordered k-tuples (k=0,1,2,3,4,5,6) of distinct elements from an 6-element set[470]
1958 = number of partitions of 25[192]
1959 = Heptanacci-Lucas number[471]
1960 = number of parts in all partitions of 33 into distinct parts[46]
1961 = number of lattice points inside a circle of radius 25[113]
1962 = number of edges in the join of the complete graph K36 and the cycle graph C36[472]
1963! - 1 is prime[473]
1964 = number of linear forests of planted planar trees with 8 nodes[474]
1965 = total number of parts in all partitions of 17[63]
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[475]
σ(1968) = σ(1967) + σ(1966)[476]
1969 = Only value less than four million for which a "mod-ification" of the standard Ackermann Function does not stabilize[477]
1970 = number of compositions of two types of 9 having no even parts[478]
1971 =  [479]
1972 = n such that   is prime[480]
1973 = Sophie Germain prime, Leonardo prime
1974 = number of binary vectors of length 17 containing no singletons[174]
1975 = number of partitions of 28 with nonnegative rank[344]
1976 = octagonal number[141]
1977 = number of non-isomorphic multiset partitions of weight 9 with no singletons[481]
1978 = n such that n | (3n + 5)[482]
1979 = number of squares between 452 and 454.[109]
1980 = pronic number[52]
1981 = pinwheel number[91]
1982 = maximal number of regions the plane is divided into by drawing 45 circles[195]
1983 = skiponacci number[114]
1984 = 11111000000 in binary, see also: 1984 (disambiguation)
1985 = centered square number[16]
1986 = number of ways to write 25 as an orderless product of orderless sums[104]
1987 = 300th prime number
1988 = sum of the first 33 primes
1989 = number of 9-step mappings with 4 inputs[250]
1990 = Stella octangula number
1991 = 11 × 181, the 46th Gullwing number,[483] palindromic composite number with only palindromic prime factors[484]
1992 = number of nonisomorphic sets of nonempty subsets of a 4-set[485]
1993 = a number with the property that 41993 - 31993 is prime,[486] number of partitions of 30 into a prime number of parts[105]
1994 = Glaisher's function W(37)[487]
1995 = number of unlabeled graphs on 9 vertices with independence number 6[488]
1996 = a number with the property that (1996! + 3)/3 is prime[489]
1997 =  [490]
1998 = triangular matchstick number[49]
1999 = centered triangular number[491] number of regular forms in a myriagram.

Prime numbers Edit

There are 135 prime numbers between 1000 and 2000:[492][493]

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

References Edit

 
Wikimedia Commons has media related to 1000 (number).
  1. ^ "chiliad". Merriam-Webster. Archived from the original on 25 March 2022.
  2. ^ Caldwell, Chris K (2021). "The First 1,000 Primes". PrimePages. University of Tennessee at Martin.
  3. ^ Sloane, N. J. A. (ed.). "Sequence A051876 (24-gonal numbers.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 30 November 2022.
  4. ^ "1000". Prime Curious!. Archived from the original on 25 March 2022.
  5. ^ "Sloane's A122189 : Heptanacci numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. from the original on 7 October 2016. Retrieved 13 July 2017.
  6. ^ Sloane, N. J. A. (ed.). "Sequence A007585 (10-gonal (or decagonal) pyramidal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 24 May 2022.
  7. ^ 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)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 8 January 2023.
  8. ^ Sloane, N. J. A. (ed.). "Sequence A036063 (Increasing gaps among twin primes: size)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 8 January 2023.
  9. ^ a b "A003352 - Oeis".
  10. ^ Sloane, N. J. A. (ed.). "Sequence A061341 (A061341 Numbers not ending in 0 whose cubes are concatenations of other cubes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 8 January 2023.
  11. ^ "A003353 - Oeis".
  12. ^ Sloane, N. J. A. (ed.). "Sequence A034262 (n^3 + n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 24 May 2022.
  13. ^ a b Sloane, N. J. A. (ed.). "Sequence A020473 (Egyptian fractions: number of partitions of 1 into reciprocals of positive integers < n+1)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 24 May 2022.
  14. ^ "A046092 - Oeis".
  15. ^ a b c d e f g h i j k l m n o "Sloane's A005384 : Sophie Germain primes". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. from the original on 11 June 2016. Retrieved 12 June 2016.
  16. ^ a b c d e f g h i j "Sloane's A001844 : Centered square numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. from the original on 11 June 2016. Retrieved 12 June 2016.
  17. ^ Sloane, N. J. A. (ed.). "Sequence A000325 (2^n - n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 24 May 2022.
  18. ^ a b c d "Sloane's A000330 : Square pyramidal numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. from the original on 10 June 2016. Retrieved 12 June 2016.
  19. ^ a b c d e f g h "Sloane's A005282 : Mian-Chowla sequence". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. from the original on 17 May 2016. Retrieved 12 June 2016.
  20. ^ a b c d e f Sloane, N. J. A. (ed.). "Sequence A005897 (6*n^2 + 2 for n > 0)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  21. ^ "A316729 - Oeis".
  22. ^ Sloane, N. J. A. (ed.). "Sequence A006313 (Numbers n such that n^16 + 1 is prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 24 May 2022.
  23. ^ a b c d e f g h i j k l "Sloane's A005385 : Safe primes". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. from the original on 10 June 2016. Retrieved 12 June 2016.
  24. ^ Sloane, N. J. A. (ed.). "Sequence A034964 (Sums of five consecutive primes.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 1 November 2022.
  25. ^ Sloane, N. J. A. (ed.). "Sequence A000162 (Number of 3-dimensional polyominoes (or polycubes) with n cells.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 1 November 2022.
  26. ^ a b Sloane, N. J. A. (ed.). "Sequence A007053 (Number of primes < 2^n+1)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2 June 2022.
  27. ^ Sloane, N. J. A. (ed.). "Sequence A004023 (Indices of prime repunits: numbers n such that 11...111 (with n 1's)... is prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 25 February 2023.
  28. ^ "A004801 - Oeis".
  29. ^ a b c d e f g h "Sloane's A000217 : Triangular numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. from the original on 5 April 2016. Retrieved 12 June 2016.
  30. ^ a b c d e f g h i "Sloane's A000384 : Hexagonal numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. from the original on 17 April 2016. Retrieved 12 June 2016.
  31. ^ a b "A000124 - Oeis".
  32. ^ "A161328 - Oeis".
  33. ^ "A023036 - Oeis".
  34. ^ "A007522 - Oeis".
  35. ^ a b c d Sloane, N. J. A. (ed.). "Sequence A002865 (Number of partitions of n that do not contain 1 as a part)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2 June 2022.
  36. ^ a b "A000695 - Oeis".
  37. ^ "A003356 - Oeis".
  38. ^ a b "A003357 - Oeis".
  39. ^ "A036301 - Oeis".
  40. ^ "A000567 - Oeis".
  41. ^ "A000025 - Oeis".
  42. ^ "A336130 - Oeis".
  43. ^ "A073576 - Oeis".
  44. ^ a b c d e f g "Sloane's A100827 : Highly cototient numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. from the original on 10 June 2016. Retrieved 12 June 2016.
  45. ^ "Base converter | number conversion".
  46. ^ a b c d e Sloane, N. J. A. (ed.). "Sequence A015723 (Number of parts in all partitions of n into distinct parts)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  47. ^ a b c d e f g h i "Sloane's A005891 : Centered pentagonal numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. from the original on 10 June 2016. Retrieved 12 June 2016.
  48. ^ "A003365 - Oeis".
  49. ^ a b c d e f g h i j k Sloane, N. J. A. (ed.). "Sequence A045943 (Triangular matchstick numbers: 3*n*(n+1)/2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2 June 2022.
  50. ^ "A005448 - Oeis".
  51. ^ "A003368 - Oeis".
  52. ^ a b c d e f g h i j k l m "Sloane's A002378 : Oblong (or promic, pronic, or heteromecic) numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. from the original on 9 June 2016. Retrieved 12 June 2016.
  53. ^ "A002061 - Oeis".
  54. ^ "A003349 - Oeis".
  55. ^ a b c d Sloane, N. J. A. (ed.). "Sequence A001105 (2*n^2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  56. ^ "A003294 - Oeis".
  57. ^ a b c "A035137 - Oeis".
  58. ^ "A347565: Primes p such that A241014(A000720(p)) is +1 or -1". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Archived from the original on 25 March 2022. Retrieved 19 January 2022.
  59. ^ "A003325 - Oeis".
  60. ^ "A195162 - Oeis".
  61. ^ "A006532 - Oeis".
  62. ^ "A341450 - Oeis".
  63. ^ a b c Sloane, N. J. A. (ed.). "Sequence A006128 (Total number of parts in all partitions of n. Also, sum of largest parts of all partitions of n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  64. ^ a b "A006567 - Oeis".
  65. ^ a b "A003354 - Oeis".
  66. ^ a b c d e f g h "Sloane's A000566 : Heptagonal numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. from the original on 11 June 2016. Retrieved 12 June 2016.
  67. ^ a b c d e f g "Sloane's A069099 : Centered heptagonal numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. from the original on 9 June 2016. Retrieved 12 June 2016.
  68. ^ "A273873 - Oeis".
  69. ^ "A292457 - Oeis".
  70. ^ "A073592 - Oeis".
  71. ^ a b c d e f g h i j "Sloane's A000326 : Pentagonal numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. from the original on 10 June 2016. Retrieved 12 June 2016.
  72. ^ a b c "Sloane's A000931 : Padovan sequence". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. from the original on 10 June 2016. Retrieved 12 June 2016.
  73. ^ "A077043 - Oeis".
  74. ^ "A056107 - Oeis".
  75. ^ "A025147 - Oeis".
  76. ^ "Sloane's A006753 : Smith numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. from the original on 9 June 2016. Retrieved 12 June 2016.
  77. ^ "Sloane's A031157 : Numbers that are both lucky and prime". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. from the original on 4 March 2016. Retrieved 12 June 2016.
  78. ^ "A033996 - Oeis".
  79. ^ "A018900 - Oeis".
  80. ^ "A046308 - Oeis".
  81. ^ "Sloane's A001232 : Numbers n such that 9*n = (n written backwards)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. from the original on 17 October 2015. Retrieved 14 June 2016.
  82. ^ "A003350 - Oeis".
  83. ^ Wells, D. The Penguin Dictionary of Curious and Interesting Numbers London: Penguin Group. (1987): 163
  84. ^ a b c d e "Sloane's A003154 : Centered 12-gonal numbers. Also star numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. from the original on 11 June 2016. Retrieved 12 June 2016.
  85. ^ "A003355 - Oeis".
  86. ^ "A051682 - Oeis".
  87. ^ a b c Sloane, N. J. A. (ed.). "Sequence A323657 (Number of strict solid partitions of n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  88. ^ "A121029 - Oeis".
  89. ^ "A292449 - Oeis".
  90. ^ Sloane, N. J. A. (ed.). "Sequence A087188 (number of partitions of n into distinct squarefree parts)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  91. ^ a b c d e f g h i Sloane, N. J. A. (ed.). "Sequence A059993 (Pinwheel numbers: 2*n^2 + 6*n + 1)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  92. ^ a b c d e f g h i "Sloane's A006562 : Balanced primes". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.
  93. ^ a b "Sloane's A007629 : Repfigit (REPetitive FIbonacci-like diGIT) numbers (or Keith numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.
  94. ^ "Sloane's A002997 : Carmichael numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.
  95. ^ a b c d e "Sloane's A001107 : 10-gonal (or decagonal) numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.
  96. ^ a b Sloane, N. J. A. (ed.). "Sequence A001567 (Fermat pseudoprimes to base 2, also called Sarrus numbers or Poulet numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  97. ^ a b c Sloane, N. J. A. (ed.). "Sequence A051890 (2*(n^2 - n + 1))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  98. ^ Sloane, N. J. A. (ed.). "Sequence A319560 (Number of non-isomorphic strict T_0 multiset partitions of weight n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  99. ^ a b c Sloane, N. J. A. (ed.). "Sequence A028916 (Friedlander-Iwaniec primes: Primes of form a^2 + b^4)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  100. ^ Sloane, N. J. A. (ed.). "Sequence A057732 (Numbers k such that 2^k + 3 is prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  101. ^ a b Sloane, N. J. A. (ed.). "Sequence A046376 (Palindromes with exactly 2 palindromic prime factors (counted with multiplicity), and no other prime factors)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  102. ^ Sloane, N. J. A. (ed.). "Sequence A128455 (Numbers k such that 9^k - 2 is a prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  103. ^ a b c d e Sloane, N. J. A. (ed.). "Sequence A000009 (Expansion of Product_{m > 0} (1 + x^m); number of partitions of n into distinct parts; number of partitions of n into odd parts)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  104. ^ a b c d Sloane, N. J. A. (ed.). "Sequence A318949 (Number of ways to write n as an orderless product of orderless sums)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  105. ^ a b c d Sloane, N. J. A. (ed.). "Sequence A038499 (Number of partitions of n into a prime number of parts)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  106. ^ a b Sloane, N. J. A. (ed.). "Sequence A006748 (Number of diagonally symmetric polyominoes with n cells)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  107. ^ a b c d e Sloane, N. J. A. (ed.). "Sequence A210000 (Number of unimodular 2 X 2 matrices having all terms in {0,1,...,n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.}
  108. ^ Sloane, N. J. A. (ed.). "Sequence A033995 (Number of bipartite graphs with n nodes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  109. ^ a b c d e Sloane, N. J. A. (ed.). "Sequence A028387 (n + (n+1)^2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  110. ^ a b c d e "Sloane's A076980 : Leyland numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.
  111. ^ Sloane, N. J. A. (ed.). "Sequence A062801 (Number of 2 X 2 non-singular integer matrices with entries from {0,...,n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.}
  112. ^ a b c d e f Sloane, N. J. A. (ed.). "Sequence A000096 (n*(n+3)/2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  113. ^ a b c d e f g Sloane, N. J. A. (ed.). "Sequence A000328". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  114. ^ a b c Sloane, N. J. A. (ed.). "Sequence A001608 (Perrin sequence)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  115. ^ a b c d e f Sloane, N. J. A. (ed.). "Sequence A140091 (3*n*(n + 3)/2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  116. ^ Sloane, N. J. A. (ed.). "Sequence A005380". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  117. ^ Sloane, N. J. A. (ed.). "Sequence A051026 (Number of primitive subsequences of 1, 2, ..., n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  118. ^ a b c d e f g h i Sloane, N. J. A. (ed.). "Sequence A005448 (Centered triangular numbers: 3n(n-1)/2 + 1)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  119. ^ Sloane, N. J. A. (ed.). "Sequence A080040 (2*a(n-1) + 2*a(n-2) for n > 1)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  120. ^ Sloane, N. J. A. (ed.). "Sequence A264237 (Sum of values of vertices at level n of the hyperbolic Pascal pyramid)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  121. ^ a b Sloane, N. J. A. (ed.). "Sequence A033991 (n*(4*n-1))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  122. ^ "Sloane's A000292 : Tetrahedral numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.
  123. ^ a b c d e f Sloane, N. J. A. (ed.). "Sequence A208155 (7-Knödel numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  124. ^ a b c d e Sloane, N. J. A. (ed.). "Sequence A006315 (Numbers n such that n^32 + 1 is prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  125. ^ Sloane, N. J. A. (ed.). "Sequence A185982 (Triangle read by rows: number of set partitions of n elements with k connectors)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  126. ^ a b c d Sloane, N. J. A. (ed.). "Sequence A007534 (Even numbers that are not the sum of a pair of twin primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  127. ^ a b c d e Sloane, N. J. A. (ed.). "Sequence A050993 (5-Knödel numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  128. ^ Sloane, N. J. A. (ed.). "Sequence A006094 (Products of 2 successive primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  129. ^ Sloane, N. J. A. (ed.). "Sequence A046368 (Products of two palindromic primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  130. ^ "1150 (number)". The encyclopedia of numbers.
  131. ^ a b "Sloane's A000101 : Increasing gaps between primes (upper end)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 10 July 2016.
  132. ^ a b "Sloane's A097942 : Highly totient numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.
  133. ^ a b c d "Sloane's A080076 : Proth primes". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.
  134. ^ a b c d e f Sloane, N. J. A. (ed.). "Sequence A005893 (Number of points on surface of tetrahedron; coordination sequence for sodalite net (equals 2*n^2+2 for n > 0))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  135. ^ a b c d e f g h i j Sloane, N. J. A. (ed.). "Sequence n*(n+2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  136. ^ a b c "Sloane's A005900 : Octahedral numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.
  137. ^ "Sloane's A069125 : a(n) = (11*n^2 - 11*n + 2)/2". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.
  138. ^ "1157 (number)". The encyclopedia of numbers.
  139. ^ a b c d e Sloane, N. J. A. (ed.). "Sequence A005899 (Number of points on surface of octahedron)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  140. ^ a b Sloane, N. J. A. (ed.). "Sequence A001845 (Centered octahedral numbers (crystal ball sequence for cubic lattice))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2 June 2022.
  141. ^ a b c d e Sloane, N. J. A. (ed.). "Sequence A000567 (Octagonal numbers: n*(3*n-2). Also called star numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  142. ^ a b c d Sloane, N. J. A. (ed.). "Sequence A007491 (Smallest prime > n^2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  143. ^ Sloane, N. J. A. (ed.). "Sequence A055887 (Number of ordered partitions of partitions)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  144. ^ a b c Sloane, N. J. A. (ed.). "Sequence A002413 (Heptagonal (or 7-gonal) pyramidal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  145. ^ a b c d Sloane, N. J. A. (ed.). "Sequence A018805". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  146. ^ Sloane, N. J. A. (ed.). "Sequence A024816 (Antisigma(n): Sum of the numbers less than n that do not divide n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  147. ^ "A063776 - OEIS". oeis.org.
  148. ^ "A000256 - OEIS". oeis.org.
  149. ^ "1179 (number)". The encyclopedia of numbers.
  150. ^ "A000339 - OEIS". oeis.org.
  151. ^ "A271269 - OEIS". oeis.org.
  152. ^ "A000031 - OEIS". oeis.org.
  153. ^ Higgins, Peter (2008). Number Story: From Counting to Cryptography. New York: Copernicus. p. 61. ISBN 978-1-84800-000-1.
  154. ^ a b c d e Sloane, N. J. A. (ed.). "Sequence A051424 (Number of partitions of n into pairwise relatively prime parts)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  155. ^ a b "Sloane's A042978 : Stern primes". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.
  156. ^ "A121038 - OEIS". oeis.org.
  157. ^ a b Sloane, N. J. A. (ed.). "Sequence A005449 (Second pentagonal numbers: n*(3*n + 1)/2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  158. ^ a b c d e f Sloane, N. J. A. (ed.). "Sequence A002061 (Central polygonal numbers: n^2 - n + 1)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  159. ^ "A175654 - OEIS". oeis.org.
  160. ^ oeis.org/A062092
  161. ^ a b c d e f Sloane, N. J. A. (ed.). "Sequence A024916 (Sum_1^n sigma(k))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  162. ^ a b c d e >Sloane, N. J. A. (ed.). "Sequence A080663 (3*n^2 - 1)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  163. ^ Meehan, Eileen R., Why TV is not our fault: television programming, viewers, and who's really in control Lanham, MD: Rowman & Littlefield, 2005
  164. ^ "A265070 - OEIS". oeis.org.
  165. ^ "1204 (number)". The encyclopedia of numbers.
  166. ^ a b Sloane, N. J. A. (ed.). "Sequence A240574 (Number of partitions of n such that the number of odd parts is a part)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  167. ^ "A303815 - OEIS". oeis.org.
  168. ^ a b c d e f g h Sloane, N. J. A. (ed.). "Sequence A098237 (Composite de Polignac numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  169. ^ Sloane, N. J. A. (ed.). "Sequence A337070 (Number of strict chains of divisors starting with the superprimorial A006939(n))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  170. ^ Higgins, ibid.
  171. ^ Sloane, N. J. A. (ed.). "Sequence A000070 (Sum_{0..n} A000041(k))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  172. ^ a b c d e f g h i Sloane, N. J. A. (ed.). "Sequence A053767 (Sum of first n composite numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  173. ^ a b c d e f "Sloane's A001106 : 9-gonal (or enneagonal or nonagonal) numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.
  174. ^ a b Sloane, N. J. A. (ed.). "Sequence A006355 (Number of binary vectors of length n containing no singletons)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  175. ^ "Sloane's A001110 : Square triangular numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.
  176. ^ a b c d e "Sloane's A016754 : Odd squares: a(n) = (2n+1)^2. Also centered octagonal numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.
  177. ^ "A004111 - OEIS". oeis.org.
  178. ^ "A061262 - OEIS". oeis.org.
  179. ^ a b c 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)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  180. ^ "A006154 - OEIS". oeis.org.
  181. ^ "A000045 - OEIS". oeis.org.
  182. ^ a b c d e f g Sloane, N. J. A. (ed.). "Sequence A054735 (Sums of twin prime pairs)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  183. ^ "A160160 - OEIS". oeis.org.
  184. ^ "Sloane's A005898 : Centered cube numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.
  185. ^ Sloane, N. J. A. (ed.). "Sequence A126796 (Number of complete partitions of n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  186. ^ oeis.org/A305843
  187. ^ "A007690 - OEIS". oeis.org.
  188. ^ "Sloane's A033819 : Trimorphic numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.
  189. ^ a b c d Sloane, N. J. A. (ed.). "Sequence A058331 (2*n^2 + 1)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  190. ^ a b c Sloane, N. J. A. (ed.). "Sequence A144300 (Number of partitions of n minus number of divisors of n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  191. ^ Sloane, N. J. A. (ed.). "Sequence A000837 (Number of partitions of n into relatively prime parts. Also aperiodic partitions.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  192. ^ a b c Sloane, N. J. A. (ed.). "Sequence A000041 (a(n) is the number of partitions of n (the partition numbers))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  193. ^ a b "Sloane's A002182 : Highly composite numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.
  194. ^ a b c d e "Sloane's A014575 : Vampire numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.
  195. ^ a b c d e f g h i j Sloane, N. J. A. (ed.). "Sequence A014206 (n^2 + n + 2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  196. ^ a b Sloane, N. J. A. (ed.). "Sequence A070169 (Rounded total surface area of a regular tetrahedron with edge length n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  197. ^ a b c 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)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  198. ^ a b c Sloane, N. J. A. (ed.). "Sequence A023894 (Number of partitions of n into prime power parts)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  199. ^ a b c Sloane, N. J. A. (ed.). "Sequence A072895 (Least k for the Theodorus spiral to complete n revolutions)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  200. ^ Sloane, N. J. A. (ed.). "Sequence A100040 (2*n^2 + n - 5)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  201. ^ Sloane, N. J. A. (ed.). "Sequence A051349 (Sum of first n nonprimes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  202. ^ Sloane, N. J. A. (ed.). "Sequence A033286 (n * prime(n))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  203. ^ a b Sloane, N. J. A. (ed.). "Sequence A084849 (1 + n + 2*n^2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  204. ^ a b Sloane, N. J. A. (ed.). "Sequence A000930 (Narayana's cows sequence)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  205. ^ Sloane, N. J. A. (ed.). "Sequence A001792 ((n+2)*2^(n-1))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  206. ^ Sloane, N. J. A. (ed.). "Sequence A006958 (Number of parallelogram polyominoes with n cells (also called staircase polyominoes, although that term is overused))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  207. ^ 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)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  208. ^ Sloane, N. J. A. (ed.). "Sequence A007318 (Pascal's triangle read by rows)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  209. ^ Sloane, N. J. A. (ed.). "Sequence A014574 (Average of twin prime pairs)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  210. ^ Sloane, N. J. A. (ed.). "Sequence A173831 (Largest prime < n^4)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  211. ^ Sloane, N. J. A. (ed.). "Sequence A006872 (Numbers k such that phi(k) equals phi(sigma(k)))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  212. ^ Sloane, N. J. A. (ed.). "Sequence A014285 (Sum_{1..n} j*prime(j))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  213. ^ a b Sloane, N. J. A. (ed.). "Sequence A071400 (Rounded volume of a regular octahedron with edge length n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  214. ^ a b c d Sloane, N. J. A. (ed.). "Sequence A003114 (Number of partitions of n into parts 5k+1 or 5k+4)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  215. ^ a b c d e f Sloane, N. J. A. (ed.). "Sequence A033548 (Honaker primes: primes P(k) such that sum of digits of P(k) equals sum of digits of k)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  216. ^ Sloane, N. J. A. (ed.). "Sequence A000055 (Number of trees with n unlabeled nodes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  217. ^ "A124826 - OEIS". oeis.org.
  218. ^ "A142005 - OEIS". oeis.org.
  219. ^ a b Sloane, N. J. A. (ed.). "Sequence A338470 (Number of integer partitions of n with no part dividing all the others)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  220. ^ "A066186 - OEIS". oeis.org.
  221. ^ a b c d Sloane, N. J. A. (ed.). "Sequence A304716 (Number of integer partitions of n whose distinct parts are connected)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  222. ^ "A115073 - OEIS". oeis.org.
  223. ^ "A061256 - OEIS". oeis.org.
  224. ^ "A061954 - OEIS". oeis.org.
  225. ^ "A030299 - OEIS". oeis.org.
  226. ^ a b "Sloane's A002559 : Markoff (or Markov) numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.
  227. ^ a b Sloane, N. J. A. (ed.). "Sequence A005894 (Centered tetrahedral numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  228. ^ "A005064 - OEIS". oeis.org.
  229. ^ a b c d e f Sloane, N. J. A. (ed.). "Sequence A001770 (Numbers k such that 5*2^k - 1 is prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  230. ^ a b c d e Sloane, N. J. A. (ed.). "Sequence A144391 (3*n^2 + n - 1)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  231. ^ a b c d e f g 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)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  232. ^ a b Sloane, N. J. A. (ed.). "Sequence A056809 (Numbers k such that k, k+1 and k+2 are products of two primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  233. ^ "A316473 - OEIS". oeis.org.
  234. ^ "A000032 - OEIS". oeis.org.
  235. ^ "1348 (number)". The encyclopedia of numbers.
  236. ^ a b Sloane, N. J. A. (ed.). "Sequence A101624 (Stern-Jacobsthal number)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  237. ^ Sloane, N. J. A. (ed.). "Sequence A064228 (From Recamán's sequence (A005132): values of n achieving records in A057167)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  238. ^ 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)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  239. ^ Sloane, N. J. A. (ed.). "Sequence A064227 (From Recamán's sequence (A005132): record values in A057167)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  240. ^ a b c Sloane, N. J. A. (ed.). "Sequence A000603". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  241. ^ 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)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  242. ^ a b c d e Sloane, N. J. A. (ed.). "Sequence A330224 (Number of achiral integer partitions of n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  243. ^ Sloane, N. J. A. (ed.). "Sequence A001610 (a(n-1) + a(n-2) + 1)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  244. ^ Sloane, N. J. A. (ed.). "Sequence A000032 (Lucas numbers: L(n-1) + L(n-2))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  245. ^ a b "Sloane's A000332 : Binomial coefficient binomial(n,4) = n*(n-1)*(n-2)*(n-3)/24". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.
  246. ^ Sloane, N. J. A. (ed.). "Sequence A005578 (Arima sequence)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  247. ^ a b c Sloane, N. J. A. (ed.). "Sequence A001157 (sigma_2(n): sum of squares of divisors of n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  248. ^ a b Sloane, N. J. A. (ed.). "Sequence A007585 (10-gonal (or decagonal) pyramidal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  249. ^ a b c Sloane, N. J. A. (ed.). "Sequence A071395 (Primitive abundant numbers (abundant numbers all of whose proper divisors are deficient numbers))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  250. ^ a b Sloane, N. J. A. (ed.). "Sequence A005945 (Number of n-step mappings with 4 inputs)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  251. ^ "A001631 - OEIS". oeis.org. Retrieved 25 June 2023.
  252. ^ Sloane, N. J. A. (ed.). "Sequence A088274 (Numbers k such that 10^k + 7 is prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  253. ^ Sloane, N. J. A. (ed.). "Sequence A000111 (Euler or up/down numbers: e.g.f. sec(x) + tan(x))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  254. ^ Sloane, N. J. A. (ed.). "Sequence A002414 (Octagonal pyramidal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  255. ^ "Sloane's A001567 : Fermat pseudoprimes to base 2". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.
  256. ^ "Sloane's A050217 : Super-Poulet numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.
  257. ^ Sloane, N. J. A. (ed.). "Sequence A054552 (4*n^2 - 3*n + 1)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  258. ^ Sloane, N. J. A. (ed.). "Sequence A051349 (Sum of first n nonprimes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  259. ^ Sloane, N. J. A. (ed.). "Sequence A017919 (Powers of sqrt(5) rounded down)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
August 31, 2023
1000, number, thousand, chiliad, redirect, here, other, uses, 1000, disambiguation, military, unit, chiliarchy, 1000, thousand, natural, number, following, preceding, 1001, most, english, speaking, countries, written, with, without, comma, sometimes, period, s. 1 000 Thousand and Chiliad redirect here For other uses see 1000 disambiguation or for the military unit see Chiliarchy 1000 or one thousand is the natural number following 999 and preceding 1001 In most English speaking countries it can be written with or without a comma or sometimes a period separating the thousands digit 1 000 999 1000 1001 List of numbersIntegers 0 1k 2k 3k 4k 5k 6k 7k 8k 9k Cardinalone thousandOrdinal1000th one thousandth Factorization23 53Divisors1 2 4 5 8 10 20 25 40 50 100 125 200 250 500 1000Greek numeral A Roman numeralMRoman numeral unicode M m Unicode symbol s Greek prefixchiliaLatin prefixmilliBinary11111010002Ternary11010013Senary43446Octal17508Duodecimal6B412Hexadecimal3E816Tamil Chinese千Punjabi੧੦੦੦Look up thousand or 1000 in Wiktionary the free dictionary 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 Contents 1 Notation 2 Properties 3 Selected numbers in the range 1001 1999 3 1 1001 to 1099 3 2 1100 to 1199 3 3 1200 to 1299 3 4 1300 to 1399 3 5 1400 to 1499 3 6 1500 to 1599 3 7 1600 to 1699 3 8 1700 to 1799 3 9 1800 to 1899 3 10 1900 to 1999 3 11 Prime numbers 4 ReferencesNotation EditThe decimal representation for one thousand is 1000 a one followed by three zeros in the general notation 1 103 in engineering notation which for this number coincides with 1 103 exactly in scientific normalized exponential notation 1 E 3 exactly in scientific E notation The SI prefix for a thousand units is kilo abbreviated to k for instance a 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 EditThere are 168 prime numbers less than 1000 2 1000 is the 10th icositetragonal number or 24 gonal number 3 1000 has a reduced totient value of 100 and totient of 400 It is equal to the sum of Euler s totient function over the first 57 integers with 11 integers having a totient value of 1000 1000 is the smallest number that generates three primes in the fastest way possible by concatenation of decremented numbers 1 000 999 1 000 999 998 997 and 1 000 999 998 997 996 995 994 993 are all prime 4 The 1000th prime number is 7919 It is a difference of 1 from the order of the smallest sporadic group M 11 displaystyle mathrm M 11 7920 Selected numbers in the range 1001 1999 Edit1001 to 1099 Edit 1001 sphenic number 7 11 13 pentagonal number pentatope number 1002 sphenic number Mertens function zero abundant number number of partitions of 22 1003 the product of some prime p and the pth prime namely p 17 1004 heptanacci number 5 1005 Mertens function zero decagonal pyramidal number 6 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 7 record gap between twin primes 8 number that is the sum of 7 positive 5th powers 9 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 10 1007 number that is the sum of 8 positive 5th powers 11 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 12 Mertens function zero 1011 the largest n such that 2n contains 101 and doesn t contain 11011 Harshad number in bases 5 10 15 20 25 30 35 40 45 50 55 60 65 70 75 and 202 other bases number of partitions of 1 into reciprocals of positive integers lt 16 Egyptian fraction 13 1012 ternary number 3210 quadruple triangular number triangular number is 253 14 number of partitions of 1 into reciprocals of positive integers lt 17 Egyptian fraction 13 1013 Sophie Germain prime 15 centered square number 16 Mertens function zero 1014 210 10 17 Mertens function zero sum of the nontriangular numbers between successive triangular numbers 1015 square pyramidal number 18 1016 member of the Mian Chowla sequence 19 stella octangula number number of surface points on a cube with edge length 14 20 1017 generalized triacontagonal number 21 1018 Mertens function zero 101816 1 is prime 22 1019 Sophie Germain prime 15 safe prime 23 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 24 the number of three dimensional polycubes with 7 cells 25 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 lt 213 26 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 27 Sophie Germain prime 15 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 28 1035 triangular number 29 hexagonal number 30 1036 central polygonal number 31 1037 number in E toothpick sequence 32 1038 even integer that is an unordered sum of two primes in exactly n ways 33 1039 prime of the form 8n 7 34 number of partitions of 30 that do not contain 1 as a part 35 Chen prime 1040 45 42 sum of distinct powers of 4 36 The number of pieces that could be seen in a 6 6 6 6 Rubik s Tesseract 1041 sum of 11 positive 5th powers 37 1042 sum of 12 positive 5th powers 38 1043 number whose sum of even digits and sum of odd digits are even 39 1044 sum of distinct powers of 4 36 1045 octagonal number 40 1046 coefficient of f q 3rd order mock theta function 41 1047 number of ways to split a strict composition of n into contiguous subsequences that have the same sum 42 1048 number of partitions of n into squarefree parts 43 1049 Sophie Germain prime 15 highly cototient number 44 Chen prime 1050 10508 to decimal becomes a pronic number 55210 45 number of parts in all partitions of 29 into distinct parts 46 1051 centered pentagonal number 47 centered decagonal number 1052 number that is the sum of 9 positive 6th powers 48 1053 triangular matchstick number 49 1054 centered triangular number 50 1055 number that is the sum of 12 positive 6th powers 51 1056 pronic number 52 1057 central polygonal number 53 1058 number that is the sum of 4 positive 5th powers 54 area of a square with diagonal 46 55 1059 number n such that n4 is written in the form of a sum of four positive 4th powers 56 1060 sum of the first 25 primes 1061 emirp twin prime with 1063 1062 number that is not the sum of two palindromes 57 1063 super prime sum of seven consecutive primes 137 139 149 151 157 163 167 near wall sun sun prime 58 1064 sum of two positive cubes 59 1065 generalized duodecagonal 60 1066 number whose sum of their divisors is a square 61 1067 number of strict integer partitions of n in which are empty or have smallest part not dividing the other ones 62 1068 number that is the sum of 7 positive 5th powers 9 total number of parts in all partitions of 15 63 1069 emirp 64 1070 number that is the sum of 9 positive 5th powers 65 1071 heptagonal number 66 1072 centered heptagonal number 67 1073 number that is the sum of 12 positive 5th powers 38 1074 number that is not the sum of two palindromes 57 1075 number non sum of two palindromes 57 1076 number of strict trees weight n 68 1077 number where 7 outnumbers every other digit in the number 69 1078 Euler transform of negative integers 70 1079 every positive integer is the sum of at most 1079 tenth powers 1080 pentagonal number 71 1081 triangular number 29 member of Padovan sequence 72 1082 central polygonal number 31 1083 three quarter square 73 number of partitions of 53 into prime parts 1084 third spoke of a hexagonal spiral 74 108464 1 is prime 1085 number of partitions of n into distinct parts gt or 2 75 1086 Smith number 76 sum of totient function for first 59 integers 1087 super prime cousin prime lucky prime 77 1088 octo triangular number triangular number result being 136 78 sum of two distinct powers of 2 1024 64 79 number that is divisible by exactly seven primes with the inclusion of multiplicity 80 1089 332 nonagonal number centered octagonal number first natural number whose digits in its decimal representation get reversed when multiplied by 9 81 1090 sum of 5 positive 5th powers 82 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 83 twin prime with 1091 and star number 84 1094 sum of 9 positive 5th powers 65 109464 1 is prime 1095 sum of 10 positive 5th powers 85 number that is not the sum of two palindromes 1096 hendecagonal number 86 number of strict solid partitions of 18 87 1097 emirp 64 Chen prime 1098 multiple of 9 containing digit 9 in its base 10 representation 88 1099 number where 9 outnumbers every other digit 89 1100 to 1199 Edit 1100 number of partitions of 61 into distinct squarefree parts 90 1101 pinwheel number 91 1102 sum of totient function for first 60 integers 1103 Sophie Germain prime 15 balanced prime 92 1104 Keith number 93 1105 332 42 322 92 312 122 232 242 Carmichael number 94 magic constant of n n normal magic square and n queens problem for n 13 decagonal number 95 centered square number 16 Fermat pseudoprime 96 1106 number of regions into which the plane is divided when drawing 24 ellipses 97 1107 number of non isomorphic strict T0 multiset partitions of weight 8 98 1108 number k such that k64 1 is prime 1109 Friedlander Iwaniec prime 99 Chen prime 1110 k such that 2k 3 is prime 100 1111 11 101 palindrome that is a product of two palindromic primes 101 1112 k such that 9k 2 is a prime 102 1113 number of strict partions of 40 103 1114 number of ways to write 22 as an orderless product of orderless sums 104 1115 number of partitions of 27 into a prime number of parts 105 1116 divisible by the number of primes below it 1117 number of diagonally symmetric polyominoes with 16 cells 106 Chen prime 1118 number of unimodular 2 2 matrices having all terms in 0 1 21 107 1119 number of bipartite graphs with 9 nodes 108 1120 number k such that k64 1 is prime 1121 number of squares between 342 and 344 109 1122 pronic number 52 divisible by the number of primes below it 1123 balanced prime 92 1124 Leyland number 110 1125 Achilles number 1126 number of 2 2 non singular integer matrices with entries from 0 1 2 3 4 5 111 1127 maximal number of pieces that can be obtained by cutting an annulus with 46 cuts 112 1128 triangular number 29 hexagonal number 30 divisible by the number of primes below it 1129 number of lattice points inside a circle of radius 19 113 1130 skiponacci number 114 1131 number of edges in the hexagonal triangle T 26 115 1132 number of simple unlabeled graphs with 9 nodes of 2 colors whose components are complete graphs 116 1133 number of primitive subsequences of 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 117 1134 divisible by the number of primes below it triangular matchstick number 49 1135 centered triangular number 118 1136 number of independent vertex sets and vertex covers in the 7 sunlet graph 119 1137 sum of values of vertices at level 5 of the hyperbolic Pascal pyramid 120 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 121 1140 tetrahedral number 122 1141 7 Knodel number 123 1142 n such that n32 1 is prime 124 1143 number of set partitions of 8 elements with 2 connectors 125 1144 is not the sum of a pair of twin primes 126 1145 5 Knodel number 127 1146 is not the sum of a pair of twin primes 126 1147 31 37 a product of 2 successive primes 128 1148 is not the sum of a pair of twin primes 126 1149 a product of two palindromic primes 129 1150 number of 11 iamonds without bilateral symmetry 130 1151 first prime following a prime gap of 22 131 Chen prime 1152 highly totient number 132 3 smooth number 27 32 area of a square with diagonal 48 55 Achilles number 1153 super prime Proth prime 133 1154 2 242 2 number of points on surface of tetrahedron with edgelength 24 134 1155 number of edges in the join of two cycle graphs both of order 33 135 1156 342 octahedral number 136 centered pentagonal number 47 centered hendecagonal number 137 1157 smallest number that can be written as n 2 1 without any prime factors that can be written as a 2 1 138 1158 number of points on surface of octahedron with edgelength 17 139 1159 member of the Mian Chowla sequence 19 a centered octahedral number 140 1160 octagonal number 141 1161 sum of the first 26 primes 1162 pentagonal number 71 sum of totient function for first 61 integers 1163 smallest prime gt 342 142 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 143 1165 5 Knodel number 127 1166 heptagonal pyramidal number 144 1167 number of rational numbers which can be constructed from the set of integers between 1 and 43 145 1168 antisigma 49 146 1169 highly cototient number 44 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 147 1173 number of simple triangulation on a plane with 9 nodes 148 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 112 1176 triangular number 29 1177 heptagonal number 66 1178 number of surface points on a cube with edge length 15 20 1179 number of different permanents of binary 7 7 matrices 149 1180 smallest number of non integral partitions into non integral power gt 1000 150 1181 smallest k over 1000 such that 8 10 k 49 is prime 151 1182 number of necklaces possible with 14 beads of 2 colors that cannot be turned over 152 1183 pentagonal pyramidal number 1184 amicable number with 1210 153 1185 number of partitions of 45 into pairwise relatively prime parts 154 1186 number of diagonally symmetric polyominoes with 15 cells 106 number of partitions of 54 into prime parts 1187 safe prime 23 Stern prime 155 balanced prime 92 Chen prime 1188 first 4 digit multiple of 18 to contain 18 156 1189 number of squares between 352 and 354 109 1190 pronic number 52 number of cards to build an 28 tier house of cards 157 1191 352 35 1 H35 the 35th Hogben number 158 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 159 1195 smallest four digit number for which a 1 n is an integer is a n is 2 a n 1 1 n 160 1196 k 1 38 s k displaystyle sum k 1 38 sigma k 161 1197 pinwheel number 91 1198 centered heptagonal number 67 1199 area of the 20th conjoined trapezoid 162 1200 to 1299 Edit 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 163 number k such that k64 1 is prime 1201 centered square number 16 super prime centered decagonal number 1202 number of regions the plane is divided into by 25 ellipses 97 1203 first 4 digit number in the coordinating sequence for the 2 6 tiling of the hyperbolic plane 164 1204 magic constant of a 7 7 7 magic cube 165 1205 number of partitions of 28 such that the number of odd parts is a part 166 1206 29 gonal number 167 1207 composite de Polignac number 168 1208 number of strict chains of divisors starting with the superprimorial A006939 3 169 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 170 1211 composite de Polignac number 168 1212 k 0 17 p k displaystyle sum k 0 17 p k where p displaystyle p is the number of partions of k displaystyle k 171 1213 emirp 1214 sum of first 39 composite numbers 172 1215 number of edges in the hexagonal triangle T 27 115 1216 nonagonal number 173 1217 super prime Proth prime 133 1218 triangular matchstick number 49 1219 Mertens function zero centered triangular number 118 1220 Mertens function zero number of binary vectors of length 16 containing no singletons 174 1221 product of the first two digit and three digit repdigit 1222 hexagonal pyramidal number 1223 Sophie Germain prime 15 balanced prime 200th prime number 92 1224 number of edges in the join of two cycle graphs both of order 34 135 1225 352 square triangular number 175 hexagonal number 30 centered octagonal number 176 1226 number of rooted identity trees with 15 nodes 177 1227 smallest number representable as the sum of 3 triangular numbers in 27 ways 178 1228 sum of totient function for first 63 integers 1229 Sophie Germain prime 15 number of primes between 0 and 10000 emirp 1230 the Mahonian number T 9 6 179 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 180 1233 122 332 1234 number of parts in all partitions of 30 into distinct parts 46 smallest whole number containing all numbers from 1 to 4 1235 excluding duplicates contains the first four Fibbonacci numbers 181 1236 617 619 sum of twin prime pair 182 1237 prime of the form 2p 1 1238 number of partitions of 31 that do not contain 1 as a part 35 1239 toothpick number in 3D 183 1240 square pyramidal number 18 1241 centered cube number 184 1242 decagonal number 95 1243 composite de Polignac number 168 1244 number of complete partitions of 25 185 1245 Number of labeled spanning intersecting set systems on 5 vertices 186 1246 number of partitions of 38 such that no part occurs more than once 187 1247 pentagonal number 71 1248 the first four powers of 2 concatenated together 1249 emirp trimorphic number 188 1250 area of a square with diagonal 50 55 1251 2 252 1 number of different 2 2 determinants with integer entries from 0 to 25 189 1252 2 252 2 number of points on surface of tetrahedron with edgelength 25 134 1253 number of partitions of 23 with at least one distinct part 190 1254 number of partitions of 23 into relatively prime parts 191 1255 Mertens function zero number of ways to write 23 as an orderless product of orderless sums 104 number of partitions of 23 192 1256 Mertens function zero 1257 number of lattice points inside a circle of radius 20 113 1258 Mertens function zero 1259 highly cototient number 44 1260 highly composite number 193 pronic number 52 the smallest vampire number 194 sum of totient function for first 64 integers number of strict partions of 41 103 and appears twice in the Book of Revelation 1261 star number 84 Mertens function zero 1262 maximal number of regions the plane is divided into by drawing 36 circles 195 1263 rounded total surface area of a regular tetrahedron with edge length 27 196 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 197 1266 centered pentagonal number 47 Mertens function zero 1267 7 Knodel number 123 1268 number of partitions of 37 into prime power parts 198 1269 least number of triangles of the Spiral of Theodorus to complete 11 revolutions 199 1270 25 24 26 23 27 200 Mertens function zero 1271 sum of first 40 composite numbers 172 1272 sum of first 41 nonprimes 201 1273 19 67 19 prime 19 202 1274 sum of the nontriangular numbers between successive triangular numbers 1275 triangular number 29 sum of the first 50 natural numbers 1276 number of irredundant sets in the 25 cocktail party graph 203 1277 the start of a prime constellation of length 9 a prime nonuple 1278 number of Narayana s cows and calves after 20 years 204 1279 Mertens function zero Mersenne prime exponent 1280 Mertens function zero number of parts in all compositions of 9 205 1281 octagonal number 141 1282 Mertens function zero number of partitions of 46 into pairwise relatively prime parts 154 1283 safe prime 23 1284 641 643 sum of twin prime pair 182 1285 Mertens function zero number of free nonominoes number of parallelogram polyominoes with 10 cells 206 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 207 1287 13 5 displaystyle 13 choose 5 208 1288 heptagonal number 66 1289 Sophie Germain prime 15 Mertens function zero 1290 1289 1291 2 displaystyle frac 1289 1291 2 average of a twin prime pair 209 1291 largest prime lt 64 210 Mertens function zero 1292 number such that phi 1292 phi sigma 1292 211 Mertens function zero 1293 j 1 n j p r i m e j displaystyle sum j 1 n j times prime j 212 1294 rounded volume of a regular octahedron with edge length 14 213 1295 number of edges in the join of two cycle graphs both of order 35 135 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 91 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 214 1300 to 1399 Edit 1300 Sum of the first 4 fifth powers mertens function zero largest possible win margin in an NAQT match 1301 centered square number 16 Honaker prime 215 number of trees with 13 unlabeled nodes 216 1302 Mertens function zero number of edges in the hexagonal triangle T 28 115 1303 prime of form 21n 1 and 31n 1 217 218 1304 sum of 13046 and 1304 9 which is 328 976 1305 triangular matchstick number 49 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 118 1307 safe prime 23 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 219 1312 member of the Mian Chowla sequence 19 1313 sum of all parts of all partitions of 14 220 1314 number of integer partitions of 41 whose distinct parts are connected 221 1315 10 2n 1 7 10 n 1 is prime 222 1316 Euler transformation of sigma 11 223 1317 1317 Only odd four digit number to divide the concatenation of all number up to itself in base 25 224 1318 Mertens function zero 1319 safe prime 23 1320 659 661 sum of twin prime pair 182 1321 Friedlander Iwaniec prime 99 1322 area of the 21th conjoined trapezoid 162 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 225 1325 Markov number 226 centered tetrahedral number 227 1326 triangular number 29 hexagonal number 30 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 172 1330 tetrahedral number 110 forms a Ruth Aaron pair with 1331 under second definition 1331 113 centered heptagonal number 67 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 52 1333 372 37 1 H37 the 37th Hogben number 158 1334 maximal number of regions the plane is divided into by drawing 37 circles 195 1335 pentagonal number 71 Mertens function zero 1336 Mertens function zero 1337 Used in the novel form of spelling called leet Approximate melting point of gold in kelvins 1338 Mertens function zero 1339 First 4 digit number to appear twice in the sequence of sum of cubes of primes dividing n 228 1340 k such that 5 2k 1 is prime 229 1341 First mountain number with 2 jumps of more than one 1342 k 1 40 s k displaystyle sum k 1 40 sigma k 161 Mertens function zero 1343 cropped hexagone 230 1344 372 52 the only way to express 1344 as a difference of prime squares 231 1345 k such that k k 1 and k 2 are products of two primes 232 1346 number of locally disjointed rooted trees with 10 nodes 233 1347 concatenation of first 4 Lucas numbers 234 1348 number of ways to stack 22 pennies such that every penny is in a stack of one or two 235 1349 Stern Jacobsthal number 236 1350 nonagonal number 173 1351 number of partitions of 28 into a prime number of parts 105 1352 number of surface points on a cube with edge length 16 20 Achilles number 1353 2 262 1 number of different 2 2 determinants with integer entries from 0 to 26 189 1354 2 262 2 number of points on surface of tetrahedron with edgelength 26 134 1355 appears for the first time in the Recaman s sequence at n 325 374 625 245 237 Or in other words A057167 1355 325 374 625 245 238 239 1356 is not the sum of a pair of twin primes 126 1357 number of nonnegative solutions to x2 y2 412 240 1358 rounded total surface area of a regular tetrahedron with edge length 28 196 1359 is the 42d term of Flavius Josephus s sieve 241 1360 372 32 the only way to express 1360 as a difference of prime squares 231 1361 first prime following a prime gap of 34 131 centered decagonal number Honaker prime 215 1362 number of achiral integer partitions of 48 242 1363 the number of ways to modify a circular arrangement of 14 objects by swapping one or more adjacent pairs 243 1364 Lucas number 244 1365 pentatope number 245 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 246 1367 safe prime 23 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 92 1368 number of edges in the join of two cycle graphs both of order 36 135 1369 372 centered octagonal number 176 1370 s2 37 sum of squares of divisors of 37 247 1371 sum of the first 28 primes 1372 Achilles number 1373 number of lattice points inside a circle of radius 21 113 1374 number of unimodular 2 2 matrices having all terms in 0 1 23 107 1375 decagonal pyramidal number 248 1376 primitive abundant number abundant number all of whose proper divisors are deficient numbers 249 1377 maximal number of pieces that can be obtained by cutting an annulus with 51 cuts 112 1378 triangular number 29 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 250 1381 centered pentagonal number 47 Mertens function zero 1382 first 4 digit tetrachi number 251 1383 3 461 101383 7 is prime 252 1384 k 1 41 s k displaystyle sum k 1 41 sigma k 161 1385 up down number 253 1386 octagonal pyramidal number 254 1387 5th Fermat pseudoprime of base 2 255 22nd centered hexagonal number and the 19th decagonal number 95 second Super Poulet number 256 1388 4 192 3 19 1 and is therfore on the x axis of Ulams spiral 257 1389 sum of first 42 composite numbers 172 1390 sum of first 43 nonprimes 258 1391 number of rational numbers which can be constructed from the set of integers between 1 and 47 145 1392 number of edges in the hexagonal triangle T 29 115 1393 7 Knodel number 123 1394 sum of totient function for first 67 integers 1395 vampire number 194 member of the Mian Chowla sequence 19 triangular matchstick number 49 1396 centered triangular number 118 1397 5 9 2 displaystyle left lfloor 5 frac 9 2 right rfloor 259 1398 number of integer partitions of 40 whose distinct parts are connected 221 1399 emirp 260 1400 to 1499 Edit 1400 number of sum free subsets of 1 15 261 1401 pinwheel number 91 1402 number of integer partitions of 48 whose augmented differences are distinct 262 1403 smallest x such that M x 11 where M is Mertens function 263 1404 heptagonal number 66 1405 262 272 72 82 162 centered square number 16 1406 pronic number 52 semi meandric number 264 1407 382 38 1 H38 the 38th Hogben number 158 1408 maximal number of regions the plane is divided into by drawing 38 circles 195 1409 super prime Sophie Germain prime 15 smallest number whose eighth power is the sum of 8 eighth powers Proth prime 133 1410 denominator of the 46th Bernoulli number 265 1411 LS 41 266 1412 LS 42 267 1413 LS 43 268 1414 smallest composite that when added to sum of prime factors reaches a prime after 27 iterations 269 1415 the Mahonian number T 8 8 179 1416 LS 46 270 1417 number of partitions of 32 in which the number of parts divides 32 271 1418 smallest x such that M x 13 where M is Mertens function 272 1419 Zeisel number 273 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 274 1422 number of partitions of 15 with two parts marked 275 1423 200 1223 and the 200th prime is 1223 276 Also Used as a Hate symbol 1424 number of nonnegative solutions to x2 y2 422 240 1425 self descriptive number in base 5 1426 sum of totient function for first 68 integers pentagonal number 71 number of strict partions of 42 103 1427 twin prime together with 1429 277 1428 number of complete ternary trees with 6 internal nodes or 18 edges 278 1429 number of partitions of 53 such that the smallest part is greater than or equal to number of parts 214 1430 Catalan number 279 1431 triangular number 29 hexagonal number 30 1432 member of Padovan sequence 72 1433 super prime Honaker prime 215 typical port used for remote connections to Microsoft SQL Server databases 1434 rounded volume of a regular tetrahedron with edge length 23 280 1435 vampire number 194 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 281 1437 smallest number of complexity 20 smallest number requiring 20 1 s to build using and 282 1438 k such that 5 2k 1 is prime 229 1439 Sophie Germain prime 15 safe prime 23 1440 a highly totient number 132 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 84 1442 number of parts in all partitions of 31 into distinct parts 46 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 135 1444 382 smallest pandigital number in Roman numerals 1445 k 0 3 3 k 3 k k 2 displaystyle sum k 0 3 left binom 3 k times binom 3 k k right 2 283 1446 number of points on surface of octahedron with edgelength 19 139 1447 super prime happy number 1448 number k such that phi prime k is a square 284 1449 Stella octangula number 1450 s2 34 sum of squares of divisors of 34 247 1451 Sophie Germain prime 15 1452 first Zagreb index of the complete graph K12 285 1453 Sexy prime with 1459 1454 3 222 2 number of points on surface of square pyramid of side length 22 286 1455 k such that geometric mean of phi k and sigma k is an integer 287 1456 number of regions in regular 15 gon with all diagonals drawn 288 1457 2 272 1 a twin square 289 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 198 1462 35 1 35 8 the first Zagreb index of the wheel graph with 35 vertices 290 1463 total number of parts in all partitions of 16 63 1464 rounded total surface area of a regular icosahedron with edge length 13 291 1465 5 Knodel number 127 1466 k 1 256 d k displaystyle sum k 1 256 d k where d k displaystyle d k number of divisors of k displaystyle k 292 1467 number of partitions of 39 with zero crank 293 1468 number of polyhexes with 11 cells that tile the plane by translation 294 1469 octahedral number 136 highly cototient number 44 1470 pentagonal pyramidal number 295 sum of totient function for first 69 integers 1471 super prime centered heptagonal number 67 1472 number of overpartitions of 15 296 1473 cropped hexagone 230 1474 44 44 1 2 44 2 4 displaystyle frac 44 44 1 2 frac 44 2 4 triangular number plus quarter square i e A000217 44 A002620 44 297 1475 number of partitions of 33 into parts each of which is used a different number of times 298 1476 coreful perfect number 299 1477 7 Knodel number 123 1478 total number of largest parts in all compositions of 11 300 1479 number of planar partitions of 12 301 1480 sum of the first 29 primes 1481 Sophie Germain prime 15 1482 pronic number 52 number of unimodal compositions of 15 where the maximal part appears once 302 1483 392 39 1 H39 the 39th Hogben number 158 1484 maximal number of regions the plane is divided into by drawing 39 circles 195 1485 triangular number 1486 number of strict solid partitions of 19 87 1487 safe prime 23 1488 triangular matchstick number 49 1489 centered triangular number 118 1490 tetranacci number 303 1491 nonagonal number 173 Mertens function zero 1492 discriminant of a totally real cubic field 304 Mertens function zero 1493 Stern prime 155 1494 sum of totient function for first 70 integers 1495 9 305 1496 square pyramidal number 18 1497 skiponacci number 114 1498 number of flat partitions of 41 306 1499 Sophie Germain prime 15 super prime1500 to 1599 Edit 1500 hypotenuse in three different Pythagorean triangles 307 1501 centered pentagonal number 47 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 308 1503 least number of triangles of the Spiral of Theodorus to complete 12 revolutions 199 1504 primitive abundant number abundant number all of whose proper divisors are deficient numbers 249 1505 number of integer partitions of 41 with distinct differences between successive parts 309 1506 number of Golomb partitions of 28 310 1507 number of partitions of 32 that do not contain 1 as a part 35 1508 heptagonal pyramidal number 144 1509 pinwheel number 91 1510 deficient number odious number 1511 Sophie Germain prime 15 balanced prime 92 1512 k such that geometric mean of phi k and sigma k is an integer 287 1513 centered square number 16 1514 sum of first 44 composite numbers 172 1515 maximum dimension of Euclidean spaces which suffice for every smooth compact Riemannian 30 manifold to be realizable as a sub manifold 311 1516 9 10 3 displaystyle left lfloor 9 frac 10 3 right rfloor 312 1517 number of lattice points inside a circle of radius 22 113 1518 Mertens function zero 1519 Mertens function zero 1520 pentagonal number 71 Mertens function zero forms a Ruth Aaron pair with 1521 under second definition 1521 392 Mertens function zero centered octagonal number 176 forms a Ruth Aaron pair with 1520 under second definition 1522 k such that 5 2k 1 is prime 229 1523 super prime Mertens function zero safe prime 23 member of the Mian Chowla sequence 19 1524 Mertens function zero k such that geometric mean of phi k and sigma k is an integer 287 1525 heptagonal number 66 Mertens function zero 1526 number of conjugacy classes in the alternating group A27 313 1527 Mertens function zero 1528 Mertens function zero rounded total surface area of a regular octahedron with edge length 21 314 1529 composite de Polignac number 168 1530 vampire number 194 1531 prime number centered decagonal number Mertens function zero 1532 Mertens function zero 1533 21 73 21 21st prime 315 1534 number of achiral integer partitions of 50 242 1535 Thabit number 1536 a common size of microplate 3 smooth number 29 3 number of threshold functions of exactly 4 variables 316 1537 Keith number 93 Mertens function zero 1538 number of surface points on a cube with edge length 17 20 1539 maximal number of pieces that can be obtained by cutting an annulus with 54 cuts 112 1540 triangular number hexagonal number 30 decagonal number 95 tetrahedral number 110 1541 octagonal number 141 1542 k such that 2 k starts with k 317 1543 Mertens function zero 1544 Mertens function zero number of partitions of integer partitions of 17 where all parts have the same length 318 1545 number of reversible string structures with 9 beads using exactly three different colors 319 1546 Mertens function zero 1547 hexagonal pyramidal number 1548 coreful perfect number 299 1549 de Polignac prime 320 1550 31 3 31 7 2 displaystyle frac 31 times 3 times 31 7 2 number of cards needed to build a 31 tier house of cards with a flat one card wide roof 321 1551 6920 5369 A169952 24 A169952 23 A169942 24 number of Golomb rulers of length 24 322 323 1552 Number of partitions of 57 into prime parts 1553 509 521 523 a prime that is the sum of three consecutive primes 324 1554 2 3 7 37 product of four distinct primes 325 15552 divides 61554 326 1556 sum of the squares of the first nine primes 1557 number of graphs with 8 nodes and 13 edges 327 1558 number k such that k64 1 is prime 1559 Sophie Germain prime 15 1560 pronic number 52 1561 a centered octahedral number 140 number of series reduced trees with 19 nodes 328 1562 maximal number of regions the plane is divided into by drawing 40 circles 195 1563 k 1 50 50 gcd 50 k displaystyle sum k 1 50 frac 50 gcd 50 k 329 1564 sum of totient function for first 71 integers 1565 1036 2 1173 2 displaystyle sqrt 1036 2 1173 2 and 1036 1173 47 2 displaystyle 1036 1173 47 2 330 1566 number k such that k64 1 is prime 1567 number of partitions of 24 with at least one distinct part 190 1568 Achilles number 331 1569 2 282 1 number of different 2 2 determinants with integer entries from 0 to 28 189 1570 2 282 2 number of points on surface of tetrahedron with edgelength 28 134 1571 Honaker prime 215 1572 member of the Mian Chowla sequence 19 1573 discriminant of a totally real cubic field 332 1574256 1 is prime 333 1575 odd abundant number 334 sum of the nontriangular numbers between successive triangular numbers number of partitions of 24 192 157614 1 mod 15 2 335 1577 sum of the quadratic residues of 83 336 1578 sum of first 45 composite numbers 172 1579 number of partitions of 54 such that the smallest part is greater than or equal to number of parts 214 1580 number of achiral integer partitions of 51 242 1581 number of edges in the hexagonal triangle T 31 115 1582 a number such that the integer triangle A070080 1582 A070081 1582 A070082 1582 has an integer area 337 1583 Sophie Germain prime 1584 triangular matchstick number 49 1585 Riordan number centered triangular number 118 1586 area of the 23th conjoined trapezoid 162 1587 3 232 number of edges of a complete tripartite graph of order 69 K23 23 23 338 1588 sum of totient function for first 72 integers 1589 composite de Polignac number 168 1590 rounded volume of a regular icosahedron with edge length 9 339 1591 rounded volume of a regular octahedron with edge length 15 213 1592 sum of all divisors of the first 36 odd numbers 340 1593 sum of the first 30 primes 1594 minimal cost of maximum height Huffman tree of size 17 341 1595 number of non isomorphic set systems of weight 10 1596 triangular number 1597 Fibonacci prime 342 Markov prime 226 super prime emirp 1598 number of unimodular 2 2 matrices having all terms in 0 1 25 107 1599 number of edges in the join of two cycle graphs both of order 39 135 1600 to 1699 Edit 1600 402 structured great rhombicosidodecahedral number 343 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 133 the novel 1601 Mark Twain 1602 number of points on surface of octahedron with edgelength 20 139 1603 number of partitions of 27 with nonnegative rank 344 1604 number of compositions of 22 into prime parts 345 1605 number of polyominoes consisting of 7 regular octagons 346 1606 enneagonal pyramidal number 347 1607 member of prime triple with 1609 and 1613 348 1608 k 1 44 s k displaystyle sum k 1 44 sigma k 161 1609 cropped hexagonal number 230 1610 number of strict partions of 43 103 1611 number of rational numbers which can be constructed from the set of integers between 1 and 51 145 1612 maximum dimension of Euclidean spaces which suffice for every smooth compact Riemannian 31 manifold to be realizable as a sub manifold 349 1613 1607 and 1619 are all primes 350 1614 number of ways of refining the partition 8 1 to get 1 8 351 1615 composite number such that the square mean of its prime factors is a nonprime integer 352 1616 16 16 2 3 16 1 3 displaystyle frac 16 16 2 3 times 16 1 3 number of monotonic triples x y z in 1 2 16 3 353 1617 pentagonal number 71 1618 centered heptagonal number 67 1619 palindromic prime in binary safe prime 23 1620 809 811 sum of twin prime pair 182 1621 super prime pinwheel number 91 1622 semiprime of the form prime 1 354 1623 is not the sum of two triangular numbers and a fourth power 355 1624 number of squares in the Aztec diamond of order 28 356 1625 centered square number 16 1626 centered pentagonal number 47 1627 prime and 2 1627 1 3253 is also prime 357 1628 centered pentagonal number 47 1629 rounded volume of a regular tetrahedron with edge length 24 280 1630 number k such that k 64 1 is prime 1631 k 0 5 k 1 5 k displaystyle sum k 0 5 k 1 binom 5 k 358 1632 number of acute triangles made from the vertices of a regular 18 polygon 359 1633 star number 84 1634 Narcissistic number in base 10 1635 number of partitions of 56 whose reciprocal sum is an integer 360 1636 number of nonnegative solutions to x2 y2 452 240 1637 prime island least prime whose adjacent primes are exactly 30 apart 361 1638 harmonic divisor number 362 5 21638 1 is prime 229 1639 nonagonal number 173 1640 pronic number 52 1641 412 41 1 H41 the 41st Hogben number 158 1642 maximal number of regions the plane is divided into by drawing 41 circles 195 1643 sum of first 46 composite numbers 172 1644 821 823 sum of twin prime pair 182 1645 number of 16 celled pseudo still lifes in Conway s Game of Life up to rotation and reflection 363 1646 number of graphs with 8 nodes and 14 edges 327 1647 and 1648 are both divisible by cubes 364 1648 number of partitions of 343 into distinct cubes 365 1649 highly cototient number 44 Leyland number 110 1650 number of cards to build an 33 tier house of cards 157 1651 heptagonal number 66 1652 number of partitions of 29 into a prime number of parts 105 1653 triangular number hexagonal number 30 number of lattice points inside a circle of radius 23 113 1654 number of partitions of 42 into divisors of 42 366 1655 rounded volume of a regular dodecahedron with edge length 6 367 1656 827 829 sum of twin prime pair 182 1657 cuban prime 368 prime of the form 2p 1 1658 smallest composite that when added to sum of prime factors reaches a prime after 25 iterations 269 1659 number of rational numbers which can be constructed from the set of integers between 1 and 52 145 1660 sum of totient function for first 73 integers 1661 11 151 palindrome that is a product of two palindromic primes 101 1662 number of partitions of 49 into pairwise relatively prime parts 154 1663 a prime number and 51663 41663 is a 1163 digit prime number 369 1664 k such that k k 1 and k 2 are sums of 2 squares 370 1665 centered tetrahedral number 227 1666 largest efficient pandigital number in Roman numerals each symbol occurs exactly once 1667 228 1439 and the 228th prime is 1439 276 1668 number of partitions of 33 into parts all relatively prime to 33 371 1669 super prime smallest prime with a gap of exactly 24 to the next prime 372 1670 number of compositions of 12 such that at least two adjacent parts are equal 373 1671 divides the sum of the first 1671 composite numbers 374 1672 412 22 the only way to express 1672 as a difference of prime squares 231 1673 RMS number 375 1674 k such that geometric mean of phi k and sigma k is an integer 287 1675 Kin number 376 1676 number of partitions of 34 into parts each of which is used a different number of times 377 1677 412 32 the only way to express 1677 as a difference of prime squares 231 1678 n such that n32 1 is prime 124 1679 highly cototient number 44 semiprime 23 73 see also Arecibo message number of parts in all partitions of 32 into distinct parts 46 1680 highly composite number 193 number of edges in the join of two cycle graphs both of order 40 135 1681 412 smallest number yielded by the formula n2 n 41 that is not a prime centered octagonal number 176 1682 and 1683 is a member of a Ruth Aaron pair first definition 1683 triangular matchstick number 49 1684 centered triangular number 118 1685 5 Knodel number 127 1686 k 1 45 s k displaystyle sum k 1 45 sigma k 161 1687 7 Knodel number 123 1688 number of finite connected sets of positive integers greater than one with least common multiple 72 378 1689 9 k 0 4 1 2 k 1 displaystyle 9 sum k 0 4 frac 1 2k 1 379 1690 number of compositions of 14 into powers of 2 380 1691 the same upside down which makes it a strobogrammatic number 381 1692 coreful perfect number 299 1693 smallest prime gt 412 142 1694 number of unimodular 2 2 matrices having all terms in 0 1 26 107 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 99 1698 number of rooted trees with 47 vertices in which vertices at the same level have the same degree 197 1699 number of rooted trees with 48 vertices in which vertices at the same level have the same degree 197 1700 to 1799 Edit 1700 s2 39 sum of squares of divisors of 39 247 1701 8 4 displaystyle left 8 atop 4 right decagonal number hull number of the U S S Enterprise on Star Trek 1702 palindromic in 3 consecutive bases 89814 78715 6A616 1703 1703131131 1000077 and the divisors of 1703 are 1703 131 13 and 1 382 1704 sum of the squares of the parts in the partitions of 18 into two distinct parts 383 1705 tribonacci number 384 1706 1 4 16 64 256 1024 256 64 16 4 1 sum of fifth row of triangle of powers of 4 385 1707 number of partitions of 30 in which the number of parts divides 30 271 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 386 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 112 1711 triangular number centered decagonal number 1712 number of irredundant sets in the 29 cocktail party graph 203 1713 number of aperiodic rooted trees with 12 nodes 387 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 388 1715 k such that geometric mean of phi k and sigma k is an integer 287 1716 857 859 sum of twin prime pair 182 1717 pentagonal number 71 1718 d 12 12 d displaystyle sum d 12 binom 12 d 389 1719 composite de Polignac number 168 1720 sum of the first 31 primes 1721 twin prime number of squares between 422 and 424 109 1722 Giuga number 390 pronic number 52 1723 super prime 1724 maximal number of regions the plane is divided into by drawing 42 circles 195 1725 472 222 prime 15 2 nonprime 15 2 391 1726 number of partitions of 44 into distinct and relatively prime parts 392 1727 area of the 24th conjoined trapezoid 162 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 286 1731 k such that geometric mean of phi k and sigma k is an integer 287 1732 k 0 5 5 k k displaystyle sum k 0 5 binom 5 k k 393 1733 Sophie Germain prime palindromic in bases 3 18 19 1734 surface area of a cube of edge length 17 394 1735 number of partitions of 55 such that the smallest part is greater than or equal to number of parts 214 1736 sum of totient function for first 75 integers number of surface points on a cube with edge length 18 20 1737 pinwheel number 91 1738 number of achiral integer partitions of 52 242 1739 number of 1s in all partitions of 30 into odd parts 395 1740 number of squares in the Aztec diamond of order 29 356 1741 super prime centered square number 16 1742 number of regions the plane is divided into by 30 ellipses 97 1743 wiener index of the windmill graph D 3 21 121 1744 k such that k k 1 and k 2 are sums of 2 squares 370 1745 5 Knodel number 127 1746 number of unit distance graphs on 8 nodes 396 1747 balanced prime 92 1748 number of partitions of 55 into distinct parts in which the number of parts divides 55 397 1749 number of integer partitions of 33 with no part dividing all the others 219 1750 hypotenuse in three different Pythagorean triangles 307 1751 cropped hexagone 230 1752 792 672 the only way to express 1752 as a difference of prime squares 231 1753 balanced prime 92 1754 k such that 5 2k 1 is prime 229 1755 number of integer partitions of 50 whose augmented differences are distinct 262 1756 centered pentagonal number 47 1757 least number of triangles of the Spiral of Theodorus to complete 13 revolutions 199 1758 k 1 46 s k displaystyle sum k 1 46 sigma k 161 1759 de Polignac prime 320 1760 the number of yards in a mile 1761 k such that k k 1 and k 2 are products of two primes 232 1762 number of binary sequences of length 12 and curling number 2 398 1763 number of edges in the join of two cycle graphs both of order 41 135 1764 422 1765 number of stacks or planar partitions of 15 399 1766 number of points on surface of octahedron with edgelength 21 139 1767 s 282 s 352 400 1768 number of nonequivalent dissections of an hendecagon into 8 polygons by nonintersecting diagonals up to rotation 401 1769 maximal number of pieces that can be obtained by cutting an annulus with 58 cuts 112 1770 triangular number hexagonal number 30 Seventeen Seventy town in Australia 1771 tetrahedral number 110 1772 centered heptagonal number 67 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 402 1774 number of rooted identity trees with 15 nodes and 5 leaves 403 1775 1 i 10 p r i m e i 2 i 1 displaystyle sum 1 leq i leq 10 prime i cdot 2 cdot i 1 sum of piles of first 10 primes 404 1776 square star number 405 The number of pieces that could be seen in a 7 7 7 7 Rubik s Tesseract 1777 smallest prime gt 422 142 1778 least k gt 1 such that the remainder when 6k is divided by k is 22 406 1779 number of achiral integer partitions of 53 242 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 407 1781 the first 1781 digits of e form a prime 408 1782 heptagonal number 66 1783 de Polignac prime 320 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 409 1785 square pyramidal number 18 triangular matchstick number 49 1786 centered triangular number 118 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 410 1789 number of wiggly sums adding to 17 terms alternately increase and decrease or vice versa 411 1790 number of partitions of 50 into pairwise relatively prime parts 154 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 113 1794 nonagonal number 173 number of partitions of 33 that do not contain 1 as a part 35 1795 number of heptagons with perimeter 38 412 1796 k such that geometric mean of phi k and sigma k is an integer 287 1797 number k such that phi prime k is a square 284 1798 2 29 31 102 111012 111112 which yield zero when the prime factors are xored together 413 1799 2 302 1 a twin square 289 1800 to 1899 Edit 1800 pentagonal pyramidal number 295 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 368 1802 2 302 2 number of points on surface of tetrahedron with edgelength 30 134 number of partitions of 30 such that the number of odd parts is a part 166 1803 number of decahexes that tile the plane isohedrally but not by translation or by 180 degree rotation Conway criterion 414 1804 number k such that k 64 1 is prime 1805 number of squares between 432 and 434 109 1806 pronic number 52 product of first four terms of Sylvester s sequence primary pseudoperfect number 415 only number for which n equals the denominator of the nth Bernoulli number 416 Schroder number 417 1807 fifth term of Sylvester s sequence 418 1808 maximal number of regions the plane is divided into by drawing 43 circles 195 1809 sum of first 17 super primes 419 1810 k 0 4 4 k 4 displaystyle sum k 0 4 binom 4 k 4 420 1811 Sophie Germain prime 1812 n such that n32 1 is prime 124 1813 number of polyominoes with 26 cells symmetric about two orthogonal axes 421 1814 1 6 36 216 1296 216 36 6 1 sum of 4th row of triangle of powers of six 422 1815 polygonal chain number P 2 1 3 displaystyle P 2 1 3 423 1816 number of strict partions of 44 103 1817 total number of prime parts in all partitions of 20 424 1818 n such that n32 1 is prime 124 1819 sum of the first 32 primes minus 32 425 1820 pentagonal number 71 pentatope number 245 number of compositions of 13 whose run lengths are either weakly increasing or weakly decreasing 426 1821 member of the Mian Chowla sequence 19 1822 number of integer partitions of 43 whose distinct parts are connected 221 1823 super prime safe prime 23 1824 432 52 the only way to express 1824 as a difference of prime squares 231 1825 octagonal number 141 1826 decagonal pyramidal number 248 1827 vampire number 194 1828 meandric number open meandric number appears twice in the first 10 decimal digits of e 1829 composite de Polignac number 168 1830 triangular number 1831 smallest prime with a gap of exactly 16 to next prime 1847 427 1832 sum of totient function for first 77 integers 1833 number of atoms in a decahedron with 13 shells 428 1834 octahedral number 136 sum of the cubes of the first five primes 1835 absolute value of numerator of D 6 5 displaystyle D 6 5 429 1836 factor by which a proton is more massive than an electron 1837 star number 84 1838 number of unimodular 2 2 matrices having all terms in 0 1 27 107 1839 13 3 displaystyle lfloor sqrt 3 13 rfloor 430 1840 432 32 the only way to express 1840 as a difference of prime squares 231 1841 Mertens function zero 1842 number of unlabeled rooted trees with 11 nodes 431 1843 Mertens function zero 1844 Mertens function zero 1845 Mertens function zero 1846 sum of first 49 composite numbers 172 1847 super prime 1848 number of edges in the join of two cycle graphs both of order 42 135 1849 432 palindromic in base 6 123216 centered octagonal number 176 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 432 1853 Mertens function zero 1854 Mertens function zero 1855 rencontres number number of permutations of 7 with exactly one fixed point 433 1856 sum of totient function for first 78 integers 1857 Mertens function zero pinwheel number 91 1858 number of 14 carbon alkanes C14H30 ignoring stereoisomers 434 1859 composite de Polignac number 168 1860 number of squares in the Aztec diamond of order 30 435 1861 centered square number 16 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 1864 2 2 displaystyle frac 1864 2 2 is a prime 436 1865 123456 Largest senary metadrome number with digits in strict ascending order in base 6 437 1866 Mertens function zero number of plane partitions of 16 with at most two rows 438 1867 prime de Polignac number 320 1868 smallest number of complexity 21 smallest number requiring 21 1 s to build using and 282 1869 Hultman number SH 7 4 439 1870 decagonal number 95 1871 the first prime of the 2 consecutive twin prime pairs 1871 1873 and 1877 1879 440 1872 first Zagreb index of the complete graph K13 285 1873 number of Narayana s cows and calves after 21 years 204 1874 area of the 25th conjoined trapezoid 162 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 441 1878 n such that n32 1 is prime 124 1879 a prime with square index 442 1880 the 10th element of the self convolution of Lucas numbers 443 1881 tricapped prism number 444 1882 number of linearly separable Boolean functions in 4 variables 445 1883 number of conjugacy classes in the alternating group A28 313 1884 k such that 5 2k 1 is prime 229 1885 Zeisel number 273 1886 number of partitions of 64 into fourth powers 446 1887 number of edges in the hexagonal triangle T 34 115 1888 primitive abundant number abundant number all of whose proper divisors are deficient numbers 249 1889 Sophie Germain prime highly cototient number 44 1890 triangular matchstick number 49 1891 triangular number hexagonal number 30 centered pentagonal number 47 centered triangular number 118 1892 pronic number 52 1893 442 44 1 H44 the 44th Hogben number 158 1894 maximal number of regions the plane is divided into by drawing 44 circles 195 1895 Stern Jacobsthal number 236 1896 member of the Mian Chowla sequence 19 1897 member of Padovan sequence 72 number of triangle free graphs on 9 vertices 447 1898 smallest multiple of n whose digits sum to 26 448 1899 cropped hexagone 230 1900 to 1999 Edit 1900 number of primes lt 214 26 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 Bruckner 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 449 1903 generalized catalan number 450 1904 number of flat partitions of 43 306 1905 Fermat pseudoprime 96 1906 number n such that 3n 8 is prime 451 1907 safe prime 23 balanced prime 92 1908 coreful perfect number 299 1909 hyperperfect number 452 1910 number of compositions of 13 having exactly one fixed point 453 1911 heptagonal pyramidal number 144 1912 size of 6th maximum raising after one blind in pot limit poker 454 1913 super prime Honaker prime 215 1914 number of bipartite partitions of 12 white objects and 3 black ones 455 1915 number of nonisomorphic semigroups of order 5 456 1916 sum of first 50 composite numbers 172 1917 number of partitions of 51 into pairwise relatively prime parts 154 1918 heptagonal number 66 1919 smallest number with reciprocal of period length 36 in base 10 457 1920 sum of the nontriangular numbers between successive triangular numbers 1921 4 dimensional centered cube number 458 1922 Area of a square with diagonal 62 55 1923 2 312 1 number of different 2 X 2 determinants with integer entries from 0 to 31 189 1924 2 312 2 number of points on surface of tetrahedron with edgelength 31 134 1925 number of ways to write 24 as an orderless product of orderless sums 104 1926 pentagonal number 71 1927 211 112 459 1928 number of distinct values taken by 2 2 2 with 13 2 s and parentheses inserted in all possible ways 460 1929 Mertens function zero number of integer partitions of 42 whose distinct parts are connected 221 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 308 1931 Sophie Germain prime 1932 number of partitions of 40 into prime power parts 198 1933 centered heptagonal number 67 Honaker prime 215 1934 sum of totient function for first 79 integers 1935 number of edges in the join of two cycle graphs both of order 43 135 1936 442 18 gonal number 461 324 gonal number 1937 number of chiral n ominoes in 12 space one cell labeled 462 1938 Mertens function zero number of points on surface of octahedron with edgelength 22 139 1939 7 Knodel number 123 1940 the Mahonian number T 8 9 179 1941 maximal number of regions obtained by joining 16 points around a circle by straight lines 463 1942 number k for which 10k 1 10k 3 10k 7 10k 9 and 10k 13 are primes 464 1943 largest number not the sum of distinct tetradecagonal numbers 465 1944 3 smooth number 23 35 Achilles number 331 1945 number of partitions of 25 into relatively prime parts such that multiplicities of parts are also relatively prime 466 1946 number of surface points on a cube with edge length 19 20 1947 k such that 5 2k 1 is a prime factor of a Fermat number 22m 1 for some m 467 1948 number of strict solid partitions of 20 87 1949 smallest prime gt 442 142 1950 1 2 3 4 5 6 7 8 9 10 11 12 displaystyle 1 cdot 2 cdot 3 4 cdot 5 cdot 6 7 cdot 8 cdot 9 10 cdot 11 cdot 12 468 largest number not the sum of distinct pentadecagonal numbers 465 1951 cuban prime 368 1952 number of covers of 1 2 3 4 469 1953 triangular number 1956 number of sum free subsets of 1 16 261 1955 number of partitions of 25 with at least one distinct part 190 1956 nonagonal number 173 1957 k 0 6 6 k displaystyle sum k 0 6 frac 6 k total number of ordered k tuples k 0 1 2 3 4 5 6 of distinct elements from an 6 element set 470 1958 number of partitions of 25 192 1959 Heptanacci Lucas number 471 1960 number of parts in all partitions of 33 into distinct parts 46 1961 number of lattice points inside a circle of radius 25 113 1962 number of edges in the join of the complete graph K36 and the cycle graph C36 472 1963 1 is prime 473 1964 number of linear forests of planted planar trees with 8 nodes 474 1965 total number of parts in all partitions of 17 63 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 475 s 1968 s 1967 s 1966 476 1969 Only value less than four million for which a mod ification of the standard Ackermann Function does not stabilize 477 1970 number of compositions of two types of 9 having no even parts 478 1971 3 7 6 3 displaystyle 3 7 6 3 479 1972 n such that n 37 1 n 1 displaystyle frac n 37 1 n 1 is prime 480 1973 Sophie Germain prime Leonardo prime 1974 number of binary vectors of length 17 containing no singletons 174 1975 number of partitions of 28 with nonnegative rank 344 1976 octagonal number 141 1977 number of non isomorphic multiset partitions of weight 9 with no singletons 481 1978 n such that n 3n 5 482 1979 number of squares between 452 and 454 109 1980 pronic number 52 1981 pinwheel number 91 1982 maximal number of regions the plane is divided into by drawing 45 circles 195 1983 skiponacci number 114 1984 11111000000 in binary see also 1984 disambiguation 1985 centered square number 16 1986 number of ways to write 25 as an orderless product of orderless sums 104 1987 300th prime number 1988 sum of the first 33 primes 1989 number of 9 step mappings with 4 inputs 250 1990 Stella octangula number 1991 11 181 the 46th Gullwing number 483 palindromic composite number with only palindromic prime factors 484 1992 number of nonisomorphic sets of nonempty subsets of a 4 set 485 1993 a number with the property that 41993 31993 is prime 486 number of partitions of 30 into a prime number of parts 105 1994 Glaisher s function W 37 487 1995 number of unlabeled graphs on 9 vertices with independence number 6 488 1996 a number with the property that 1996 3 3 is prime 489 1997 k 1 21 k ϕ k displaystyle sum k 1 21 k cdot phi k 490 1998 triangular matchstick number 49 1999 centered triangular number 491 number of regular forms in a myriagram Prime numbers Edit There are 135 prime numbers between 1000 and 2000 492 493 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 1999References Edit Wikimedia Commons has media related to 1000 number Mathematics portal chiliad Merriam Webster Archived from the original on 25 March 2022 Caldwell Chris K 2021 The First 1 000 Primes PrimePages University of Tennessee at Martin Sloane N J A ed Sequence A051876 24 gonal numbers The On Line Encyclopedia of Integer Sequences OEIS Foundation Retrieved 30 November 2022 1000 Prime Curious Archived from the original on 25 March 2022 Sloane s A122189 Heptanacci numbers The On Line Encyclopedia of Integer Sequences OEIS Foundation Archived from the original on 7 October 2016 Retrieved 13 July 2017 Sloane N J A ed Sequence A007585 10 gonal or decagonal pyramidal numbers The On Line Encyclopedia of Integer Sequences OEIS Foundation Retrieved 24 May 2022 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 The On Line Encyclopedia of Integer Sequences OEIS Foundation Retrieved 8 January 2023 Sloane N J A ed Sequence A036063 Increasing gaps among twin primes size The On Line Encyclopedia of Integer Sequences OEIS Foundation Retrieved 8 January 2023 a b A003352 Oeis Sloane N J A ed Sequence A061341 A061341 Numbers not ending in 0 whose cubes are concatenations of other cubes The On Line Encyclopedia of Integer Sequences OEIS Foundation Retrieved 8 January 2023 A003353 Oeis Sloane N J A ed Sequence A034262 n 3 n The On Line Encyclopedia of Integer Sequences OEIS Foundation Retrieved 24 May 2022 a b Sloane N J A ed Sequence A020473 Egyptian fractions number of partitions of 1 into reciprocals of positive integers lt n 1 The On Line Encyclopedia of Integer Sequences OEIS Foundation Retrieved 24 May 2022 A046092 Oeis a b c d e f g h i j k l m n o Sloane s A005384 Sophie Germain primes The On Line Encyclopedia of Integer Sequences OEIS Foundation Archived from the original on 11 June 2016 Retrieved 12 June 2016 a b c d e f g h i j Sloane s A001844 Centered square numbers The On Line Encyclopedia of Integer Sequences OEIS Foundation Archived from the original on 11 June 2016 Retrieved 12 June 2016 Sloane N J A ed Sequence A000325 2 n n The On Line Encyclopedia of Integer Sequences OEIS Foundation Retrieved 24 May 2022 a b c d Sloane s A000330 Square pyramidal numbers The On Line Encyclopedia of Integer Sequences OEIS Foundation Archived from the original on 10 June 2016 Retrieved 12 June 2016 a b c d e f g h Sloane s A005282 Mian Chowla sequence The On Line Encyclopedia of Integer Sequences OEIS Foundation Archived from the original on 17 May 2016 Retrieved 12 June 2016 a b c d e f Sloane N J A ed Sequence A005897 6 n 2 2 for n gt 0 The On Line Encyclopedia of Integer Sequences OEIS Foundation A316729 Oeis Sloane N J A ed Sequence A006313 Numbers n such that n 16 1 is prime The On Line Encyclopedia of Integer Sequences OEIS Foundation Retrieved 24 May 2022 a b c d e f g h i j k l Sloane s A005385 Safe primes The On Line Encyclopedia of Integer Sequences OEIS Foundation Archived from the original on 10 June 2016 Retrieved 12 June 2016 Sloane N J A ed Sequence A034964 Sums of five consecutive primes The On Line Encyclopedia of Integer Sequences OEIS Foundation Retrieved 1 November 2022 Sloane N J A ed Sequence A000162 Number of 3 dimensional polyominoes or polycubes with n cells The On Line Encyclopedia of Integer Sequences OEIS Foundation Retrieved 1 November 2022 a b Sloane N J A ed Sequence A007053 Number of primes lt 2 n 1 The On Line Encyclopedia of Integer Sequences OEIS Foundation Retrieved 2 June 2022 Sloane N J A ed Sequence A004023 Indices of prime repunits numbers n such that 11 111 with n 1 s is prime The On Line Encyclopedia of Integer Sequences OEIS Foundation Retrieved 25 February 2023 A004801 Oeis a b c d e f g h Sloane s A000217 Triangular numbers The On Line Encyclopedia of Integer Sequences OEIS Foundation Archived from the original on 5 April 2016 Retrieved 12 June 2016 a b c d e f g h i Sloane s A000384 Hexagonal numbers The On Line Encyclopedia of Integer Sequences OEIS Foundation Archived from the original on 17 April 2016 Retrieved 12 June 2016 a b A000124 Oeis A161328 Oeis A023036 Oeis A007522 Oeis a b c d Sloane N J A ed Sequence A002865 Number of partitions of n that do not contain 1 as a part The On Line Encyclopedia of Integer Sequences OEIS Foundation Retrieved 2 June 2022 a b A000695 Oeis A003356 Oeis a b A003357 Oeis A036301 Oeis A000567 Oeis A000025 Oeis A336130 Oeis A073576 Oeis a b c d e f g Sloane s A100827 Highly cototient numbers The On Line Encyclopedia of Integer Sequences OEIS Foundation Archived from the original on 10 June 2016 Retrieved 12 June 2016 Base converter number conversion a b c d e Sloane N J A ed Sequence A015723 Number of parts in all partitions of n into distinct parts The On Line Encyclopedia of Integer Sequences OEIS Foundation a b c d e f g h i Sloane s A005891 Centered pentagonal numbers The On Line Encyclopedia of Integer Sequences OEIS Foundation Archived from the original on 10 June 2016 Retrieved 12 June 2016 A003365 Oeis a b c d e f g h i j k Sloane N J A ed Sequence A045943 Triangular matchstick numbers 3 n n 1 2 The On Line Encyclopedia of Integer Sequences OEIS Foundation Retrieved 2 June 2022 A005448 Oeis A003368 Oeis a b c d e f g h i j k l m Sloane s A002378 Oblong or promic pronic or heteromecic numbers The On Line Encyclopedia of Integer Sequences OEIS Foundation Archived from the original on 9 June 2016 Retrieved 12 June 2016 A002061 Oeis A003349 Oeis a b c d Sloane N J A ed Sequence A001105 2 n 2 The On Line Encyclopedia of Integer Sequences OEIS Foundation A003294 Oeis a b c A035137 Oeis A347565 Primes p such that A241014 A000720 p is 1 or 1 The On Line Encyclopedia of Integer Sequences OEIS Foundation Archived from the original on 25 March 2022 Retrieved 19 January 2022 A003325 Oeis A195162 Oeis A006532 Oeis A341450 Oeis a b c Sloane N J A ed Sequence A006128 Total number of parts in all partitions of n Also sum of largest parts of all partitions of n The On Line Encyclopedia of Integer Sequences OEIS Foundation a b A006567 Oeis a b A003354 Oeis a b c d e f g h Sloane s A000566 Heptagonal numbers The On Line Encyclopedia of Integer Sequences OEIS Foundation Archived from the original on 11 June 2016 Retrieved 12 June 2016 a b c d e f g Sloane s A069099 Centered heptagonal numbers The On Line Encyclopedia of Integer Sequences OEIS Foundation Archived from the original on 9 June 2016 Retrieved 12 June 2016 A273873 Oeis A292457 Oeis A073592 Oeis a b c d e f g h i j Sloane s A000326 Pentagonal numbers The On Line Encyclopedia of Integer Sequences OEIS Foundation Archived from the original on 10 June 2016 Retrieved 12 June 2016 a b c Sloane s A000931 Padovan sequence The On Line Encyclopedia of Integer Sequences OEIS Foundation Archived from the original on 10 June 2016 Retrieved 12 June 2016 A077043 Oeis A056107 Oeis A025147 Oeis Sloane s A006753 Smith numbers The On Line Encyclopedia of Integer Sequences OEIS Foundation Archived from the original on 9 June 2016 Retrieved 12 June 2016 Sloane s A031157 Numbers that are both lucky and prime The On Line Encyclopedia of Integer Sequences OEIS Foundation Archived from the original on 4 March 2016 Retrieved 12 June 2016 A033996 Oeis A018900 Oeis A046308 Oeis Sloane s A001232 Numbers n such that 9 n n written backwards The On Line Encyclopedia of Integer Sequences OEIS Foundation Archived from the original on 17 October 2015 Retrieved 14 June 2016 A003350 Oeis Wells D The Penguin Dictionary of Curious and Interesting Numbers London Penguin Group 1987 163 a b c d e Sloane s A003154 Centered 12 gonal numbers Also star numbers The On Line Encyclopedia of Integer Sequences OEIS Foundation Archived from the original on 11 June 2016 Retrieved 12 June 2016 A003355 Oeis A051682 Oeis a b c Sloane N J A ed Sequence A323657 Number of strict solid partitions of n The On Line Encyclopedia of Integer Sequences OEIS Foundation A121029 Oeis A292449 Oeis Sloane N J A ed Sequence A087188 number of partitions of n into distinct squarefree parts The On Line Encyclopedia of Integer Sequences OEIS Foundation a b c d e f g h i Sloane N J A ed Sequence A059993 Pinwheel numbers 2 n 2 6 n 1 The On Line Encyclopedia of Integer Sequences OEIS Foundation a b c d e f g h i Sloane s A006562 Balanced primes The On Line Encyclopedia of Integer Sequences OEIS Foundation Retrieved 12 June 2016 a b Sloane s A007629 Repfigit REPetitive FIbonacci like diGIT numbers or Keith numbers The On Line Encyclopedia of Integer Sequences OEIS Foundation Retrieved 12 June 2016 Sloane s A002997 Carmichael numbers The On Line Encyclopedia of Integer Sequences OEIS Foundation Retrieved 12 June 2016 a b c d e Sloane s A001107 10 gonal or decagonal numbers The On Line Encyclopedia of Integer Sequences OEIS Foundation Retrieved 12 June 2016 a b Sloane N J A ed Sequence A001567 Fermat pseudoprimes to base 2 also called Sarrus numbers or Poulet numbers The On Line Encyclopedia of Integer Sequences OEIS Foundation a b c Sloane N J A ed Sequence A051890 2 n 2 n 1 The On Line Encyclopedia of Integer Sequences OEIS Foundation Sloane N J A ed Sequence A319560 Number of non isomorphic strict T 0 multiset partitions of weight n The On Line Encyclopedia of Integer Sequences OEIS Foundation a b c Sloane N J A ed Sequence A028916 Friedlander Iwaniec primes Primes of form a 2 b 4 The On Line Encyclopedia of Integer Sequences OEIS Foundation Sloane N J A ed Sequence A057732 Numbers k such that 2 k 3 is prime The On Line Encyclopedia of Integer Sequences OEIS Foundation a b Sloane N J A ed Sequence A046376 Palindromes with exactly 2 palindromic prime factors counted with multiplicity and no other prime factors The On Line Encyclopedia of Integer Sequences OEIS Foundation Sloane N J A ed Sequence A128455 Numbers k such that 9 k 2 is a prime The On Line Encyclopedia of Integer Sequences OEIS Foundation a b c d e Sloane N J A ed Sequence A000009 Expansion of Product m gt 0 1 x m number of partitions of n into distinct parts number of partitions of n into odd parts The On Line Encyclopedia of Integer Sequences OEIS Foundation a b c d Sloane N J A ed Sequence A318949 Number of ways to write n as an orderless product of orderless sums The On Line Encyclopedia of Integer Sequences OEIS Foundation a b c d Sloane N J A ed Sequence A038499 Number of partitions of n into a prime number of parts The On Line Encyclopedia of Integer Sequences OEIS Foundation a b Sloane N J A ed Sequence A006748 Number of diagonally symmetric polyominoes with n cells The On Line Encyclopedia of Integer Sequences OEIS Foundation a b c d e Sloane N J A ed Sequence A210000 Number of unimodular 2 X 2 matrices having all terms in 0 1 n The On Line Encyclopedia of Integer Sequences OEIS Foundation Sloane N J A ed Sequence A033995 Number of bipartite graphs with n nodes The On Line Encyclopedia of Integer Sequences OEIS Foundation a b c d e Sloane N J A ed Sequence A028387 n n 1 2 The On Line Encyclopedia of Integer Sequences OEIS Foundation a b c d e Sloane s A076980 Leyland numbers The On Line Encyclopedia of Integer Sequences OEIS Foundation Retrieved 12 June 2016 Sloane N J A ed Sequence A062801 Number of 2 X 2 non singular integer matrices with entries from 0 n The On Line Encyclopedia of Integer Sequences OEIS Foundation a b c d e f Sloane N J A ed Sequence A000096 n n 3 2 The On Line Encyclopedia of Integer Sequences OEIS Foundation a b c d e f g Sloane N J A ed Sequence A000328 The On Line Encyclopedia of Integer Sequences OEIS Foundation a b c Sloane N J A ed Sequence A001608 Perrin sequence The On Line Encyclopedia of Integer Sequences OEIS Foundation a b c d e f Sloane N J A ed Sequence A140091 3 n n 3 2 The On Line Encyclopedia of Integer Sequences OEIS Foundation Sloane N J A ed Sequence A005380 The On Line Encyclopedia of Integer Sequences OEIS Foundation Sloane N J A ed Sequence A051026 Number of primitive subsequences of 1 2 n The On Line Encyclopedia of Integer Sequences OEIS Foundation a b c d e f g h i Sloane N J A ed Sequence A005448 Centered triangular numbers 3n n 1 2 1 The On Line Encyclopedia of Integer Sequences OEIS Foundation Sloane N J A ed Sequence A080040 2 a n 1 2 a n 2 for n gt 1 The On Line Encyclopedia of Integer Sequences OEIS Foundation Sloane N J A ed Sequence A264237 Sum of values of vertices at level n of the hyperbolic Pascal pyramid The On Line Encyclopedia of Integer Sequences OEIS Foundation a b Sloane N J A ed Sequence A033991 n 4 n 1 The On Line Encyclopedia of Integer Sequences OEIS Foundation Sloane s A000292 Tetrahedral numbers The On Line Encyclopedia of Integer Sequences OEIS Foundation Retrieved 12 June 2016 a b c d e f Sloane N J A ed Sequence A208155 7 Knodel numbers The On Line Encyclopedia of Integer Sequences OEIS Foundation a b c d e Sloane N J A ed Sequence A006315 Numbers n such that n 32 1 is prime The On Line Encyclopedia of Integer Sequences OEIS Foundation Sloane N J A ed Sequence A185982 Triangle read by rows number of set partitions of n elements with k connectors The On Line Encyclopedia of Integer Sequences OEIS Foundation a b c d Sloane N J A ed Sequence A007534 Even numbers that are not the sum of a pair of twin primes The On Line Encyclopedia of Integer Sequences OEIS Foundation a b c d e Sloane N J A ed Sequence A050993 5 Knodel numbers The On Line Encyclopedia of Integer Sequences OEIS Foundation Sloane N J A ed Sequence A006094 Products of 2 successive primes The On Line Encyclopedia of Integer Sequences OEIS Foundation Sloane N J A ed Sequence A046368 Products of two palindromic primes The On Line Encyclopedia of Integer Sequences OEIS Foundation 1150 number The encyclopedia of numbers a b Sloane s A000101 Increasing gaps between primes upper end The On Line Encyclopedia of Integer Sequences OEIS Foundation Retrieved 10 July 2016 a b Sloane s A097942 Highly totient numbers The On Line Encyclopedia of Integer Sequences OEIS Foundation Retrieved 12 June 2016 a b c d Sloane s A080076 Proth primes The On Line Encyclopedia of Integer Sequences OEIS Foundation Retrieved 12 June 2016 a b c d e f 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 gt 0 The On Line Encyclopedia of Integer Sequences OEIS Foundation a b c d e f g h i j Sloane N J A ed Sequence n n 2 The On Line Encyclopedia of Integer Sequences OEIS Foundation a b c Sloane s A005900 Octahedral numbers The On Line Encyclopedia of Integer Sequences OEIS Foundation Retrieved 12 June 2016 Sloane s A069125 a n 11 n 2 11 n 2 2 The On Line Encyclopedia of Integer Sequences OEIS Foundation Retrieved 12 June 2016 1157 number The encyclopedia of numbers a b c d e Sloane N J A ed Sequence A005899 Number of points on surface of octahedron The On Line Encyclopedia of Integer Sequences OEIS Foundation a b Sloane N J A ed Sequence A001845 Centered octahedral numbers crystal ball sequence for cubic lattice The On Line Encyclopedia of Integer Sequences OEIS Foundation Retrieved 2 June 2022 a b c d e Sloane N J A ed Sequence A000567 Octagonal numbers n 3 n 2 Also called star numbers The On Line Encyclopedia of Integer Sequences OEIS Foundation a b c d Sloane N J A ed Sequence A007491 Smallest prime gt n 2 The On Line Encyclopedia of Integer Sequences OEIS Foundation Sloane N J A ed Sequence A055887 Number of ordered partitions of partitions The On Line Encyclopedia of Integer Sequences OEIS Foundation a b c Sloane N J A ed Sequence A002413 Heptagonal or 7 gonal pyramidal numbers The On Line Encyclopedia of Integer Sequences OEIS Foundation a b c d Sloane N J A ed Sequence A018805 The On Line Encyclopedia of Integer Sequences OEIS Foundation Sloane N J A ed Sequence A024816 Antisigma n Sum of the numbers less than n that do not divide n The On Line Encyclopedia of Integer Sequences OEIS Foundation A063776 OEIS oeis org A000256 OEIS oeis org 1179 number The encyclopedia of numbers A000339 OEIS oeis org A271269 OEIS oeis org A000031 OEIS oeis org Higgins Peter 2008 Number Story From Counting to Cryptography New York Copernicus p 61 ISBN 978 1 84800 000 1 a b c d e Sloane N J A ed Sequence A051424 Number of partitions of n into pairwise relatively prime parts The On Line Encyclopedia of Integer Sequences OEIS Foundation a b Sloane s A042978 Stern primes The On Line Encyclopedia of Integer Sequences OEIS Foundation Retrieved 12 June 2016 A121038 OEIS oeis org a b Sloane N J A ed Sequence A005449 Second pentagonal numbers n 3 n 1 2 The On Line Encyclopedia of Integer Sequences OEIS Foundation a b c d e f Sloane N J A ed Sequence A002061 Central polygonal numbers n 2 n 1 The On Line Encyclopedia of Integer Sequences OEIS Foundation A175654 OEIS oeis org oeis org A062092 a b c d e f Sloane N J A ed Sequence A024916 Sum 1 n sigma k The On Line Encyclopedia of Integer Sequences OEIS Foundation a b c d e gt Sloane N J A ed Sequence A080663 3 n 2 1 The On Line Encyclopedia of Integer Sequences OEIS Foundation Meehan Eileen R Why TV is not our fault television programming viewers and who s really in control Lanham MD Rowman amp Littlefield 2005 A265070 OEIS oeis org 1204 number The encyclopedia of numbers a b Sloane N J A ed Sequence A240574 Number of partitions of n such that the number of odd parts is a part The On Line Encyclopedia of Integer Sequences OEIS Foundation A303815 OEIS oeis org a b c d e f g h Sloane N J A ed Sequence A098237 Composite de Polignac numbers The On Line Encyclopedia of Integer Sequences OEIS Foundation Sloane N J A ed Sequence A337070 Number of strict chains of divisors starting with the superprimorial A006939 n The On Line Encyclopedia of Integer Sequences OEIS Foundation Higgins ibid Sloane N J A ed Sequence A000070 Sum 0 n A000041 k The On Line Encyclopedia of Integer Sequences OEIS Foundation a b c d e f g h i Sloane N J A ed Sequence A053767 Sum of first n composite numbers The On Line Encyclopedia of Integer Sequences OEIS Foundation a b c d e f Sloane s A001106 9 gonal or enneagonal or nonagonal numbers The On Line Encyclopedia of Integer Sequences OEIS Foundation Retrieved 12 June 2016 a b Sloane N J A ed Sequence A006355 Number of binary vectors of length n containing no singletons The On Line Encyclopedia of Integer Sequences OEIS Foundation Sloane s A001110 Square triangular numbers The On Line Encyclopedia of Integer Sequences OEIS Foundation Retrieved 12 June 2016 a b c d e Sloane s A016754 Odd squares a n 2n 1 2 Also centered octagonal numbers The On Line Encyclopedia of Integer Sequences OEIS Foundation Retrieved 12 June 2016 A004111 OEIS oeis org A061262 OEIS oeis org a b c 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 The On Line Encyclopedia of Integer Sequences OEIS Foundation A006154 OEIS oeis org A000045 OEIS oeis org a b c d e f g Sloane N J A ed Sequence A054735 Sums of twin prime pairs The On Line Encyclopedia of Integer Sequences OEIS Foundation A160160 OEIS oeis org Sloane s A005898 Centered cube numbers The On Line Encyclopedia of Integer Sequences OEIS Foundation Retrieved 12 June 2016 Sloane N J A ed Sequence A126796 Number of complete partitions of n The On Line Encyclopedia of Integer Sequences OEIS Foundation oeis org A305843 A007690 OEIS oeis org Sloane s A033819 Trimorphic numbers The On Line Encyclopedia of Integer Sequences OEIS Foundation Retrieved 12 June 2016 a b c d Sloane N J A ed Sequence A058331 2 n 2 1 The On Line Encyclopedia of Integer Sequences OEIS Foundation a b c Sloane N J A ed Sequence A144300 Number of partitions of n minus number of divisors of n The On Line Encyclopedia of Integer Sequences OEIS Foundation Sloane N J A ed Sequence A000837 Number of partitions of n into relatively prime parts Also aperiodic partitions The On Line Encyclopedia of Integer Sequences OEIS Foundation a b c Sloane N J A ed Sequence A000041 a n is the number of partitions of n the partition numbers The On Line Encyclopedia of Integer Sequences OEIS Foundation a b Sloane s A002182 Highly composite numbers The On Line Encyclopedia of Integer Sequences OEIS Foundation Retrieved 12 June 2016 a b c d e Sloane s A014575 Vampire numbers The On Line Encyclopedia of Integer Sequences OEIS Foundation Retrieved 12 June 2016 a b c d e f g h i j Sloane N J A ed Sequence A014206 n 2 n 2 The On Line Encyclopedia of Integer Sequences OEIS Foundation a b Sloane N J A ed Sequence A070169 Rounded total surface area of a regular tetrahedron with edge length n The On Line Encyclopedia of Integer Sequences OEIS Foundation a b c 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 The On Line Encyclopedia of Integer Sequences OEIS Foundation a b c Sloane N J A ed Sequence A023894 Number of partitions of n into prime power parts The On Line Encyclopedia of Integer Sequences OEIS Foundation a b c Sloane N J A ed Sequence A072895 Least k for the Theodorus spiral to complete n revolutions The On Line Encyclopedia of Integer Sequences OEIS Foundation Sloane N J A ed Sequence A100040 2 n 2 n 5 The On Line Encyclopedia of Integer Sequences OEIS Foundation Sloane N J A ed Sequence A051349 Sum of first n nonprimes The On Line Encyclopedia of Integer Sequences OEIS Foundation Sloane N J A ed Sequence A033286 n prime n The On Line Encyclopedia of Integer Sequences OEIS Foundation a b Sloane N J A ed Sequence A084849 1 n 2 n 2 The On Line Encyclopedia of Integer Sequences OEIS Foundation a b Sloane N J A ed Sequence A000930 Narayana s cows sequence The On Line Encyclopedia of Integer Sequences OEIS Foundation Sloane N J A ed Sequence A001792 n 2 2 n 1 The On Line Encyclopedia of Integer Sequences OEIS Foundation Sloane N J A ed Sequence A006958 Number of parallelogram polyominoes with n cells also called staircase polyominoes although that term is overused The On Line Encyclopedia of Integer Sequences OEIS Foundation 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 The On Line Encyclopedia of Integer Sequences OEIS Foundation Sloane N J A ed Sequence A007318 Pascal s triangle read by rows The On Line Encyclopedia of Integer Sequences OEIS Foundation Sloane N J A ed Sequence A014574 Average of twin prime pairs The On Line Encyclopedia of Integer Sequences OEIS Foundation Sloane N J A ed Sequence A173831 Largest prime lt n 4 The On Line Encyclopedia of Integer Sequences OEIS Foundation Sloane N J A ed Sequence A006872 Numbers k such that phi k equals phi sigma k The On Line Encyclopedia of Integer Sequences OEIS Foundation Sloane N J A ed Sequence A014285 Sum 1 n j prime j The On Line Encyclopedia of Integer Sequences OEIS Foundation a b Sloane N J A ed Sequence A071400 Rounded volume of a regular octahedron with edge length n The On Line Encyclopedia of Integer Sequences OEIS Foundation a b c d Sloane N J A ed Sequence A003114 Number of partitions of n into parts 5k 1 or 5k 4 The On Line Encyclopedia of Integer Sequences OEIS Foundation a b c d e f Sloane N J A ed Sequence A033548 Honaker primes primes P k such that sum of digits of P k equals sum of digits of k The On Line Encyclopedia of Integer Sequences OEIS Foundation Sloane N J A ed Sequence A000055 Number of trees with n unlabeled nodes The On Line Encyclopedia of Integer Sequences OEIS Foundation A124826 OEIS oeis org A142005 OEIS oeis org a b Sloane N J A ed Sequence A338470 Number of integer partitions of n with no part dividing all the others The On Line Encyclopedia of Integer Sequences OEIS Foundation A066186 OEIS oeis org a b c d Sloane N J A ed Sequence A304716 Number of integer partitions of n whose distinct parts are connected The On Line Encyclopedia of Integer Sequences OEIS Foundation A115073 OEIS oeis org A061256 OEIS oeis org A061954 OEIS oeis org A030299 OEIS oeis org a b Sloane s A002559 Markoff or Markov numbers The On Line Encyclopedia of Integer Sequences OEIS Foundation Retrieved 12 June 2016 a b Sloane N J A ed Sequence A005894 Centered tetrahedral numbers The On Line Encyclopedia of Integer Sequences OEIS Foundation A005064 OEIS oeis org a b c d e f Sloane N J A ed Sequence A001770 Numbers k such that 5 2 k 1 is prime The On Line Encyclopedia of Integer Sequences OEIS Foundation a b c d e Sloane N J A ed Sequence A144391 3 n 2 n 1 The On Line Encyclopedia of Integer Sequences OEIS Foundation a b c d e f g 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 The On Line Encyclopedia of Integer Sequences OEIS Foundation a b Sloane N J A ed Sequence A056809 Numbers k such that k k 1 and k 2 are products of two primes The On Line Encyclopedia of Integer Sequences OEIS Foundation A316473 OEIS oeis org A000032 OEIS oeis org 1348 number The encyclopedia of numbers a b Sloane N J A ed Sequence A101624 Stern Jacobsthal number The On Line Encyclopedia of Integer Sequences OEIS Foundation Sloane N J A ed Sequence A064228 From Recaman s sequence A005132 values of n achieving records in A057167 The On Line Encyclopedia of Integer Sequences OEIS Foundation Sloane N J A ed Sequence A057167 Term in Recaman s sequence A005132 where n appears for first time or 1 if n never appears The On Line Encyclopedia of Integer Sequences OEIS Foundation Sloane N J A ed Sequence A064227 From Recaman s sequence A005132 record values in A057167 The On Line Encyclopedia of Integer Sequences OEIS Foundation a b c Sloane N J A ed Sequence A000603 The On Line Encyclopedia of Integer Sequences OEIS Foundation 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 The On Line Encyclopedia of Integer Sequences OEIS Foundation a b c d e Sloane N J A ed Sequence A330224 Number of achiral integer partitions of n The On Line Encyclopedia of Integer Sequences OEIS Foundation Sloane N J A ed Sequence A001610 a n 1 a n 2 1 The On Line Encyclopedia of Integer Sequences OEIS Foundation Sloane N J A ed Sequence A000032 Lucas numbers L n 1 L n 2 The On Line Encyclopedia of Integer Sequences OEIS Foundation a b Sloane s A000332 Binomial coefficient binomial n 4 n n 1 n 2 n 3 24 The On Line Encyclopedia of Integer Sequences OEIS Foundation Retrieved 12 June 2016 Sloane N J A ed Sequence A005578 Arima sequence The On Line Encyclopedia of Integer Sequences OEIS Foundation a b c Sloane N J A ed Sequence A001157 sigma 2 n sum of squares of divisors of n The On Line Encyclopedia of Integer Sequences OEIS Foundation a b Sloane N J A ed Sequence A007585 10 gonal or decagonal pyramidal numbers The On Line Encyclopedia of Integer Sequences OEIS Foundation a b c Sloane N J A ed Sequence A071395 Primitive abundant numbers abundant numbers all of whose proper divisors are deficient numbers The On Line Encyclopedia of Integer Sequences OEIS Foundation a b Sloane N J A ed Sequence A005945 Number of n step mappings with 4 inputs The On Line Encyclopedia of Integer Sequences OEIS Foundation A001631 OEIS oeis org Retrieved 25 June 2023 Sloane N J A ed Sequence A088274 Numbers k such that 10 k 7 is prime The On Line Encyclopedia of Integer Sequences OEIS Foundation Sloane N J A ed Sequence A000111 Euler or up down numbers e g f sec x tan x The On Line Encyclopedia of Integer Sequences OEIS Foundation Sloane N J A ed Sequence A002414 Octagonal pyramidal numbers The On Line Encyclopedia of Integer Sequences OEIS Foundation Sloane s A001567 Fermat pseudoprimes to base 2 The On Line Encyclopedia of Integer Sequences OEIS Foundation Retrieved 12 June 2016 Sloane s A050217 Super Poulet numbers The On Line Encyclopedia of Integer Sequences OEIS Foundation Retrieved 12 June 2016 Sloane N J A ed Sequence A054552 4 n 2 3 n 1 The On Line Encyclopedia of Integer Sequences OEIS Foundation Sloane N J A ed Sequence A051349 Sum of first n nonprimes The On Line Encyclopedia of Integer Sequences OEIS Foundation Sloane N J A ed Sequence A017919 Powers of sqrt 5 rounded down The On Line Encyclopedia of Integer Sequences OEIS Foundation span, wikipedia, wiki, book, books, library,

article

, read, download, free, free download, mp3, video, mp4, 3gp, jpg, jpeg, gif, png, picture, music, song, movie, book, game, games.