// Workers AI · dad joke modeIs 1000 a lot? One thousand percent yes.
| ||||
|---|---|---|---|---|
| Cardinal | one thousand | |||
| Ordinal | 1000th (one thousandth) | |||
| Factorization | 23 × 53 | |||
| Divisors | 1, 2, 4, 5, 8, 10, 20, 25, 40, 50, 100, 125, 200, 250, 500, 1000 | |||
| Greek numeral | ,Α´ | |||
| Roman numeral | M, m | |||
| Roman numeral (unicode) | M, m, ↀ | |||
| Unicode symbol | ↀ | |||
| Greek prefix | chilia | |||
| Latin prefix | milli | |||
| Binary | 11111010002 | |||
| Ternary | 11010013 | |||
| Senary | 43446 | |||
| Octal | 17508 | |||
| Duodecimal | 6B412 | |||
| Hexadecimal | 3E816 | |||
| Tamil | ௲ | |||
| Chinese | 千 | |||
| Punjabi | ੧੦੦੦ | |||
| Devanagari | १००० | |||
| Armenian | Ռ | |||
| Egyptian hieroglyph | 𓆼 | |||
1000 or one thousand is the natural number following 999 and preceding 1001. In most English-speaking countries, it can be written with or without a comma or sometimes a period separating the thousands digit: 1,000.
A group of one thousand units 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. It is the first 4-digit integer.
Notation
[edit]- The decimal representation for one thousand is
- 1000—a one followed by three zeros, in the general notation;
- 1 × 103—in engineering notation, which for this number coincides with:
- 1 × 103 exactly—in scientific normalized exponential notation;
- 1 E+3 exactly—in scientific E notation.
- The SI prefix for a thousand units is "kilo-", abbreviated to "k"—for instance, a 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 or 210).
- 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 using "Y2K" to denote the Year 2000 computer problem.
- 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.
In mathematics
[edit]Numbers in the range 1001–1999
[edit]1001 to 1099
[edit]1001
[edit]1002
[edit]1002 = 2 × 3 × 167. It is a sphenic number, an abundant number, and a zero of Mertens function. There are 1002 partitions of 22.
1003
[edit]1003 = the product of some prime p and the pth prime, namely p = 17.
1004
[edit]1004 = 22 × 251. It is a heptanacci number.[3]
1006
[edit]1006 = 2 × 503. It is an unusual number, an equidigital number, and a square-free number. It is a record gap between twin primes.[4] There are 1006 compositions (ordered partitions) of 22 into squares 1006 undirected Hamiltonian paths in 4 by 5 square grid graph.[5]
1009
[edit]1009 is the smallest four-digit prime, a Lucky prime, and Chen prime. It is palindromic in bases 11, 15, 19, 24 and 28: (83811, 47415, 2F219, 1I124, 18128).
1011
[edit]1011 = 3 × 337. It is a Harshad number in bases 5, 10, 15, 20, 25, 30, 35, 40, 45, 50, 55, 60, 65, 70, 75 (and 202 other bases). It is the largest natural number n such that 2n contains 101 and does not contain 11011. There are 1011 partitions of 1 into reciprocals of positive integers <= 16 Egyptian fraction.[6]
1012
[edit]1012 = 22 × 11 × 23. There are 1012 partitions of 1 into reciprocals of positive integers <= 17 Egyptian fraction.[6]
1013
[edit]1013 is a prime number, a Sophie Germain prime,[7] and a centered square number,[8]
1016
[edit]1016 = 23 × 127. It is stella octangula number and a member of the Mian–Chowla sequence.[9] There are 1016 surface points on a cube with edge-length 14.[10]
1019
[edit]1019 is a prime number, a Sophie Germain prime,[7] a safe prime,[11] and a Chen prime.
1021
[edit]1021 is a prime number, a Lucky prime, and a twin prime with 1019.
1023
[edit]1024
[edit]1025
[edit]1025 = 52 × 41. It is a Jacobsthal-Lucas number and the hypotenuse of a primitive Pythagorean triangle. It is a Proth number because 1025 = 210 + 1. It is a member of the Moser–de Bruijn sequence because its base-4 representation (1000014) contains only digits 0 and 1, or equivalently, it's a sum of distinct powers of 4 (45 + 40).
1028
[edit]1028 = 22 × 257. It is sum of totient function for first 58 integers. There are 1029 primes <= 213.[12]
1031
[edit]1031 is a prime number, a Sophie Germain prime,[7] a super-prime, and a Chen prime. It is the exponent and number of ones for the fifth base-10 repunit prime.[13]
1033
[edit]1033 is a prime number and an emirp. It forms a twin prime pair with 1031.
1035
[edit]1035 = 32 × 5 × 23. It is a hexagonal number[14] and the 45th triangular number.[15]
1039
[edit]1039 is a prime of the form 8n+7,[16] a Chen prime, and a Lucky prime. There are 1039 partitions of 30 that do not contain 1 as a part.[17]
1040
[edit]1040 = 24 × 5 × 13. There are 1040 pieces that could be seen in a 6 × 6 × 6× 6 Rubik's Tesseract.
1046
[edit]1046 = 2 × 523. It is a coefficient of f(q), the 3rd order mock theta function.[18]
1047
[edit]1047 = 3 × 349. There are 1047 ways to split a strict composition of 18 into contiguous subsequences that have the same sum.[19]
1049
[edit]1049 is a prime number, a Sophie Germain prime,[7] a highly cototient number,[20] and a Chen prime.
1051
[edit]1051 is a prime number, a centered pentagonal number,[21] and a centered decagonal number.
1056
[edit]1056 = 25 × 3 × 11. It is a pronic number.[22]
1060
[edit]1060 = 22 × 5 × 53. It is the sum of the first twenty-five primes from 2 through 97 (the number of primes less than 100)[23] and the sixth sum of 10 consecutive primes, starting with 23 through 131.[24]
1061
[edit]1061 is a prime number, an emirp, and a twin prime with 1063. There are 1061 prime numbers between 1000 and 10000 (or, number of four-digit primes in decimal representation).[25]
1063
[edit]1063 is a prime number, a super-prime, a twin prime with 1061, a near-wall-sun-sun prime.[26] and the sum of seven consecutive primes (137 + 139 + 149 + 151 + 157 + 163 + 167)
1069
[edit]1076
[edit]1076 = 22 × 269. There are 1076 strict trees weight 11.[28]
1078
[edit]1078 = 2 × 72 × 11. It is an Euler transform of negative integers.[29]
1080
[edit]1080 = 23 × 33 × 5. It is a pentagonal number[30] and a largely composite number.[31]
1081
[edit]1081 = 23 × 47. It is the 46th triangular number[15] and a member of Padovan sequence.[32]
1086
[edit]1086 = 2 × 3 × 181. It is a Smith number[33] and the sum of totient function for the first 59 integers.
1087
[edit]1087 is a prime number, a super-prime, a cousin prime, and a lucky prime.[34]
1089
[edit]1091
[edit]1091 is a prime number, a cousin prime, and a twin prime with 1093.
1093
[edit]1093 is a twin prime with 1091. Together with 1091 and 1097, it forms a prime triplet. It is a happy prime and a star[35] prime. It is also the smallest Wieferich prime. 1093 is a repunit prime in base 3 because:
1096
[edit]1096 = 23 × 137. There are 1096 strict solid partitions of 18.[36]
1097
[edit]1097 is a prime number, an emirp,[27] and a Chen prime.
1100 to 1199
[edit]1102
[edit]1102 = 2 × 19 × 29. It is the sum of the totient function for the first 60 integers.
1103
[edit]1103 is a prime number, a Sophie Germain prime,[7] and a balanced prime.[37]
1104
[edit]1104 = 24 × 3 × 23. It is a Keith number[38]
1105
[edit]1107
[edit]1107 = 33 × 41. There are 1107 non-isomorphic strict T0 multiset partitions of weight 8.[39]
1109
[edit]1109 is a Friedlander-Iwaniec prime[40] and a Chen prime.
1113
[edit]1113 = 3 × 7 × 53. There are 1113 strict partions of 40.[41]
1114
[edit]1114 = 2 × 557. There are 1114 ways to write 22 as an orderless product of orderless sums.[42]
1117
[edit]1117 is a Chen prime. There are 1117 diagonally symmetric polyominoes with 16 cells.[43]
1118
[edit]1118 = 2 × 13 × 43. There are 1118 unimodular 2 × 2 matrices having all terms in {0,1,...,21}.[44]
1119
[edit]1119 = 3 × 373. There are 1119 bipartite graphs with 9 nodes.[45]
1122
[edit]1122 = 2 × 3 × 11 × 17. It is a pronic number.[22]
1123
[edit]1123 is a balanced prime.[37]
1124
[edit]1124 = 22 × 281. It is a Leyland number[46] using 2 & 10: 1124 = 210 + 102. It is a spy number.
1126
[edit]1126 = 2 × 563. There are 1126 2 × 2 non-singular integer matrices with entries from {0, 1, 2, 3, 4, 5}.[47]
1127
[edit]1127 = 72 × 23. It is the maximum number of pieces that can be obtained by cutting an annulus with 46 cuts.[48]
1128
[edit]1128 = 23 × 3 × 47. It is the 47th triangular number[15] and the 24th hexagonal number.[14] 1128 is the dimensional representation of the largest vertex operator algebra with central charge of 24, D24.[49]
1151 is the first prime number following a prime gap of 22.[50] It is also a Chen prime.
1152
[edit]1152 = 27 × 32. It is a highly totient number,[51] a 3-smooth number, and an Achilles number.
1153
[edit]1153 is a super-prime and a Proth prime.[52]
1159
[edit]1159 = 19 × 61. It is a centered octahedral number[53] and a member of the Mian–Chowla sequence.[9]
1160
[edit]1160 = 23 × 5 × 29. It is an octagonal number.[54]
1161
[edit]1161 = 33 × 43. It is the sum of the first twenty-six primes.
1162
[edit]1162 = 2 × 7 × 83. It is the sum of the totient function for the first 61 integers and a pentagonal number.[30]
1163
1163 is a Chen prime.
1164
[edit]1164 = 22 × 3 × 97. There are 1164 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[55]
1169
[edit]1169 = 7 × 167. It is a highly cototient number[20]
1171
[edit]1171 is a super-prime.[citation needed]
1173
[edit]1173 = 3 × 17 × 23. There are 1173 simple triangulations on a plane with 9 nodes.[56]
1174
[edit]1174 = 2 × 587. There are 1174 widely totally strongly normal compositions of 16. (sequence A332337 in the OEIS).
1175
[edit]1175 = 52 × 47. It is the maximum number of pieces that can be obtained by cutting an annulus with 47 cuts.[48]
1176
[edit]1176 = 23 × 3 × 72. It is the 48th triangular number.[15]
1178
[edit]1178 = 2 × 19 × 31. There are 1178 surface points on a cube with edge-length 15.[10]
1179
[edit]1179 = 32 × 131. There are 1179 different permanents of binary 7 by 7 matrices.[57]
1182
[edit]1182 = 2 × 3 × 197. There are 1182 necklaces possible with 14 beads of 2 colors (that cannot be turned over).[58]
1184
[edit]1184 = 25 × 37. It is an amicable number with 1210.[59]
1186
[edit]1186 = 2 × 593. There are 1186 diagonally symmetric polyominoes with 15 cells.[43]
1187
[edit]1187 is a safe prime,[11] a Stern prime,[60] a balanced prime,[37] and a Chen prime.
1190
[edit]1190 = 2 × 5 × 7 × 17. It is a pronic number.[22] Building a 28-tier house of cards requires 1190 cards.[61]
1191
[edit]1191 = 3 × 397 = 352 - 35 + 1 = H35, the 35th Hogben number.[62]
1192
[edit]1192 = 23 × 149. It is the sum of the totient function for the first 62 integers.
1193
[edit]1193 is a Chen prime.
1198
[edit]1198 = 2 × 599. It is a centered heptagonal number.[63]
1200 to 1299
[edit]1200
[edit]1200 = 24 × 3 × 52. There are 1200 households in the Nielsen ratings sample.[64]
1200 is known as the long thousand or ten "long hundreds" of 120 each. It is the traditional reckoning of large numbers in Germanic languages.
1201
[edit]1201 is a super-prime, a centered square number,[8] and a centered decagonal number.
1202
[edit]1202 = 2 × 601. There are a maximum of 1202 regions when the plane is divided by 25 ellipses.[65]
1203
[edit]1203 = 3 × 401. It is the smallest number greater than 1000 in the coordinating sequence for the (2,6,∞) tiling of the hyperbolic plane.[66]
1204
[edit]1204 = 22 × 7 × 43. It is the magic constant for a 7 × 7 × 7 magic cube.[67]
1205
[edit]1205 = 5 × 241. There are 1205 partitions of 28 such that the number of odd parts is a part[68]
1207
[edit]1207 = 17 × 71. It is a composite de Polignac number.[69]
1208
[edit]1208 = 23 × 151. There are 1208 strict chains of divisors starting with the superprimorial A006939(3).[70]
1210
[edit]1210 = 2 × 5 × 112. It is an amicable number with 1184[71] and a Self-descriptive number.
1211
[edit]1211 = 7 × 173. It is a composite de Polignac number[69]
1212
[edit]1212 = 22 × 3 × 101 = , where is the number of partions of .[72]
1213
[edit]1213 is a prime number and an emirp.
1214
[edit]1214 = 2 × 607. It is a spy number and the sum of the first 39 composite numbers.[73]
1215
[edit]1215 = 35 × 5. There are 1215 edges in the hexagonal triangle T(27)[74]
1216
[edit]1216 = 26 × 19. It is a nonagonal number[75]
1217
[edit]1217 is a super-prime and a Proth prime.[52]
1219
[edit]1219 = 23 × 53. It is a centered triangular number[76] and a zero of Mertens function.
1220
[edit]1220 = 22 × 5 × 61. It is a zero of Mertens function. There are 1220 binary vectors of length 16 containing no singletons.[77]
1222
[edit]1222 = 2 × 13 × 47. It is a hexagonal pyramidal number.
1223
[edit]1223 is the 200th prime number.[37] It is also a Sophie Germain prime[7] and a balanced prime.
1224
[edit]1224 = 23 × 32 × 17. There are 1224 edges in the join of two cycle graphs, both of order 34.[78]
1225
[edit]1225 = 52 × 72 = 352. It is the smallest number greater than 1 to be a triangular number,[15] a square number and a hexagonal number.[14][79] It is the second square triangular number greater than 1.[80] It is the 49th triangular number, the 35th square number, the 25th hexagonal number, a centered octagonal number,[81] a 29-gonal number,[82] a 60-gonal number,[83] and a 124-gonal number. It is the sum of 5 consecutive odd cubes:
1225 = 13 + 33 + 53 + 73 + 93.
1226
[edit]1226 = 2 × 613. There are 1226 rooted identity trees with 15 nodes.[84]
1228
[edit]1228 = 22 × 307. It is the sum of the totient function for the first 63 integers.
1229
[edit]1229 is a Sophie Germain prime[7] and an emirp. There are 1229 primes less than 10,000.
1230
[edit]1230 = 2 × 3 × 5 × 41 = T(9, 6), the Mahonian number.[85]
1231
[edit]1231 is a prime number and an emirp.
1232
[edit]1232 = 24 × 7 × 11. There are 1232 labeled ordered set of partitions of a 7-set into odd parts.[86]
1234
[edit]1234 = 2 × 617. It has two distinct prime factors making it a squarefree semiprime. It is the smallest whole number containing all numbers from 1 to 4. There are 1234 parts in all partitions of 30 into distinct parts.[87] There are 1234 independent vertex sets in a 4×4 square grid. Equivalently, there are 1234 distinct 4×4 binary matrices in which no two adjacent elements are both equal to 1.
1240
[edit]1240 = 23 × 5 × 31. It is a square pyramidal number.[88]
1241
[edit]1241 = 17 × 73. It is a centered cube number[89] and a spy number.
1243
[edit]1243 = 11 × 113. It is a composite de Polignac number.[69]
1244
[edit]1244 = 22 × 311. There are 1244 complete partitions of 25.[90]
1245
[edit]1245 = 3 × 5 × 83. There are 1245 labeled spanning intersecting set-systems on 5 vertices.[91]
1247
[edit]1247 = 29 × 43. It is a pentagonal number.[30]
1249
[edit]1249 is a prime number, an emirp, and a trimorphic number.[92]
1257
[edit]1257 = 3 × 419. There are 1257 lattice points inside a circle of radius 20.[93]
1259
[edit]1259 is a prime number and a highly cototient number.[20]
1260
[edit]1260 = 22 × 32 × 5 × 7. It is a pronic number,[22] the smallest vampire number,[94] the 16th highly composite number,[95] and the sum of the totient function for the first 64 integers. There are 1260 strict partions of 41.[41]
1261
[edit]1261 = 13 × 97. It is a star number[35] and a zero of Mertens function.
1264
[edit]1264 = 24 × 79. It is the sum of the first 27 primes.
1265
[edit]1265 = 5 × 11 × 23. There are 1265 rooted trees with 43 vertices in which vertices at the same level have the same degree.[96]
1266
[edit]1266 = 2 × 3 × 211. It is a centered pentagonal number[21] and a zero of Mertens function.
1269
[edit]1269 = 33 × 47. Completing 11 revolutions in the Spiral of Theodorus requires 1269 triangles. [97]
1275
[edit]1275 = 3 × 52 × 17. It is the 50th triangular number.[15]
1276
[edit]1276 = 22 × 11 × 29. There are 1276 irredundant sets in the 25-cocktail party graph.[98]
1277
[edit]1277 is a prime number. It is the start of a prime constellation of length 9 (a "prime nonuple").
1278
[edit]1278 = 2 × 32 × 71. There are 1278 Narayana's cows and calves after 20 years.[99]
1279
[edit]1279 is a prime number and a Mersenne prime exponent.
1280
[edit]1280 = 28 × 5. There are 1280 parts in all compositions of 9.[100]
1281
[edit]1281 = 3 × 7 × 61. It is an octagonal number.[54]
1283
[edit]1283 is a safe prime.[11]
1284
[edit]1284 = 22 × 3 × 107 = 641 + 643, the sum of a twin prime pair.[101]
1285
[edit]1285 = 5 × 257. There are 1285 free nonominoes.
1286
[edit]1286 = 2 × 643. There are 1286 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.[102]
1288
[edit]1288 = 23 × 7 × 23. It is a heptagonal number.[103]
1289
[edit]1289 is Sophie Germain prime[7] and a twin prime with 1291. 1289 is a deficient number because the sum of all its positive divisors (except itself) totals less than 1289. 1289 is an evil number because it has an even number of 1's contained in its binary expansion.
1291
[edit]1291 is a twin prime with 1289.
1296
[edit]1296 = 24 × 34 = 64 = 362. It is the sum of the cubes of the first eight positive integers:
13 + 23 + 33 + 33 + 43 + 53 + 63 + 73 + 83 = 1296.
There are 1296 rectangles on a normal 8 × 8 chessboard. There are 1296 combinations of 2 alphanumeric characters.
1297
[edit]1297 is a super-prime, a pinwheel number,[104] and a zero of Mertens function.
1300 to 1399
[edit]1300
[edit]1300 = 22 × 52 × 13. It is a zero of Mertens function and the smallest even odd-factor hyperperfect number. It is the sum of the first 4 fifth powers:
1300 = 15 + 25 + 35 + 45.
1301
[edit]1301 is a prime number and a centered square number.[8] There are 1301 trees with 13 unlabeled nodes.[105]
1306
[edit]1306 = 2 × 653. It is a centered triangular number.[76]
1307
[edit]1307 is a safe prime.[11]
1308
[edit]1308 = 22 × 3 × 109. It is the sum of the totient function for the first 65 integers.
1312
[edit]1312 = 25 × 41. It is a member of the Mian-Chowla sequence.[9]
1319
[edit]1319 is a safe prime.[11]
1325
[edit]1325 = 52 × 53. It is a Markov number[106] and a centered tetrahedral number.[107]
1326
[edit]1326 = 2 × 3 × 13 × 17. It is the 51st triangular number[15] and a hexagonal number.[14]
1327
[edit]1327 is the smallest prime number preceding a prime gap of 34.
1328
[edit]1328 = 24 × 83. It is the sum of the totient function for the first 66 integers.
1330
[edit]1330 = 2 × 5 × 7 × 19. It is a tetrahedral number.[108] It forms a Ruth–Aaron pair with 1331 under second definition.
1331
[edit]1331 = 113. It is a centered heptagonal number.[63] It forms a Ruth–Aaron pair with 1330 under second definition.
1335
[edit]1335 = 3 × 5 × 89. It is a pentagonal number.[30]
1342
[edit]1342 = 2 × 11 × 61 = .[109]
1346
[edit]1346 = 2 × 673. There are 1346 locally disjointed rooted trees with 10 nodes.[110]
1350
[edit]1350 = 2 × 33 × 52. It is a nonagonal number.[75]
1361
[edit]1361 is first prime number following a prime gap of 34[50] and the 3rd Mills' prime. It is a centered decagonal number
1364
[edit]1364 = 22 × 11 × 31. It is a Lucas number.[111]
1365
[edit]1365 = 3 × 5 × 7 × 13. It is a pentatope number.[112]
1367
[edit]1367 is a safe prime[11] and a balanced prime. It is the 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),[37]
1371
[edit]1371 = 3 × 457. It is the sum of the first 28 primes.
1377
[edit]1377 = 34 × 17. It is the maximal number of pieces that can be obtained by cutting an annulus with 51 cuts[48]
1378
[edit]1378 = 2 × 13 × 53. It is the 52nd triangular number[15]
1379
[edit]1379 = 7 × 197. It is the magic constant of n × n normal magic square and n-queens problem for n = 14.
1380
[edit]1380 = 22 × 3 × 5 × 23. There are 1380 8-step mappings with 4 inputs.[113]
1381
[edit]1381 is a prime number and a centered pentagonal number.[21]
1384
[edit]1384 = 23 × 173 = [109]
1385
[edit]1385 = 5 × 277. It is an up/down number.[114]
1387
[edit]1387 = 19 × 73. It is the 5th Fermat pseudoprime of base 2,[115] the 22nd centered hexagonal number, the 19th decagonal number,[116] and the second Super-Poulet number.[117]
1388
[edit]1388 = 22 × 347. Because 1388 = 4 × 192 - 3 × 19 + 1, is on the x-axis of Ulams spiral.[118]
1394
[edit]1394 = 2 × 17 × 41. It is the sum of the totient function for the first 67 integers.
1395
[edit]1395 = 32 × 5 × 19. It is a vampire number[94] and a member of the Mian–Chowla sequence[9]
1396
[edit]1396 = 22 × 349. It is a centered triangular number.[76]
1399
[edit]1399 is a prime number and an emirp.[119]
1400 to 1499
[edit]1403
[edit]1403 = 23 × 61. It is the smallest number x such that M(x) = 11, where M() is Mertens function[120]
1404
[edit]1404 = 22 × 32 × 13. It is a heptagonal number.[103]
1405
[edit]1405 = 5 × 281 = 262 + 272 = 72 + 82 + ... + 162. It is a centered square number[8]
1406
[edit]1406 = 2 × 19 × 37. It is a semi-meandric number.[121]
1409
[edit]1409 is a super-prime, a Sophie Germain prime,[7] and a Proth prime.[52]
1410
[edit]1410 = 2 × 3 × 5 × 47. It is the denominator of the 46th Bernoulli number[122]
1418
[edit]1418 = 2 × 709. It is the smallest number x such that M(x) = 13, where M() is Mertens function[120]
1425
[edit]1425 = 3 × 52 × 19. It is a self-descriptive number in base 5.
1426
[edit]1426 = 2 × 23 × 31. It is a pentagonal number[30] and the sum of the totient function for the first 68 integers. There are 1426 strict partions of 42.[41]
1427
[edit]1427 is a twin prime with 1429.[123]
1428
[edit]1428 = 22 × 3 × 7 × 17. There are 1428 complete ternary trees with 6 internal nodes or, equivalently, 18 edges.[124]
1429
[edit]1429 is a twin prime with 1427.[123]
1430
[edit]1430 = 2 × 5 × 11 × 13. It is a Catalan number.[125]
1431
[edit]1431 = 33 × 53. It is the 53rd triangular number[15] and a hexagonal number.[14]
1432
[edit]1432 = 23 × 179. It is a member of the Padovan sequence.[32]
1433
[edit]1433 is a super-prime.[126]
1435
[edit]1435 = 5 × 7 × 41. It is a vampire number.[94]
1436
[edit]1436 = 22 × 359. It is the discriminant of a totally real cubic field.[127]
1439
[edit]1440
[edit]1440 = 25 × 32 × 5. It is a highly totient number.[51]
1441
[edit]1441 = 11 × 131. It is a star number.[35]
1447
[edit]1447 is a super-prime number and a happy number.
1451
[edit]1451 is a Sophie Germain prime.[7]
1452
[edit]1452 = 22 × 3 × 112. It is the first Zagreb index of the complete graph K12.
1453
1453 is a Sexy prime with 1459.
1458
[edit]1458 = 2 × 36. It is the maximum determinant of an 11 by 11 matrix of zeroes and ones[128] and a 3-smooth number.
1458 is one of three numbers which, when its base 10 digits are added together, produces a sum which, when multiplied by its reversed self, yields the original number:
1459
[edit]1459 is a Sexy prime with 1453 and a Pierpont prime. It is the sum of nine consecutive primes:
1459 = 139 + 149 + 151 + 157 + 163 + 167 + 173 + 179 + 181.
1462
[edit]1462 = 2 × 17 × 43. Because 1462 = (35 - 1) × (35 + 8), it is the first Zagreb index of the wheel graph with 35 vertices[130]
1467
[edit]1467 = 32 × 163. There are 1467 partitions of 39 with zero crank.[131]
1469
[edit]1469 = 13 × 113. It is an octahedral number[132] and a highly cototient number.[20]
1470
[edit]1470 = 2 × 3 × 5 × 72. It is the sum of the totient function for the first 69 integers.
1471
[edit]1471 is a super-prime number and a centered heptagonal number.[63]
1480
[edit]1480 = 23 × 5 × 37. It is the sum of the first 29 primes.
1481
[edit]1481 is a Sophie Germain prime.[7]
1485
[edit]1485 = 33 × 5 × 11. It is the 54th triangular number.[15]
1486
[edit]1486 = 2 × 743. There are 1486 strict solid partitions of 19.[36]
1487
[edit]1487 is a safe prime.[11]
1489
[edit]1489 is a prime number and a centered triangular number.[76]
1490
[edit]1490 = 2 × 5 × 149. It is a tetranacci number.[133]
1491
[edit]1491 = 3 × 7 × 71. It is a nonogonal number.[75]
1492
[edit]1492 = 22 × 373. It is the discriminant of a totally real cubic field.[127]
1493
[edit]1493 is a Stern prime.[60]
1494
[edit]1494 = 2 × 32 × 83. It is the sum of the totient function for the first 70 integers.
1496
[edit]1496 = 23 × 11 × 17. It is a square pyramidal number.[88]
1499
[edit]1499 is a Sophie Germain prime[7] and a super-prime.
1500 to 1599
[edit]1500
[edit]1500 = 22 × 3 × 53. It is the hypotenuse of three different Pythagorean triangles.[134]
1501
[edit]1501 = 19 × 79. It is a centered pentagonal number.[21]
1503
[edit]1503 = 32 × 167. Completing 12 revolutions of the Spiral of Theodorus requires 1503 triangles.[97]
1510
[edit]1510 = 2 × 5 × 151. 1510 is an untouchable number.
1511
[edit]1513
[edit]1513 = 17 × 89. It is a centered square number.[8]
1520
[edit]1520 = 24 × 5 × 19. It is a pentagonal number.[30] It forms a Ruth–Aaron pair with 1521 under the second definition.
1521
[edit]1521 = 32 × 132 = 392. It is a centered octagonal number.[81] It forms a Ruth–Aaron pair with 1520 under the second definition.
1523
[edit]1523 is a super-prime, a safe prime,[11] and a member of the Mian–Chowla sequence.[9]
1525
[edit]1525 = 52 × 61. It is a heptagonal number.[103]
1526
[edit]1526 = 2 × 7 × 109. There are 1526 conjugacy classes in the alternating group A27.[135]
1529
[edit]1529 = 11 × 139. It is a composite de Polignac number.[69]
1530
[edit]1530 = 2 × 32 × 5 × 17. It is a vampire number.[94]
1531
[edit]1531 is a prime number and a centered decagonal number.
1532
[edit]1532 = 22 × 383. There are 1532 series-parallel networks with 9 unlabeled edges,[136]
1535
[edit]1535 = 5 × 307. It is a Thabit number.
1537
[edit]1537 = 29 × 53. It is a Keith number.[38]
1539
[edit]1539 = 34 × 19. A maximum of 1539 pieces can be obtained by cutting an annulus with 54 cuts.[48]
1540
[edit]1540 = 22 × 5 × 7 × 11. It is the 55th triangular number,[15] a hexagonal number,[14] a decagonal number,[116] and a tetrahedral number.[108]
1541
[edit]1541 = 23 × 67. It is an octagonal number.[54]
1549
[edit]1549 is a de Polignac prime.[137]
1557
[edit]1557 = 32 × 173. There are 1557 graphs with 8 nodes and 13 edges.[138]
1559
[edit]1559 is a Sophie Germain prime.[7]
1561
[edit]1561 = 7 × 223. It is a centered octahedral number.[53]
1564
[edit]1564 = 22 × 17 × 23. It is the sum of the totient function for the first 71 integers.
1572
[edit]1572 = 22 × 3 × 131. It is a member of the Mian–Chowla sequence.[9]
1573
[edit]1573 = 112 × 13. It is the discriminant of a totally real cubic field.[127]
1583
[edit]1583 is a Sophie Germain prime.
1585
[edit]1585 = 5 × 307. It is a centered triangular number.[76]
1588
[edit]1588 = 22 × 397. It is the sum of the totient function for the first 72 integers.
1589
[edit]1589 = 7 × 227. It is a composite de Polignac number.[69]
1593
[edit]1593 = 33 × 59. It is the sum of the first 30 primes.
1594
[edit]1594 = 2 × 797. It is the minimal cost of a maximum height Huffman tree of size 17.[139]
1596
[edit]1596 = 22 × 3 × 7 × 19. It is the 56th triangular number.[15]
1597
1597 is a super-prime, a Fibonacci prime,[140] a Markov prime,[106] and an emirp.
1600 to 1699
[edit]- 1601 = Sophie Germain prime, Proth prime,[52]
- 1607 = member of prime triple with 1609 and 1613[141]
- 1617 = pentagonal number[30]
- 1618 = centered heptagonal number[63]
- 1619 = palindromic prime in binary, safe prime[11]
- 1621 = super-prime, pinwheel number[104]
- 1624 = number of squares in the Aztec diamond of order 28[142]
- 1625 = centered square number[8]
- 1626 = centered pentagonal number[21]
- 1633 = star number[35]
- 1634 = the smallest four-digit Narcissistic number in base 10
- 1637 = prime island: least prime whose adjacent primes are exactly 30 apart[143]
- 1638 = harmonic divisor number,[144]
- 1639 = nonagonal number[75]
- 1640 = pronic number[22]
- 1645 = number of 16-celled pseudo still lifes in Conway's Game of Life, up to rotation and reflection[145]
- 1646 = number of graphs with 8 nodes and 14 edges[138]
- 1649 = highly cototient number,[20] Leyland number[46] using 4 & 5 (45 + 54)
- 1651 = heptagonal number[103]
- 1653 = 57th triangular number,[15] hexagonal number,[14]
- 1657 = cuban prime,[146]
- 1660 = sum of totient function for first 73 integers
- 1665 = centered tetrahedral number[107]
- 1669 = super-prime, smallest prime with a gap of exactly 24 to the next prime[147]
- 1676 = number of partitions of 34 into parts each of which is used a different number of times[148]
- 1679 = highly cototient number,[20] semiprime (23 × 73, see also Arecibo message),
- 1680 = the 17th highly composite number,[95]
- 1681 = 412, smallest number yielded by the formula n2 + n + 41 that is not a prime; centered octagonal number[81]
- 1682 and 1683 is a member of a Ruth–Aaron pair (first definition)
- 1684 = centered triangular number[76]
- 1691 = the same upside down, which makes it a strobogrammatic number[149]
- 1695 = magic constant of n × n normal magic square and n-queens problem for n = 15.
- 1696 = sum of totient function for first 74 integers
1700 to 1799
[edit]- 1705 = tribonacci number[150]
- 1710 = maximal number of pieces that can be obtained by cutting an annulus with 57 cuts[48]
- 1711 = 58th triangular number,[15] centered decagonal number
- 1712 = number of irredundant sets in the 29-cocktail party graph[98]
- 1713 = number of aperiodic rooted trees with 12 nodes[151]
- 1717 = pentagonal number[30]
- 1719 = composite de Polignac number[69]
- 1720 = sum of the first 31 primes
- 1721 = twin prime[152]
- 1722 = Giuga number,[153] pronic number[22]
- 1723 = super-prime
- 1728 = the quantity expressed as 1000 in duodecimal, that is, the cube of twelve (called a great gross), and so, the number of cubic inches in a cubic foot, palindromic in base 11 (133111) and 23 (36323)
- 1729 = taxicab number, Carmichael number, Zeisel number, centered cube number, Hardy–Ramanujan number. In the decimal expansion of e the first time all 10 digits appear in sequence starts at the 1729th digit (or 1728th decimal place). In 1979 the rock musical Hair closed on Broadway in New York City after 1729 performances. Palindromic in bases 12, 32, 36.
- 1733 = Sophie Germain prime, palindromic in bases 3, 18, 19.
- 1736 = sum of totient function for first 75 integers, number of surface points on a cube with edge-length 18[10]
- 1740 = number of squares in the Aztec diamond of order 29[142]
- 1741 = super-prime, centered square number[8]
- 1743 = wiener index of the windmill graph D(3,21)[154]
- 1747 = balanced prime[37]
- 1750 = hypotenuse in three different Pythagorean triangles[134]
- 1753 = balanced prime[37]
- 1756 = centered pentagonal number[21]
- 1757 = least number of triangles of the Spiral of Theodorus to complete 13 revolutions[97]
- 1759 = de Polignac prime[137]
- 1765 = number of stacks, or planar partitions of 15[155]
- 1769 = maximal number of pieces that can be obtained by cutting an annulus with 58 cuts[48]
- 1770 = 59th triangular number,[15] hexagonal number,[14]
- 1771 = tetrahedral number[108]
- 1772 = centered heptagonal number,[63] sum of totient function for first 76 integers
- 1776 = 24th square star number.[156] The number of pieces that could be seen in a 7 × 7 × 7× 7 Rubik's Tesseract.
- 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[157]
- 1782 = heptagonal number[103]
- 1783 = de Polignac prime[137]
- 1785 = square pyramidal number,[88] triangular matchstick number[158]
- 1786 = centered triangular number[76]
- 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[159]
- 1792 = Granville number
- 1794 = nonagonal number,[75] number of partitions of 33 that do not contain 1 as a part[17]
1800 to 1899
[edit]- 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)[146]
- 1803 = number of decahexes that tile the plane isohedrally but not by translation or by 180-degree rotation (Conway criterion)[160]
- 1806 = pronic number,[22] product of first four terms of Sylvester's sequence, primary pseudoperfect number,[161] only number for which n equals the denominator of the nth Bernoulli number,[162] Schröder number[163]
- 1807 = fifth term of Sylvester's sequence[164]
- 1809 = sum of first 17 super-primes[165]
- 1811 = Sophie Germain prime
- 1820 = pentagonal number,[30] pentatope number,[112] number of compositions of 13 whose run-lengths are either weakly increasing or weakly decreasing[166]
- 1821 = member of the Mian–Chowla sequence[9]
- 1823 = super-prime, safe prime[11]
- 1825 = octagonal number[54]
- 1827 = vampire number[94]
- 1828 = meandric number, open meandric number, appears twice in the first 10 decimal digits of e
- 1829 = composite de Polignac number[69]
- 1830 = 60th triangular number[15]
- 1831 = smallest prime with a gap of exactly 16 to next prime (1847)[167]
- 1832 = sum of totient function for first 77 integers
- 1833 = number of atoms in a decahedron with 13 shells[168]
- 1834 = octahedral number,[132] sum of the cubes of the first five primes
- 1835 = absolute value of numerator of [169]
- 1837 = star number[35]
- 1841 = solution to the postage stamp problem with 3 denominations and 29 stamps,[170]
- 1842 = number of unlabeled rooted trees with 11 nodes[171]
- 1847 = super-prime
- 1851 = sum of the first 32 primes
- 1853 = sum of primitive roots of 27-th prime,[172] Mertens function zero
- 1854 = number of permutations of 7 elements with no fixed points,[173] Mertens function zero
- 1855 = rencontres number: number of permutations of [7] with exactly one fixed point[174]
- 1856 = sum of totient function for first 78 integers
- 1857 = Mertens function zero, pinwheel number[104]
- 1858 = number of 14-carbon alkanes C14H30 ignoring stereoisomers[175]
- 1859 = composite de Polignac number[69]
- 1860 = number of squares in the Aztec diamond of order 30[176]
- 1861 = centered square number,[8] Mertens function zero
- 1862 = forms a Ruth–Aaron pair with 1863 under second definition
- 1863 = forms a Ruth–Aaron pair with 1862 under second definition
- 1865 = 123456: Largest senary metadrome (number with digits in strict ascending order in base 6)[177]
- 1866 = number of plane partitions of 16 with at most two rows[178]
- 1867 = prime de Polignac number[137]
- 1868 = smallest number of complexity 21: smallest number requiring 21 1's to build using +, * and ^[179]
- 1870 = decagonal number[116]
- 1871 = the first prime of the 2 consecutive twin prime pairs: (1871, 1873) and (1877, 1879)[180]
- 1872 = first Zagreb index of the complete graph K13[181]
- 1873 = number of Narayana's cows and calves after 21 years[99]
- 1880 = the 10th element of the self convolution of Lucas numbers[182]
- 1882 = number of linearly separable Boolean functions in 4 variables[183]
- 1883 = number of conjugacy classes in the alternating group A28[135]
- 1887 = number of edges in the hexagonal triangle T(34)[74]
- 1889 = Sophie Germain prime, highly cototient number[20]
- 1891 = 61st triangular number,[15] sum of 5 consecutive primes (367 + 373 + 379 + 383 + 389) hexagonal number,[14] centered pentagonal number,[21] centered triangular number[76]
- 1892 = pronic number[22]
- 1894 = maximal number of regions the plane is divided into by drawing 44 circles[184]
- 1896 = member of the Mian-Chowla sequence[9]
- 1897 = member of Padovan sequence,[32] number of triangle-free graphs on 9 vertices[185]
1900 to 1999
[edit]- 1901 = Sophie Germain prime, centered decagonal number
- 1902 = number of symmetric plane partitions of 27[186]
- 1903 = generalized Catalan number[187]
- 1905 = Fermat pseudoprime[188]
- 1907 = safe prime,[11] balanced prime[37]
- 1908 = coreful perfect number[189]
- 1909 = hyperperfect number[190]
- 1911 = heptagonal pyramidal number[191]
- 1912 = size of 6th maximum raising after one blind in pot-limit poker[192]
- 1913 = super-prime, Honaker prime[126]
- 1915 = number of nonisomorphic semigroups of order 5[193]
- 1917 = number of partitions of 51 into pairwise relatively prime parts[194]
- 1918 = heptagonal number[103]
- 1919 = smallest number with reciprocal of period length 36 in base 10[195]
- 1926 = pentagonal number[30]
- 1931 = Sophie Germain prime
- 1933 = centered heptagonal number,[63]
- 1934 = sum of totient function for first 79 integers
- 1941 = maximal number of regions obtained by joining 16 points around a circle by straight lines[196]
- 1948 = number of strict solid partitions of 20[36]
- 1951 = cuban prime[146]
- 1952 = number of covers of {1, 2, 3, 4}[197]
- 1953 = hexagonal prism number,[198] 62nd triangular number[15]
- 1955 = number of partitions of 25 with at least one distinct part[199]
- 1956 = nonagonal number[75]
- 1957 = = total number of ordered k-tuples (k=0,1,2,3,4,5,6) of distinct elements from an 6-element set[200]
- 1958 = number of partitions of 25[201]
- 1960 = number of parts in all partitions of 33 into distinct parts[87]
- 1961 = number of lattice points inside a circle of radius 25[93]
- 1962 = number of edges in the join of the complete graph K36 and the cycle graph C36[202]
- 1963! - 1 is prime[203]
- 1964 = number of linear forests of planted planar trees with 8 nodes[204]
- 1965 = total number of parts in all partitions of 17[205]
- 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[206]
- σ(1968) = σ(1967) + σ(1966)[207]
- 1969 = Only value less than four million for which a "mod-ification" of the standard Ackermann Function does not stabilize[208]
- 1970 = number of compositions of two types of 9 having no even parts[209]
- 1972 = n such that is prime[210]
- 1973 = Sophie Germain prime, Leonardo prime
- 1974 = number of binary vectors of length 17 containing no singletons[77]
- 1975 = number of partitions of 28 with nonnegative rank[211]
- 1976 = octagonal number[54]
- 1977 = number of non-isomorphic multiset partitions of weight 9 with no singletons[212]
- 1979 = number of squares between 452 and 454,[152] smallest number that is the sum of 4 positive cubes in at least 4 ways[213]
- 1980 = pronic number,[22] highly abundant number with a greater sum of proper divisors than all smaller numbers[214]
- 1984 = 11111000000 in binary, nonunitary perfect number,[215] see also: 1984 (disambiguation)
- 1985 = centered square number[8]
- 1986 = number of ways to write 25 as an orderless product of orderless sums[42]
- 1987 = 300th prime number
- 1988 = sum of the first 33 primes,[216] sum of the first 51 composite numbers[217]
- 1990 = Stella octangula number
- 1991 = 11 × 181, the 46th Gullwing number,[218] palindromic composite number with only palindromic prime factors[219]
- 1992 = number of nonisomorphic sets of nonempty subsets of a 4-set[220]
- 1999 = centered triangular number,[76] number of regular forms in a myriagram.
Prime numbers
[edit]There are 135 prime numbers between 1000 and 2000:[221][222]
- 1009, 1013, 1019, 1021, 1031, 1033, 1039, 1049, 1051, 1061, 1063, 1069, 1087, 1091, 1093, 1097, 1103, 1109, 1117, 1123, 1129, 1151, 1153, 1163, 1171, 1181, 1187, 1193, 1201, 1213, 1217, 1223, 1229, 1231, 1237, 1249, 1259, 1277, 1279, 1283, 1289, 1291, 1297, 1301, 1303, 1307, 1319, 1321, 1327, 1361, 1367, 1373, 1381, 1399, 1409, 1423, 1427, 1429, 1433, 1439, 1447, 1451, 1453, 1459, 1471, 1481, 1483, 1487, 1489, 1493, 1499, 1511, 1523, 1531, 1543, 1549, 1553, 1559, 1567, 1571, 1579, 1583, 1597, 1601, 1607, 1609, 1613, 1619, 1621, 1627, 1637, 1657, 1663, 1667, 1669, 1693, 1697, 1699, 1709, 1721, 1723, 1733, 1741, 1747, 1753, 1759, 1777, 1783, 1787, 1789, 1801, 1811, 1823, 1831, 1847, 1861, 1867, 1871, 1873, 1877, 1879, 1889, 1901, 1907, 1913, 1931, 1933, 1949, 1951, 1973, 1979, 1987, 1993, 1997, 1999
Notes
[edit]References
[edit]- ↑ "chiliad". Merriam-Webster.
{{cite web}}: CS1 maint: url-status (link) - ↑ Sloane, N. J. A. (ed.). "Sequence A195163 (1000-gonal numbers: a(n) equal to n*(499*n - 498))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A122189 (Heptanacci numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A036063 (Increasing gaps among twin primes: size)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ 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.
- 1 2 Sloane, N. J. A. (ed.). "Sequence A020473 (Egyptian fractions: number of partitions of 1 into reciprocals of positive integers <= n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 Sloane, N. J. A. (ed.). "Sequence A005384 (Sophie Germain primes p: 2p+1 is also prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- 1 2 3 4 5 6 7 8 9 Sloane, N. J. A. (ed.). "Sequence A001844 (Centered square numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- 1 2 3 4 5 6 7 8 Sloane, N. J. A. (ed.). "Sequence A005282 (Mian-Chowla sequence)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- 1 2 3 Sloane, N. J. A. (ed.). "Sequence A005897 (6*n^2 + 2 for n > 0)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- 1 2 3 4 5 6 7 8 9 10 11 12 Sloane, N. J. A. (ed.). "Sequence A005385 (Safe primes p: (p-1)/2 is also prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A007053 (Number of primes <= 2^n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ 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.
- 1 2 3 4 5 6 7 8 9 Sloane, N. J. A. (ed.). "Sequence A000384 (Hexagonal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 Sloane, N. J. A. (ed.). "Sequence A000217 (Triangular numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A007522 (Primes of the form 8n+7, that is, primes congruent to -1 mod 8)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 10 October 2023.
- 1 2 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.
- ↑ Sloane, N. J. A. (ed.). "Sequence A000025 (Coefficients of the 3rd-order mock theta function f(q))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A336130 (Number of ways to split a strict composition of n into contiguous subsequences all having the same sum)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- 1 2 3 4 5 6 7 Sloane, N. J. A. (ed.). "Sequence A100827 (Highly cototient numbers: records for a(n) in A063741)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- 1 2 3 4 5 6 7 Sloane, N. J. A. (ed.). "Sequence A005891 (Centered pentagonal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- 1 2 3 4 5 6 7 8 9 Sloane, N. J. A. (ed.). "Sequence A002378 (Oblong (or promic, pronic, or heteromecic) numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A007504 (Sum of the first n primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A127337 (Numbers that are the sum of 10 consecutive primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A006879 (Number of primes with n digits.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A347565 (Primes p such that A241014(A000720(p)) is +1 or -1)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- 1 2 Sloane, N. J. A. (ed.). "Sequence A006567 (Emirps (primes whose reversal is a different prime))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A273873 (Number of strict trees of weight n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A073592 (Euler transform of negative integers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- 1 2 3 4 5 6 7 8 9 10 Sloane, N. J. A. (ed.). "Sequence A000326 (Pentagonal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A067128 (Ramanujan's largely composite numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- 1 2 3 Sloane, N. J. A. (ed.). "Sequence A000931 (Padovan sequence)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A006753 (Smith numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A031157 (Numbers that are both lucky and prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- 1 2 3 4 5 Sloane, N. J. A. (ed.). "Sequence A003154 (Centered 12-gonal numbers. Also star numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- 1 2 3 Sloane, N. J. A. (ed.). "Sequence A323657 (Number of strict solid partitions of n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- 1 2 3 4 5 6 7 8 9 Sloane, N. J. A. (ed.). "Sequence A006562 (Balanced primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- 1 2 Sloane, N. J. A. (ed.). "Sequence A007629 (Repfigit (REPetitive FIbonacci-like diGIT) numbers (or Keith numbers))". 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.
- ↑ 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.
- 1 2 3 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.
- 1 2 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.
- 1 2 Sloane, N. J. A. (ed.). "Sequence A006748 (Number of diagonally symmetric polyominoes with n cells)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ 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.
- 1 2 Sloane, N. J. A. (ed.). "Sequence A076980 (Leyland numbers: 3, together with numbers expressible as n^k + k^n nontrivially, i.e., n,k > 1 (to avoid n = (n-1)^1 + 1^(n-1)))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ 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.
- 1 2 3 4 5 6 Sloane, N. J. A. (ed.). "Sequence A000096 (n*(n+3)/2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Van Ekeren, Jethro; Lam, Ching Hung; Möller, Sven; Shimakura, Hiroki (2021). "Schellekens' list and the very strange formula". Advances in Mathematics. 380 107567. Amsterdam: Elsevier. arXiv:2005.12248. doi:10.1016/j.aim.2021.107567. MR 4200469. S2CID 218870375. Zbl 1492.17027.
- 1 2 "Sloane's A000101 : Increasing gaps between primes (upper end)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 10 July 2016.
- 1 2 "Sloane's A097942 : Highly totient numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.
- 1 2 3 4 "Sloane's A080076 : Proth primes". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.
- 1 2 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.
- 1 2 3 4 5 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.
- ↑ Sloane, N. J. A. (ed.). "Sequence A055887 (Number of ordered partitions of partitions)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ "A000256 - OEIS". oeis.org.
- ↑ "1179 (number)". The encyclopedia of numbers.
- ↑ "A000031 - OEIS". oeis.org.
- ↑ Higgins, Peter (2008). Number Story: From Counting to Cryptography. New York: Copernicus. p. 61. ISBN 978-1-84800-000-1.
- 1 2 "Sloane's A042978 : Stern primes". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.
- ↑ Sloane, N. J. A. (ed.). "Sequence A005449 (Second pentagonal numbers: n*(3*n + 1)/2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A002061 (Central polygonal numbers: n^2 - n + 1)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- 1 2 3 4 5 6 Sloane, N. J. A. (ed.). "Sequence A069099 (Centered heptagonal numbers)". 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 & Littlefield, 2005
- ↑ Sloane, N. J. A. (ed.). "Sequence A051890 (2*(n^2 - n + 1))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ "A265070 - OEIS". oeis.org.
- ↑ "1204 (number)". The encyclopedia of numbers.
- ↑ 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.
- 1 2 3 4 5 6 7 8 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.
- ↑ Sloane, N. J. A. (ed.). "Sequence A053767 (Sum of first n composite numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- 1 2 Sloane, N. J. A. (ed.). "Sequence A140091 (3*n*(n + 3)/2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- 1 2 3 4 5 6 "Sloane's A001106 : 9-gonal (or enneagonal or nonagonal) numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.
- 1 2 3 4 5 6 7 8 9 Sloane, N. J. A. (ed.). "Sequence A005448 (Centered triangular numbers: 3n(n-1)/2 + 1)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- 1 2 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, N. J. A. (ed.). "Sequence n*(n+2)". 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.
- ↑ "A046177 - OEIS". oeis.org. Retrieved 18 December 2024.
- 1 2 3 "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.
- ↑ Sloane, N. J. A. (ed.). "Sequence A303815 (Generalized 29-gonal (or icosienneagonal) numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A249911 (60-gonal (hexacontagonal) numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ "A004111 - OEIS". oeis.org.
- ↑ 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.
- 1 2 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.
- 1 2 3 Sloane, N. J. A. (ed.). "Sequence A000330 (Square pyramidal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ "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
- ↑ "Sloane's A033819 : Trimorphic numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.
- 1 2 Sloane, N. J. A. (ed.). "Sequence A000328". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- 1 2 3 4 5 "Sloane's A014575 : Vampire numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.
- 1 2 "Sloane's A002182 : Highly composite numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.
- ↑ 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.
- 1 2 3 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.
- 1 2 Sloane, N. J. A. (ed.). "Sequence A084849 (1 + n + 2*n^2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- 1 2 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 A054735 (Sums of twin prime pairs)". 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.
- 1 2 3 4 5 6 Sloane, N. J. A. (ed.). "Sequence A000566 (Heptagonal numbers (or 7-gonal numbers): n*(5*n-3)/2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- 1 2 3 Sloane, N. J. A. (ed.). "Sequence A059993 (Pinwheel numbers: 2*n^2 + 6*n + 1)". 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.
- 1 2 "Sloane's A002559 : Markoff (or Markov) numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.
- 1 2 Sloane, N. J. A. (ed.). "Sequence A005894 (Centered tetrahedral numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- 1 2 3 "Sloane's A000292 : Tetrahedral numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.
- 1 2 Sloane, N. J. A. (ed.). "Sequence A024916 (Sum_1^n sigma(k))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ "A316473 - OEIS". oeis.org.
- ↑ Sloane, N. J. A. (ed.). "Sequence A000032 (Lucas numbers: L(n-1) + L(n-2))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- 1 2 "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 A005945 (Number of n-step mappings with 4 inputs)". 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's A001567 : Fermat pseudoprimes to base 2". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.
- 1 2 3 "Sloane's A001107 : 10-gonal (or decagonal) numbers". 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 A109308 (Lesser emirps (primes whose digit reversal is a larger prime))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- 1 2 Sloane, N. J. A. (ed.). "Sequence A051400 (Smallest value of x such that M(x) equals n, where M() is Mertens's function A002321)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ "Sloane's A000682 : Semimeanders". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.
- ↑ Sloane, N. J. A. (ed.). "Sequence A002445 (Denominators of Bernoulli numbers B_{2n})". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- 1 2 Sloane, N. J. A. (ed.). "Sequence A001359 (Lesser of twin primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A001764 (binomial(3*n,n)/(2*n+1) (enumerates ternary trees and also noncrossing trees))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ "Sloane's A000108 : Catalan numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.
- 1 2 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.
- 1 2 3 Sloane, N. J. A. (ed.). "Sequence A006832 (Discriminants of totally real cubic fields)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Hadamard, J. (1893), "Résolution d'une question relative aux déterminants", Bulletin des Sciences Mathématiques, 17: 240–246
- ↑ Fujiwara, M. (2005), Introduction to Truly Beautiful Mathematics, pp. 100–101
- ↑ Sloane, N. J. A. (ed.). "Sequence A028569 (n*(n + 9))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A064410 (Number of partitions of n with zero crank)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- 1 2 "Sloane's A005900 : Octahedral numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.
- ↑ "Sloane's A000078 : Tetranacci numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.
- 1 2 Sloane, N. J. A. (ed.). "Sequence A084647 (Hypotenuses for which there exist exactly 3 distinct integer triangles)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- 1 2 Sloane, N. J. A. (ed.). "Sequence A000702 (number of conjugacy classes in the alternating group A_n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A000084 (Number of series-parallel networks with n unlabeled edges. Also called yoke-chains by Cayley and MacMahon)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- 1 2 3 4 Sloane, N. J. A. (ed.). "Sequence A065381 (Primes not of the form p + 2^k)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- 1 2 Sloane, N. J. A. (ed.). "Sequence A008406 (Triangle T(n,k) read by rows, giving number of graphs with n nodes and k edges))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A006327 (Fibonacci(n) - 3. Number of total preorders)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ "Sloane's A000045 : Fibonacci numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.
- ↑ Sloane, N. J. A. (ed.). "Sequence A022004 (Initial members of prime triples (p, p+2, p+6))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- 1 2 Sloane, N. J. A. (ed.). "Sequence A046092 (4 times triangular numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A046931 (Prime islands: least prime whose adjacent primes are exactly 2n apart)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ "Sloane's A001599 : Harmonic or Ore numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.
- ↑ Sloane, N. J. A. (ed.). "Sequence A056613 (Number of n-celled pseudo still lifes in Conway's Game of Life, up to rotation and reflection)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- 1 2 3 "Sloane's A002407 : Cuban primes". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.
- ↑ Sloane, N. J. A. (ed.). "Sequence A000230 (smallest prime p such that there is a gap of exactly 2n between p and next prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A098859 (Number of partitions of n into parts each of which is used a different number of times)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A000787 (Strobogrammatic numbers: the same upside down)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ "Sloane's A000073 : Tribonacci numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.
- ↑ Sloane, N. J. A. (ed.). "Sequence A301700 (Number of aperiodic rooted trees with n nodes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- 1 2 Sloane, N. J. A. (ed.). "Sequence A028387 (n + (n+1)^2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ "Sloane's A007850 : Giuga numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.
- ↑ Sloane, N. J. A. (ed.). "Sequence A033991 (n*(4*n-1))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A001523 (Number of stacks, or planar partitions of n; also weakly unimodal compositions of n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A045944 (Rhombic matchstick numbers: n*(3*n+2))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A005317 ((2^n + C(2*n,n))/2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ 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.
- ↑ Sloane, N. J. A. (ed.). "Sequence A073592 (Euler transform of negative integers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A075213 (Number of polyhexes with n cells that tile the plane isohedrally but not by translation or by 180-degree rotation (Conway criterion))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ "Sloane's A054377 : Primary pseudoperfect numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.
- ↑ Kellner, Bernard C.; 'The equation denom(Bn) = n has only one solution'
- ↑ Sloane, N. J. A. (ed.). "Sequence A006318 (Large Schröder numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 22 May 2016.
- ↑ "Sloane's A000058 : Sylvester's sequence". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.
- ↑ Sloane, N. J. A. (ed.). "Sequence A083186 (Sum of first n primes whose indices are primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A332835 (Number of compositions of n whose run-lengths are either weakly increasing or weakly decreasing)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2 June 2022.
- ↑ Sloane, N. J. A. (ed.). "Sequence A000230 (smallest prime p such that there is a gap of exactly 2n between p and next prime, or -1 if no such prime exists)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A004068 (Number of atoms in a decahedron with n shells)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A001905 (From higher-order Bernoulli numbers: absolute value of numerator of D-number D2n(2n-1))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A001208 (solution to the postage stamp problem with 3 denominations and n stamps)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A000081 (Number of unlabeled rooted trees with n nodes (or connected functions with a fixed point))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A088144 (Sum of primitive roots of n-th prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A000166 (Subfactorial or rencontres numbers, or derangements: number of permutations of n elements with no fixed points)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A000240 (Rencontres numbers: number of permutations of [n] with exactly one fixed point)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A000602 (Number of n-node unrooted quartic trees; number of n-carbon alkanes C(n)H(2n+2) ignoring stereoisomers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ ""Aztec Diamond"". Retrieved 20 September 2022.
- ↑ Sloane, N. J. A. (ed.). "Sequence A023811 (Largest metadrome (number with digits in strict ascending order) in base n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A000990 (Number of plane partitions of n with at most two rows)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A003037 (Smallest number of complexity n: smallest number requiring n 1's to build using +, * and ^)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A007530 (Prime quadruples: numbers k such that k, k+2, k+6, k+8 are all prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A011379 (n^2*(n+1))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A004799 (Self convolution of Lucas numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A000609 (Number of threshold functions of n or fewer variables)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A014206 (n^2 + n + 2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A006785 (Number of triangle-free graphs on n vertices)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A005987 (Number of symmetric plane partitions of n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A023431 (Generalized Catalan Numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ 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.
- ↑ Sloane, N. J. A. (ed.). "Sequence A307958 (Coreful perfect numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ "Sloane's A034897 : Hyperperfect numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.
- ↑ Sloane, N. J. A. (ed.). "Sequence A002413 (Heptagonal (or 7-gonal) pyramidal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A007070 (4*a(n-1) - 2*a(n-2))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A027851 (Number of nonisomorphic semigroups of order n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ 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.
- ↑ Sloane, N. J. A. (ed.). "Sequence A003060 (Smallest number with reciprocal of period length n in decimal (base 10))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A000127 (Maximal number of regions obtained by joining n points around a circle by straight lines. Also number of regions in 4-space formed by n-1 hyperplanes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A055621 (Number of covers of an unlabeled n-set)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A005915 (Hexagonal prism numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ 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 A000522 (Total number of ordered k-tuples of distinct elements from an n-element set)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ 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.
- ↑ Sloane, N. J. A. (ed.). "Sequence A005449 (Second pentagonal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A002982 (Numbers n such that n! - 1 is prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A030238 (Backwards shallow diagonal sums of Catalan triangle A009766)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ 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.
- ↑ Sloane, N. J. A. (ed.). "Sequence A089046 (Least edge-length of a square dissectable into at least n squares in the Mrs. Perkins's quilt problem)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A065900 (Numbers n such that sigma(n) equals sigma(n-1) + sigma(n-2))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Jon Froemke & Jerrold W. Grossman (February 1993). "A Mod-n Ackermann Function, or What's So Special About 1969?". The American Mathematical Monthly. 100 (2). Mathematical Association of America: 180–183. doi:10.2307/2323780. JSTOR 2323780.
- ↑ Sloane, N. J. A. (ed.). "Sequence A052542 (2*a(n-1) + a(n-2))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A217076 (Numbers n such that (n^37-1)/(n-1) is prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A064174 (Number of partitions of n with nonnegative rank)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A302545 (Number of non-isomorphic multiset partitions of weight n with no singletons)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A343971 (Numbers that are the sum of four positive cubes in four or more ways)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A034090 (Numbers k whose sum of proper divisors exceeds that of all smaller numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A064591 (Nonunitary perfect numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A007504 (Sum of the first n primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A053767 (Sum of the first n composite numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A187220 (Gullwing sequence)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A046351 (Palindromic composite numbers with only palindromic prime factors)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A000612 (Number of P-equivalence classes of switching functions of n or fewer variables, divided by 2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A038823 (Number of primes between n*1000 and (n+1)*1000)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Stein, William A. (10 February 2017). "The Riemann Hypothesis and The Birch and Swinnerton-Dyer Conjecture". wstein.org. Retrieved 6 February 2021.