1000 (number)
| ||||
|---|---|---|---|---|
| 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.
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]
1059
[edit]1059 = 3 × 353. It is a number n such that n4 is written in the form of a sum of four positive 4th powers.[23]
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)[24] and the sixth sum of 10 consecutive primes, starting with 23 through 131.[25]
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).[26]
1063
[edit]1063 is a prime number, a super-prime, a twin prime with 1061, a near-wall-sun-sun prime.[27] 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.[29]
1078
[edit]1078 = 2 × 72 × 11. It is an Euler transform of negative integers.[30]
1080
[edit]1080 = 23 × 33 × 5. It is a pentagonal number[31] and a largely composite number.[32]
1081
[edit]1081 = 23 × 47. It is the 46th triangular number[15] and a member of Padovan sequence.[33]
1086
[edit]1086 = 2 × 3 × 181. It is a Smith number[34] 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.[35]
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[36] 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.[37]
1097
[edit]1097 is a prime number, an emirp,[28] 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.[38]
1104
[edit]1104 = 24 × 3 × 23. It is a Keith number[39]
1105
[edit]1107
[edit]1107 = 33 × 41. There are 1107 non-isomorphic strict T0 multiset partitions of weight 8.[40]
1109
[edit]1109 is a Friedlander-Iwaniec prime[41] and a Chen prime.
1113
[edit]1113 = 3 × 7 × 53. There are 1113 strict partions of 40.[42]
1114
[edit]1114 = 2 × 557. There are 1114 ways to write 22 as an orderless product of orderless sums.[43]
1117
[edit]1117 is a Chen prime. There are 1117 diagonally symmetric polyominoes with 16 cells.[44]
1118
[edit]1118 = 2 × 13 × 43. There are 1118 unimodular 2 × 2 matrices having all terms in {0,1,...,21}.[45]
1119
[edit]1119 = 3 × 373. There are 1119 bipartite graphs with 9 nodes.[46]
1122
[edit]1122 = 2 × 3 × 11 × 17. It is a pronic number.[22]
1123
[edit]1123 is a balanced prime.[38]
1124
[edit]1124 = 22 × 281. It is a Leyland number[47] 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}.[48]
1127
[edit]1127 = 72 × 23. It is the maximum number of pieces that can be obtained by cutting an annulus with 46 cuts.[49]
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.[50]
1129
[edit]1129 is a prime number. There are 1129 lattice points inside a circle of radius 19.[51]
1130
[edit]1130 = 2 × 5 × 113. It is a skiponacci number.[52]
1131
[edit]1131 = 3 × 13 × 29. There are 1131 edges in the hexagonal triangle T(26).[53]
1132
[edit]1132 = 22 × 283. There are 1132 simple unlabeled graphs with 9 nodes of 2 colors whose components are complete graphs.[54]
1133
[edit]1133 = 11 × 103. There are 1133 primitive subsequences of {1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15}.[55]
1135
[edit]1135 = 5 × 227. It is a centered triangular number.[56]
1136
[edit]1136 = 24 × 71. There are 1136 independent vertex sets and vertex covers in the 7-sunlet graph.[57]
1137
[edit]1137 = 3 × 379. It is the sum of values of vertices at level 5 of the hyperbolic Pascal pyramid.[58]
1139
[edit]1139 = 17 × 67. It is the wiener index of the windmill graph D(3,17).[59]
1140
[edit]1140 = 22 × 3 × 5 × 19. It is a tetrahedral number.[60]
1141
[edit]1141 = 7 × 163. It is a 7-Knödel number.[61]
1142
[edit]1142 = 2 × 571. It is a spy number and a number n such that n32 + 1 is prime.[62]
1143
[edit]1143 = 32 × 127. There are 1143 set partitions of 8 elements with 2 connectors.[63]
1145
[edit]1145 = 5 × 229. It is a 5-Knödel number.[64]
1150
[edit]1150 = 2 × 52 × 23. There are 1150 11-iamonds without bilateral symmetry.[65]
1151
[edit]1151 is the first prime number following a prime gap of 22.[66] It is also a Chen prime.
1152
[edit]1152 = 27 × 32. It is a highly totient number,[67] a 3-smooth number, and an Achilles number.
1153
[edit]1153 is a super-prime and a Proth prime.[68]
1154
[edit]1154 = 2 × 577. Because 1154 = 2 × 242 + 2, there are 1154 points on the surface of tetrahedron with edge length 24.[69]
1155
[edit]1155 = 3 × 5 × 7 × 11. It is the product of the first four odd primes. There are 1155 edges in the join of two cycle graphs of order 33.
1156
[edit]1156 = 22 × 172 = 342. It is an octahedral number,[70] a centered pentagonal number,[21] and a centered hendecagonal number.[71]
1157
[edit]1157 = 13 × 89. It is the smallest number that can be written as n^2+1 without any prime factors of the form a^2+1.[72]
1158
[edit]1158 = 2 × 3 × 193. There are 1158 points on surface of octahedron with edge length 17.[73]
1159
[edit]1159 = 19 × 61. It is a centered octahedral number[74] and a member of the Mian–Chowla sequence.[9]
1160
[edit]1160 = 23 × 5 × 29. It is an octagonal number.[75]
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.[31]
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[76]
1165
[edit]1165 = 5 × 233. It is a 5-Knödel number.[64]
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.[77]
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.[49]
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.[78]
1182
[edit]1182 = 2 × 3 × 197. There are 1182 necklaces possible with 14 beads of 2 colors (that cannot be turned over).[79]
1184
[edit]1184 = 25 × 37. It is an amicable number with 1210.[80]
1186
[edit]1186 = 2 × 593. There are 1186 diagonally symmetric polyominoes with 15 cells.[44]
1187
[edit]1187 is a safe prime,[11] a Stern prime,[81] a balanced prime,[38] 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.[82]
1191
[edit]1191 = 3 × 397 = 352 - 35 + 1 = H35, the 35th Hogben number.[83]
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.
1194
[edit]1194 = 2 × 3 × 199. There are 1194 permutations that can be reached with 8 moves of 2 bishops and 1 rook on a 3 × 3 chessboard.[84]
1196
[edit]1196 = 22 × 13 × 23 = .[85]
1198
[edit]1198 = 2 × 599. It is a centered heptagonal number.[86]
1199
[edit]1199 = 11 × 109. It is the area of the 20th conjoined trapezoid.[87]
1200 to 1299
[edit]1200
[edit]1200 = 24 × 3 × 52. There are 1200 households in the Nielsen ratings sample.[88]
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.[89]
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.[90]
1204
[edit]1204 = 22 × 7 × 43. It is the magic constant for a 7 × 7 × 7 magic cube.[91]
1205
[edit]1205 = 5 × 241. There are 1205 partitions of 28 such that the number of odd parts is a part[92]
1207
[edit]1207 = 17 × 71. It is a composite de Polignac number.[93]
1208
[edit]1208 = 23 × 151. There are 1208 strict chains of divisors starting with the superprimorial A006939(3).[94]
1210
[edit]1210 = 2 × 5 × 112. It is an amicable number with 1184[95] and a Self-descriptive number.
1211
[edit]1211 = 7 × 173. It is a composite de Polignac number[93]
1212
[edit]1212 = 22 × 3 × 101 = , where is the number of partions of .[96]
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.[97]
1215
[edit]1215 = 35 × 5. There are 1215 edges in the hexagonal triangle T(27)[53]
1216
[edit]1216 = 26 × 19. It is a nonagonal number[98]
1217
[edit]1217 is a super-prime and a Proth prime.[68]
1219
[edit]1219 = 23 × 53. It is a centered triangular number[56] 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.[99]
1222
[edit]1222 = 2 × 13 × 47. It is a hexagonal pyramidal number.
1223
[edit]1223 is the 200th prime number.[38] 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.[100]
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][101] It is the second square triangular number greater than 1.[102] It is the 49th triangular number, the 35th square number, the 25th hexagonal number, a centered octagonal number,[103] a 29-gonal number,[104] a 60-gonal number,[105] 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.[106]
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.[107]
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.[108]
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.[109] 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.
A 2012 study of frequently-used personal identification numbers (PIN) found that, among 4-digit PIN codes, 1234 is the most frequently chosen.
1236
[edit]1236 = 22 × 3 × 103 = 617 + 619, the sum of a twin prime pair.[110]
1238
[edit]1238 = 2 × 619. There are 1238 partitions of 31 that do not contain 1 as a part.[17]
1239
[edit]1239 = 3 × 7 × 59. It is a toothpick number in 3 dimensions.[111]
1240
[edit]1240 = 23 × 5 × 31. It is a square pyramidal number.[112]
1241
[edit]1241 = 17 × 73. It is a centered cube number[113] and a spy number.
1243
[edit]1243 = 11 × 113. It is a composite de Polignac number.[93]
1244
[edit]1244 = 22 × 311. There are 1244 complete partitions of 25.[114]
1245
[edit]1245 = 3 × 5 × 83. There are 1245 labeled spanning intersecting set-systems on 5 vertices.[115]
1247
[edit]1247 = 29 × 43. It is a pentagonal number.[31]
1249
[edit]1249 is a prime number, an emirp, and a trimorphic number.[116]
1251
[edit]1251 = 32 × 139. Because 1251 = 2 × 252 + 1, there are 1251 different determinants of 2 × 2 matrices with integer entries from 0 to 25.[117]
1252
[edit]1252 = 22 × 313. Because 1252 = 2 × 252 + 2, there are 1252 points on the surface of a tetrahedron with edgelength 25.[69]
1255
[edit]1255 = 5 × 251. It is a zero of Mertens function. There are 1255 of partitions of 23.[118] There are 1255 ways to write 23 as an orderless product of orderless sums.[43]
1257
[edit]1257 = 3 × 419. There are 1257 lattice points inside a circle of radius 20.[51]
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,[119] the 16th highly composite number,[120] and the sum of the totient function for the first 64 integers. There are 1260 strict partions of 41.[42]
1261
[edit]1261 = 13 × 97. It is a star number[36] 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.[121]
1266
[edit]1266 = 2 × 3 × 211. It is a centered pentagonal number[21] and a zero of Mertens function.
1267
[edit]1267 = 7 × 181. It is a 7-Knödel number.[61]
1269
[edit]1269 = 33 × 47. Completing 11 revolutions in the Spiral of Theodorus requires 1269 triangles. [122]
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.[123]
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.[124]
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.[125]
1281
[edit]1281 = 3 × 7 × 61. It is an octagonal number.[75]
1283
[edit]1283 is a safe prime.[11]
1284
[edit]1284 = 22 × 3 × 107 = 641 + 643, the sum of a twin prime pair.[110]
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.[126]
1287
[edit]1287 = 32 × 11 × 13 = .[127]
1288
[edit]1288 = 23 × 7 × 23. It is a heptagonal number.[128]
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.
1292
[edit]1292 = 22 × 17 × 19. phi(1292) = phi(sigma(1292)).[129]
1295
[edit]1295 = 5 × 7 × 37. There are 1295 edges in the join of two cycle graphs, both of order 35.[100]
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,[130] 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.[131]
1306
[edit]1306 = 2 × 653. It is a centered triangular number.[56]
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]
1316
[edit]1316 = 22 × 7 × 47. It is the Euler transformation of sigma(11).[132]
1319
[edit]1319 is a safe prime.[11]
1320
[edit]1320 = 23 × 3 × 5 × 11 = 659 + 661, the sum of a twin prime pair.[110]
1325
[edit]1325 = 52 × 53. It is a Markov number[133] and a centered tetrahedral number.[134]
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.[60] It forms a Ruth–Aaron pair with 1331 under second definition.
1331
[edit]1331 = 113. It is a centered heptagonal number.[86] It forms a Ruth–Aaron pair with 1330 under second definition.
1334
[edit]1334 = 2 × 23 × 29. The maximal number of regions the plane can be divided into by drawing 37 circles is 1334.[135]
1335
[edit]1335 = 3 × 5 × 89. It is a pentagonal number.[31]
1342
[edit]1342 = 2 × 11 × 61 = .[85]
1346
[edit]1346 = 2 × 673. There are 1346 locally disjointed rooted trees with 10 nodes.[136]
1350
[edit]1350 = 2 × 33 × 52. It is a nonagonal number.[98]
1353
[edit]1353 = 3 × 11 × 41. Because 1353 = 2 × 262 + 1, there are 1353 different 2 × 2 determinants with integer entries from 0 to 26.[117]
1361
[edit]1361 is first prime number following a prime gap of 34[66] and the 3rd Mills' prime. It is a centered decagonal number.
1363
[edit]1363 = 29 × 47. There are 1363 ways to modify a circular arrangement of 14 objects by swapping one or more adjacent pairs.[137]
1364
[edit]1364 = 22 × 11 × 31. It is a Lucas number.[138]
1365
[edit]1365 = 3 × 5 × 7 × 13. It is a pentatope number.[139]
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),[38]
1368
[edit]1368 = 23 × 32 × 19. There are 1368 edges in the join of two cycle graphs, both of order 36.[100]
1371
[edit]1371 = 3 × 457. It is the sum of the first 28 primes.
1373
[edit]1373 is a prime number. There are 1373 lattice points inside a circle of radius 21[51]
1377
[edit]1377 = 34 × 17. It is the maximal number of pieces that can be obtained by cutting an annulus with 51 cuts[49]
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.[140]
1381
[edit]1381 is a prime number and a centered pentagonal number.[21]
1384
[edit]1384 = 23 × 173 = [85]
1385
[edit]1385 = 5 × 277. It is an up/down number.[141]
1387
[edit]1387 = 19 × 73. It is the 5th Fermat pseudoprime of base 2,[142] the 22nd centered hexagonal number, the 19th decagonal number,[143] and the second Super-Poulet number.[144]
1388
[edit]1388 = 22 × 347. Because 1388 = 4 × 192 - 3 × 19 + 1, is on the x-axis of Ulams spiral.[145]
1393
[edit]1393 = 7 × 199. It is a 7-Knödel number.[61]
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[119] and a member of the Mian–Chowla sequence[9]
1369
[edit]1396 = 22 × 349. It is a centered triangular number.[56]
1399
[edit]1399 is a prime number and an emirp.[146]
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[147]
1404
[edit]1404 = 22 × 32 × 13. It is a heptagonal number.[128]
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.[148]
1409
[edit]1409 is a super-prime, a Sophie Germain prime,[7] and a Proth prime.[68]
1410
[edit]1410 = 2 × 3 × 5 × 47. It is the denominator of the 46th Bernoulli number[149]
1418
[edit]1418 = 2 × 709. It is the smallest number x such that M(x) = 13, where M() is Mertens function[147]
1425
[edit]1425 = 3 × 52 × 19. It is a self-descriptive number in base 5.
1426
[edit]1426 = sum of totient function for first 68 integers, pentagonal number,[31] number of strict partions of 42[42]
1427
[edit]1427 = twin prime together with 1429[150]
1428
[edit]1428 = number of complete ternary trees with 6 internal nodes, or 18 edges;[151]
1429
[edit]1429 = twin prime together with 1427[150]
1430
[edit]1430 = Catalan number[152]
1431
[edit]1431 = 53rd triangular number,[15] hexagonal number[14]
1432
[edit]1432 = member of Padovan sequence[33]
1433
[edit]1433 = super-prime,[153]
1435
[edit]1435 = vampire number;[119]
1436
[edit]1436 = discriminant of a totally real cubic field[154]
1437
[edit]1437 = smallest number of complexity 20: smallest number requiring 20 1's to build using +, * and ^[155]
1439
[edit]1440
[edit]1440 = a highly totient number,[67] a largely composite number[32]
1441
[edit]1441 = star number[36]
1447
[edit]1447 = super-prime, happy number
1451
[edit]1451 = Sophie Germain prime[7]
1452
[edit]1452 = first Zagreb index of the complete graph K12[156]
1453
[edit]1453 = Sexy prime with 1459
1458
[edit]1458 = 2 × 36. It is the maximum determinant of an 11 by 11 matrix of zeroes and ones[157] 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 = Sexy prime with 1453, sum of nine consecutive primes (139 + 149 + 151 + 157 + 163 + 167 + 173 + 179 + 181), Pierpont prime
1462
[edit]1462 = (35 - 1) × (35 + 8) = the first Zagreb index of the wheel graph with 35 vertices[159]
1465
[edit]1465 = 5-Knödel number[64]
1466
[edit]1466 = , where = number of divisors of [160]
1467
[edit]1467 = number of partitions of 39 with zero crank[161]
- 1469 = octahedral number,[70] highly cototient number[20]
- 1470 = pentagonal pyramidal number,[162] sum of totient function for first 69 integers
- 1471 = super-prime, centered heptagonal number[86]
- 1476 = coreful perfect number[163]
- 1477 = 7-Knödel number[61]
- 1480 = sum of the first 29 primes
- 1481 = Sophie Germain prime[7]
- 1485 = 54th triangular number[15]
- 1486 = number of strict solid partitions of 19[37]
- 1487 = safe prime[11]
- 1489 = centered triangular number[56]
- 1490 = tetranacci number[164]
- 1491 = nonagonal number,[98]
- 1492 = discriminant of a totally real cubic field,[154]
- 1493 = Stern prime[81]
- 1494 = sum of totient function for first 70 integers
- 1496 = square pyramidal number[112]
- 1499 = Sophie Germain prime,[7] super-prime
1500 to 1599
[edit]- 1500 = hypotenuse in three different Pythagorean triangles[165]
- 1501 = centered pentagonal number[21]
- 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[166]
- 1503 = least number of triangles of the Spiral of Theodorus to complete 12 revolutions[122]
- 1504 = primitive abundant number (abundant number all of whose proper divisors are deficient numbers)[167]
- 1508 = heptagonal pyramidal number[168]
- 1509 = pinwheel number[130]
- 1510 = deficient number, odious number
- 1511 = Sophie Germain prime,[7] balanced prime[38]
- 1513 = centered square number[8]
- 1516 = [169]
- 1517 = number of lattice points inside a circle of radius 22[51]
- 1519 = number of polyhexes with 8 cells,[170] Mertens function zero
- 1520 = pentagonal number,[31] Mertens function zero, forms a Ruth–Aaron pair with 1521 under second definition
- 1521 = 392, Mertens function zero, centered octagonal number,[103] forms a Ruth–Aaron pair with 1520 under second definition
- 1523 = super-prime, Mertens function zero, safe prime,[11] member of the Mian–Chowla sequence[9]
- 1525 = heptagonal number,[128]
- 1526 = number of conjugacy classes in the alternating group A27[171]
- 1527 = number of 2-dimensional partitions of 11,[172]
- 1529 = composite de Polignac number[93]
- 1530 = vampire number[119]
- 1531 = prime number, centered decagonal number, Mertens function zero
- 1532 = number of series-parallel networks with 9 unlabeled edges,[173] Mertens function zero
- 1535 = Thabit number
- 1536 = a common size of microplate, 3-smooth number (29×3), number of threshold functions of exactly 4 variables[174]
- 1537 = Keith number,[39]
- 1539 = maximal number of pieces that can be obtained by cutting an annulus with 54 cuts[49]
- 1540 = 55th triangular number,[15] hexagonal number,[14] decagonal number,[143] tetrahedral number[60]
- 1541 = octagonal number[75]
- 1543 = prime dividing all Fibonacci sequences,[175]
- 1546 = number of 5 X 5 binary matrices with at most one 1 in each row and column,[176] Mertens function zero
- 1547 = hexagonal pyramidal number
- 1548 = coreful perfect number[163]
- 1549 = de Polignac prime[177]
- 1550 = = number of cards needed to build a 31-tier house of cards with a flat, one-card-wide roof[178]
- 1552 = Number of partitions of 57 into prime parts
- 1556 = sum of the squares of the first nine primes
- 1557 = number of graphs with 8 nodes and 13 edges[179]
- 1559 = Sophie Germain prime[7]
- 1561 = a centered octahedral number,[74] number of series-reduced trees with 19 nodes[180]
- 1562 = maximal number of regions the plane is divided into by drawing 40 circles[135]
- 1563 = [181]
- 1564 = sum of totient function for first 71 integers
- 1565 = and [182]
- 1566 = number k such that k64 + 1 is prime
- 1567 = number of partitions of 24 with at least one distinct part[183]
- 1568 = Achilles number[184]
- 1569 = 2 × 282 + 1 = number of different 2 × 2 determinants with integer entries from 0 to 28[117]
- 1570 = 2 × 282 + 2 = number of points on surface of tetrahedron with edgelength 28[69]
- 1571 = Honaker prime[153]
- 1572 = member of the Mian–Chowla sequence[9]
- 1573 = discriminant of a totally real cubic field[154]
- 1575 = odd abundant number,[185] sum of the nontriangular numbers between successive triangular numbers, number of partitions of 24[118]
- 1583 = Sophie Germain prime
- 1585 = Riordan number, centered triangular number[56]
- 1587 = 3 × 232 = number of edges of a complete tripartite graph of order 69, K23,23,23[186]
- 1588 = sum of totient function for first 72 integers
- 1589 = composite de Polignac number[93]
- 1592 = sum of all divisors of the first 36 odd numbers[187]
- 1593 = sum of the first 30 primes
- 1594 = minimal cost of maximum height Huffman tree of size 17[188]
- 1595 = number of non-isomorphic set-systems of weight 10
- 1596 = 56th triangular number[15]
- 1597 = Fibonacci prime,[189] Markov prime,[133] super-prime, emirp
- 1599 = number of edges in the join of two cycle graphs, both of order 39[100]
1600 to 1699
[edit]- 1600 = 402, repdigit in base 7 (44447),
- 1601 = Sophie Germain prime, Proth prime,[68]
- 1602 = number of points on surface of octahedron with edgelength 20[73]
- 1603 = number of partitions of 27 with nonnegative rank[190]
- 1604 = number of compositions of 22 into prime parts[191]
- 1605 = number of polyominoes consisting of 7 regular octagons[192]
- 1607 = member of prime triple with 1609 and 1613[193]
- 1608 = [85]
- 1610 = number of strict partions of 43[42]
- 1611 = number of rational numbers which can be constructed from the set of integers between 1 and 51[194]
- 1612 = maximum dimension of Euclidean spaces which suffice for every smooth compact Riemannian 31-manifold to be realizable as a sub-manifold[195]
- 1613, 1607 and 1619 are all primes[196]
- 1614 = number of ways of refining the partition 8^1 to get 1^8[197]
- 1615 = composite number such that the square mean of its prime factors is a nonprime integer[198]
- 1616 = = number of monotonic triples (x,y,z) in {1,2,...,16}3[199]
- 1617 = pentagonal number[31]
- 1618 = centered heptagonal number[86]
- 1619 = palindromic prime in binary, safe prime[11]
- 1620 = 809 + 811: sum of twin prime pair[110]
- 1621 = super-prime, pinwheel number[130]
- 1622 = semiprime of the form prime + 1[200]
- 1623 is not the sum of two triangular numbers and a fourth power[201]
- 1624 = number of squares in the Aztec diamond of order 28[202]
- 1625 = centered square number[8]
- 1626 = centered pentagonal number[21]
- 1628 = centered pentagonal number[21]
- 1629 = rounded volume of a regular tetrahedron with edge length 24[203]
- 1631 = [204]
- 1632 = number of acute triangles made from the vertices of a regular 18-polygon[205]
- 1633 = star number[36]
- 1634 = the smallest four-digit Narcissistic number in base 10
- 1635 = number of partitions of 56 whose reciprocal sum is an integer[206]
- 1637 = prime island: least prime whose adjacent primes are exactly 30 apart[207]
- 1638 = harmonic divisor number,[208] 5 × 21638 - 1 is prime[209]
- 1639 = nonagonal number[98]
- 1640 = pronic number[22]
- 1641 = 412 - 41 + 1 = H41 (the 41st Hogben number)[83]
- 1642 = maximal number of regions the plane is divided into by drawing 41 circles[135]
- 1643 = sum of first 46 composite numbers[97]
- 1644 = 821 + 823: sum of twin prime pair[110]
- 1645 = number of 16-celled pseudo still lifes in Conway's Game of Life, up to rotation and reflection[210]
- 1646 = number of graphs with 8 nodes and 14 edges[179]
- 1647 and 1648 are both divisible by cubes[211]
- 1648 = number of partitions of 343 into distinct cubes[212]
- 1649 = highly cototient number,[20] Leyland number[47] using 4 & 5 (45 + 54)
- 1650 = number of cards to build an 33-tier house of cards[82]
- 1651 = heptagonal number[128]
- 1652 = number of partitions of 29 into a prime number of parts[213]
- 1653 = 57th triangular number,[15] hexagonal number,[14] number of lattice points inside a circle of radius 23[51]
- 1654 = number of partitions of 42 into divisors of 42[214]
- 1656 = 827 + 829: sum of twin prime pair[110]
- 1657 = cuban prime,[215]
- 1658 = smallest composite that when added to sum of prime factors reaches a prime after 25 iterations[216]
- 1659 = number of rational numbers which can be constructed from the set of integers between 1 and 52[194]
- 1660 = sum of totient function for first 73 integers
- 1661 = 11 × 151, palindrome that is a product of two palindromic primes[217]
- 1662 = number of partitions of 49 into pairwise relatively prime parts[218]
- 1663 = a prime number and 51663 - 41663 is a 1163-digit prime number[219]
- 1664 = k such that k, k+1 and k+2 are sums of 2 squares[220]
- 1665 = centered tetrahedral number[134]
- 1666 = largest efficient pandigital number in Roman numerals (each symbol occurs exactly once)
- 1667 = 228 + 1439 and the 228th prime is 1439[221]
- 1668 = number of partitions of 33 into parts all relatively prime to 33[222]
- 1669 = super-prime, smallest prime with a gap of exactly 24 to the next prime[223]
- 1670 = number of compositions of 12 such that at least two adjacent parts are equal[224]
- 1671 divides the sum of the first 1671 composite numbers[225]
- 1672 = 412 - 32, the only way to express 1672 as a difference of prime squares[226]
- 1676 = number of partitions of 34 into parts each of which is used a different number of times[227]
- 1679 = highly cototient number,[20] semiprime (23 × 73, see also Arecibo message), number of parts in all partitions of 32 into distinct parts[109]
- 1680 = the 17th highly composite number,[120] number of edges in the join of two cycle graphs, both of order 40[100]
- 1681 = 412, smallest number yielded by the formula n2 + n + 41 that is not a prime; centered octagonal number[103]
- 1682 and 1683 is a member of a Ruth–Aaron pair (first definition)
- 1683 = triangular matchstick number[228]
- 1684 = centered triangular number[56]
- 1685 = 5-Knödel number[64]
- 1686 = [85]
- 1687 = 7-Knödel number[61]
- 1688 = number of finite connected sets of positive integers greater than one with least common multiple 72[229]
- 1689 = [230]
- 1690 = number of compositions of 14 into powers of 2[231]
- 1691 = the same upside down, which makes it a strobogrammatic number[232]
- 1692 = coreful perfect number[163]
- 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
- 1698 = number of rooted trees with 47 vertices in which vertices at the same level have the same degree[121]
- 1699 = number of rooted trees with 48 vertices in which vertices at the same level have the same degree[121]
1700 to 1799
[edit]- 1700 = σ2(39): sum of squares of divisors of 39[233]
- 1702 = palindromic in 3 consecutive bases: 89814, 78715, 6A616
- 1705 = tribonacci number[234]
- 1706 = 1 + 4 + 16 + 64 + 256 + 1024 + 256 + 64 + 16 + 4 + 1 sum of fifth row of triangle of powers of 4[235]
- 1710 = maximal number of pieces that can be obtained by cutting an annulus with 57 cuts[49]
- 1711 = 58th triangular number,[15] centered decagonal number
- 1712 = number of irredundant sets in the 29-cocktail party graph[123]
- 1713 = number of aperiodic rooted trees with 12 nodes[236]
- 1716 = 857 + 859: sum of twin prime pair,[110]
- 1717 = pentagonal number[31]
- 1718 = [237]
- 1719 = composite de Polignac number[93]
- 1720 = sum of the first 31 primes
- 1721 = twin prime; number of squares between 422 and 424.[238]
- 1722 = Giuga number,[239] pronic number[22]
- 1723 = super-prime
- 1724 = maximal number of regions the plane is divided into by drawing 42 circles[135]
- 1725 = 472 - 222 = (prime(15))2 - (nonprime(15))2[240]
- 1726 = number of partitions of 44 into distinct and relatively prime parts[241]
- 1727 = area of the 24th conjoined trapezoid[87]
- 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[242]
- 1732 = [243]
- 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]
- 1737 = pinwheel number[130]
- 1740 = number of squares in the Aztec diamond of order 29[202]
- 1741 = super-prime, centered square number[8]
- 1742 = number of regions the plane is divided into by 30 ellipses[89]
- 1743 = wiener index of the windmill graph D(3,21)[59]
- 1745 = 5-Knödel number[64]
- 1746 = number of unit-distance graphs on 8 nodes[244]
- 1747 = balanced prime[38]
- 1748 = number of partitions of 55 into distinct parts in which the number of parts divides 55[245]
- 1749 = number of integer partitions of 33 with no part dividing all the others[246]
- 1750 = hypotenuse in three different Pythagorean triangles[165]
- 1751 = cropped hexagone[247]
- 1753 = balanced prime[38]
- 1755 = number of integer partitions of 50 whose augmented differences are distinct[248]
- 1756 = centered pentagonal number[21]
- 1757 = least number of triangles of the Spiral of Theodorus to complete 13 revolutions[122]
- 1758 = [85]
- 1759 = de Polignac prime[177]
- 1762 = number of binary sequences of length 12 and curling number 2[249]
- 1763 = number of edges in the join of two cycle graphs, both of order 41[100]
- 1765 = number of stacks, or planar partitions of 15[250]
- 1769 = maximal number of pieces that can be obtained by cutting an annulus with 58 cuts[49]
- 1770 = 59th triangular number,[15] hexagonal number,[14] Seventeen Seventy, town in Australia
- 1771 = tetrahedral number[60]
- 1772 = centered heptagonal number,[86] sum of totient function for first 76 integers
- 1774 = number of rooted identity trees with 15 nodes and 5 leaves[251]
- 1776 = 24th square star number.[252] 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[253]
- 1781 = the first 1781 digits of e form a prime[254]
- 1782 = heptagonal number[128]
- 1783 = de Polignac prime[177]
- 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[255]
- 1785 = square pyramidal number,[112] triangular matchstick number[228]
- 1786 = centered triangular number[56]
- 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[256]
- 1790 = number of partitions of 50 into pairwise relatively prime parts[218]
- 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[51]
- 1794 = nonagonal number,[98] number of partitions of 33 that do not contain 1 as a part[17]
- 1795 = number of heptagons with perimeter 38[257]
- 1799 = 2 × 302 − 1 = a twin square[258]
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)[215]
- 1803 = number of decahexes that tile the plane isohedrally but not by translation or by 180-degree rotation (Conway criterion)[259]
- 1806 = pronic number,[22] product of first four terms of Sylvester's sequence, primary pseudoperfect number,[260] only number for which n equals the denominator of the nth Bernoulli number,[261] Schröder number[262]
- 1807 = fifth term of Sylvester's sequence[263]
- 1808 = maximal number of regions the plane is divided into by drawing 43 circles[135]
- 1809 = sum of first 17 super-primes[264]
- 1810 = [265]
- 1811 = Sophie Germain prime
- 1813 = number of polyominoes with 26 cells, symmetric about two orthogonal axes[266]
- 1814 = 1 + 6 + 36 + 216 + 1296 + 216 + 36 + 6 + 1 = sum of 4th row of triangle of powers of six[267]
- 1817 = total number of prime parts in all partitions of 20[268]
- 1820 = pentagonal number,[31] pentatope number,[139] number of compositions of 13 whose run-lengths are either weakly increasing or weakly decreasing[269]
- 1821 = member of the Mian–Chowla sequence[9]
- 1822 = number of integer partitions of 43 whose distinct parts are connected[270]
- 1823 = super-prime, safe prime[11]
- 1824 = 432 - 52, the only way to express 1824 as a difference of prime squares[226]
- 1825 = octagonal number[75]
- 1826 = decagonal pyramidal number[271]
- 1827 = vampire number[119]
- 1828 = meandric number, open meandric number, appears twice in the first 10 decimal digits of e
- 1829 = composite de Polignac number[93]
- 1830 = 60th triangular number[15]
- 1831 = smallest prime with a gap of exactly 16 to next prime (1847)[272]
- 1832 = sum of totient function for first 77 integers
- 1833 = number of atoms in a decahedron with 13 shells[273]
- 1834 = octahedral number,[70] sum of the cubes of the first five primes
- 1835 = absolute value of numerator of [274]
- 1836 = factor by which a proton is more massive than an electron
- 1837 = star number[36]
- 1841 = solution to the postage stamp problem with 3 denominations and 29 stamps,[275]
- 1842 = number of unlabeled rooted trees with 11 nodes[276]
- 1843 = k such that phi(k) is a perfect cube,[277] Mertens function zero
- 1844 = 37 - 73,[278] Mertens function zero
- 1845 = number of partitions of 25 containing at least one prime,[279] Mertens function zero
- 1847 = super-prime
- 1848 = number of edges in the join of two cycle graphs, both of order 42[100]
- 1849 = 432, palindromic in base 6 (= 123216), centered octagonal number[103]
- 1850 = Number of partitions of 59 into prime parts
- 1851 = sum of the first 32 primes
- 1853 = sum of primitive roots of 27-th prime,[280] Mertens function zero
- 1854 = number of permutations of 7 elements with no fixed points,[281] Mertens function zero
- 1855 = rencontres number: number of permutations of [7] with exactly one fixed point[282]
- 1856 = sum of totient function for first 78 integers
- 1857 = Mertens function zero, pinwheel number[130]
- 1858 = number of 14-carbon alkanes C14H30 ignoring stereoisomers[283]
- 1859 = composite de Polignac number[93]
- 1860 = number of squares in the Aztec diamond of order 30[284]
- 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)[285]
- 1866 = number of plane partitions of 16 with at most two rows[286]
- 1867 = prime de Polignac number[177]
- 1868 = smallest number of complexity 21: smallest number requiring 21 1's to build using +, * and ^[155]
- 1870 = decagonal number[143]
- 1871 = the first prime of the 2 consecutive twin prime pairs: (1871, 1873) and (1877, 1879)[287]
- 1872 = first Zagreb index of the complete graph K13[156]
- 1873 = number of Narayana's cows and calves after 21 years[124]
- 1880 = the 10th element of the self convolution of Lucas numbers[288]
- 1881 = tricapped prism number[289]
- 1882 = number of linearly separable Boolean functions in 4 variables[290]
- 1883 = number of conjugacy classes in the alternating group A28[171]
- 1886 = number of partitions of 64 into fourth powers[291]
- 1887 = number of edges in the hexagonal triangle T(34)[53]
- 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[56]
- 1892 = pronic number[22]
- 1894 = maximal number of regions the plane is divided into by drawing 44 circles[135]
- 1896 = member of the Mian-Chowla sequence[9]
- 1897 = member of Padovan sequence,[33] number of triangle-free graphs on 9 vertices[292]
1900 to 1999
[edit]- 1900 = number of primes <= 214[12]
- 1901 = Sophie Germain prime, centered decagonal number
- 1902 = number of symmetric plane partitions of 27[293]
- 1903 = generalized Catalan number[294]
- 1905 = Fermat pseudoprime[295]
- 1907 = safe prime,[11] balanced prime[38]
- 1908 = coreful perfect number[163]
- 1909 = hyperperfect number[296]
- 1910 = number of compositions of 13 having exactly one fixed point[297]
- 1911 = heptagonal pyramidal number[168]
- 1912 = size of 6th maximum raising after one blind in pot-limit poker[298]
- 1913 = super-prime, Honaker prime[153]
- 1915 = number of nonisomorphic semigroups of order 5[299]
- 1917 = number of partitions of 51 into pairwise relatively prime parts[218]
- 1918 = heptagonal number[128]
- 1919 = smallest number with reciprocal of period length 36 in base 10[300]
- 1920 = sum of the nontriangular numbers between successive triangular numbers 120 and 136,
- 1923 = 2 × 312 + 1 = number of different 2 X 2 determinants with integer entries from 0 to 31[117]
- 1925 = number of ways to write 24 as an orderless product of orderless sums[43]
- 1926 = pentagonal number[31]
- 1928 = number of distinct values taken by 2^2^...^2 (with 13 2's and parentheses inserted in all possible ways)[301]
- 1929 = Mertens function zero, number of integer partitions of 42 whose distinct parts are connected[270]
- 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[166]
- 1931 = Sophie Germain prime
- 1932 = number of partitions of 40 into prime power parts[302]
- 1933 = centered heptagonal number,[86] Honaker prime[153]
- 1934 = sum of totient function for first 79 integers
- 1935 = number of edges in the join of two cycle graphs, both of order 43[100]
- 1937 = number of chiral n-ominoes in 12-space, one cell labeled[303]
- 1938 = Mertens function zero, number of points on surface of octahedron with edge length 22[73]
- 1939 = 7-Knödel number[61]
- 1940 = the Mahonian number: T(8, 9)[107]
- 1941 = maximal number of regions obtained by joining 16 points around a circle by straight lines[304]
- 1942 = number k for which 10k + 1, 10k + 3, 10k + 7, 10k + 9 and 10k + 13 are primes[305]
- 1943 = largest number not the sum of distinct tetradecagonal numbers[306]
- 1944 = 3-smooth number (23×35), Achilles number[184]
- 1945 = number of partitions of 25 into relatively prime parts such that multiplicities of parts are also relatively prime[307]
- 1947 = k such that 5·2k + 1 is a prime factor of a Fermat number 22m + 1 for some m[308]
- 1948 = number of strict solid partitions of 20[37]
- 1949 = smallest prime > 442.[309]
- 1950 = ,[310] largest number not the sum of distinct pentadecagonal numbers[306]
- 1951 = cuban prime[215]
- 1952 = number of covers of {1, 2, 3, 4}[311]
- 1953 = hexagonal prism number,[312] 62nd triangular number[15]
- 1955 = number of partitions of 25 with at least one distinct part[183]
- 1956 = nonagonal number[98]
- 1957 = = total number of ordered k-tuples (k=0,1,2,3,4,5,6) of distinct elements from an 6-element set[313]
- 1958 = number of partitions of 25[118]
- 1960 = number of parts in all partitions of 33 into distinct parts[109]
- 1961 = number of lattice points inside a circle of radius 25[51]
- 1962 = number of edges in the join of the complete graph K36 and the cycle graph C36[314]
- 1963! - 1 is prime[315]
- 1964 = number of linear forests of planted planar trees with 8 nodes[316]
- 1965 = total number of parts in all partitions of 17[317]
- 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[318]
- σ(1968) = σ(1967) + σ(1966)[319]
- 1969 = Only value less than four million for which a "mod-ification" of the standard Ackermann Function does not stabilize[320]
- 1970 = number of compositions of two types of 9 having no even parts[321]
- 1972 = n such that is prime[322]
- 1973 = Sophie Germain prime, Leonardo prime
- 1974 = number of binary vectors of length 17 containing no singletons[99]
- 1975 = number of partitions of 28 with nonnegative rank[190]
- 1976 = octagonal number[75]
- 1977 = number of non-isomorphic multiset partitions of weight 9 with no singletons[323]
- 1979 = number of squares between 452 and 454,[238] smallest number that is the sum of 4 positive cubes in at least 4 ways[324]
- 1980 = pronic number,[22] highly abundant number with a greater sum of proper divisors than all smaller numbers[325]
- 1981 = pinwheel number,[130] central polygonal number[326]
- 1982 = maximal number of regions the plane is divided into by drawing 45 circles,[135] a number with the property that 31982 - 1982 is prime[327]
- 1984 = 11111000000 in binary, nonunitary perfect number,[328] see also: 1984 (disambiguation)
- 1985 = centered square number[8]
- 1986 = number of ways to write 25 as an orderless product of orderless sums[43]
- 1987 = 300th prime number
- 1988 = sum of the first 33 primes,[329] sum of the first 51 composite numbers[330]
- 1989 = number of balanced primes less than 100,000,[331] number of 9-step mappings with 4 inputs[140]
- 1990 = Stella octangula number
- 1991 = 11 × 181, the 46th Gullwing number,[332] palindromic composite number with only palindromic prime factors[333]
- 1992 = number of nonisomorphic sets of nonempty subsets of a 4-set[334]
- 1993 = a number with the property that 41993 - 31993 is prime,[335] number of partitions of 30 into a prime number of parts[213]
- 1995 = number of unlabeled graphs on 9 vertices with independence number 6[336]
- 1997 = [337]
- 1999 = centered triangular number,[56] number of regular forms in a myriagram.
Prime numbers
[edit]There are 135 prime numbers between 1000 and 2000:[338][339]
- 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.
- 1 2 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 3 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 8 9 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 A003294 (Numbers k such that k^4 can be written as a sum of four positive 4th powers)". 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.
- 1 2 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 4 Sloane, N. J. A. (ed.). "Sequence A000009 (Expansion of Product_{m > 0} (1 + x^m); number of partitions of n into distinct parts; number of partitions of n into odd parts)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- 1 2 3 4 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 3 4 5 6 7 Sloane, N. J. A. (ed.). "Sequence A000328". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A001608 (Perrin sequence)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- 1 2 3 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.
- 1 2 3 4 5 6 7 8 9 10 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 > 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.
- 1 2 Sloane, N. J. A. (ed.). "Sequence A033991 (n*(4*n-1))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- 1 2 3 4 "Sloane's A000292 : Tetrahedral numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.
- 1 2 3 4 5 6 Sloane, N. J. A. (ed.). "Sequence A208155 (7-Knödel numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ 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.
- 1 2 3 4 5 Sloane, N. J. A. (ed.). "Sequence A050993 (5-Knödel numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ "1150 (number)". The encyclopedia of numbers.
- 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 3 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.
- 1 2 3 "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.
- 1 2 3 Sloane, N. J. A. (ed.). "Sequence A005899 (Number of points on surface of octahedron)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- 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.
- 1 2 Sloane, N. J. A. (ed.). "Sequence A005449 (Second pentagonal numbers: n*(3*n + 1)/2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- 1 2 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.
- 1 2 3 4 5 6 Sloane, N. J. A. (ed.). "Sequence A024916 (Sum_1^n sigma(k))". 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.
- 1 2 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 & Littlefield, 2005
- 1 2 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.
- 1 2 Sloane, N. J. A. (ed.). "Sequence A053767 (Sum of first n composite numbers)". 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 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.
- 1 2 3 4 5 6 7 8 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 4 "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.
- 1 2 Sloane, N. J. A. (ed.). "Sequence A008302 (Triangle of Mahonian numbers T(n,k): coefficients in expansion of Product{0..n-1} (1 + x + ... + x^i), where k ranges from 0 to A000217(n-1). Also enumerates permutations by their major index)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ "A006154 - OEIS". oeis.org.
- 1 2 3 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 4 5 6 7 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.
- 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 3 4 Sloane, N. J. A. (ed.). "Sequence A058331 (2*n^2 + 1)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- 1 2 3 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.
- 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.
- 1 2 3 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 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.
- 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.
- ↑ 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.
- 1 2 3 4 5 6 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.
- ↑ "A061256 - OEIS". oeis.org.
- 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 4 5 6 7 Sloane, N. J. A. (ed.). "Sequence A014206 (n^2 + n + 2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ "A316473 - OEIS". oeis.org.
- ↑ 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.
- 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.
- 1 2 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 3 4 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.
- 1 2 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.
- 1 2 Sloane, N. J. A. (ed.). "Sequence A011379 (n^2*(n+1))". 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 A085831 (Sum_1^{2^n} d(k) where d(k) is the number of divisors of k (A000005))". 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.
- ↑ "Sloane's A002411 : Pentagonal pyramidal numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.
- 1 2 3 4 Sloane, N. J. A. (ed.). "Sequence A307958 (Coreful perfect numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ "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 A002071 (Number of pairs of consecutive integers x, x+1 such that all prime factors of both x and x+1 are at most the n-th prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ 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.
- 1 2 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 A018000 (Powers of cube root of 9 rounded down)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A038147 (Number of polyhexes with n cells)". 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 A001970 (Functional determinants; partitions of partitions; Euler transform applied twice to all 1's sequence)". 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.
- ↑ Sloane, N. J. A. (ed.). "Sequence A000615 (Threshold functions of exactly n variables)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A000057 (Primes dividing all Fibonacci sequences)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A002720 (Number of partial permutations of an n-set; number of n X n binary matrices with at most one 1 in each row and column)". 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.
- ↑ Sloane, N. J. A. (ed.). "Sequence A140090 (n*(3*n + 7)/2)". 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 A000014 (Number of series-reduced trees with n nodes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A057660 (Sum_{1..n} n/gcd(n,k))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A088319 (Ordered hypotenuses of primitive Pythagorean triangles having legs that add up to a square)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- 1 2 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.
- 1 2 Sloane, N. J. A. (ed.). "Sequence A052486 (Achilles numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ "Sloane's A005231 : Odd abundant numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.
- ↑ Sloane, N. J. A. (ed.). "Sequence A033428 (3*n^2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A326123 (a(n) is the sum of all divisors of the first n odd numbers)". 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.
- 1 2 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 A023360 (Number of compositions of n into prime parts)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A103473 (Number of polyominoes consisting of 7 regular unit n-gons)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ 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 A018805". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A059845 (n*(3*n + 11)/2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A006489 (Numbers k such that k-6, k, and k+6 are primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A213427 (Number of ways of refining the partition n^1 to get 1^n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A134602 (Composite numbers such that the square mean of their prime factors is a nonprime integer (where the prime factors are taken with multiplicity and the square mean of c and d is sqrt((c^2+d^2)/2)))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A084990 (n*(n^2+3*n-1)/3)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A077068 (Semiprimes of the form prime + 1)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A115160 (Numbers that are not the sum of two triangular numbers and a fourth power)". 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 A071399 (Rounded volume of a regular tetrahedron with edge length n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A001339 (Sum_{0..n} (k+1)! binomial(n,k))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A007290 (2*binomial(n,3))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A058360 (Number of partitions of n whose reciprocal sum is an integer)". 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 A001770 (Numbers k such that 5*2^k - 1 is prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ 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.
- ↑ Sloane, N. J. A. (ed.). "Sequence A068140 (Smaller of two consecutive numbers each divisible by a cube greater than one)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A030272 (Number of partitions of n^3 into distinct cubes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- 1 2 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.
- ↑ Sloane, N. J. A. (ed.). "Sequence A018818 (Number of partitions of n into divisors of n)". 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 A050710 (Smallest composite that when added to sum of prime factors reaches a prime after n iterations)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ 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.
- 1 2 3 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 A059802 (Numbers k such that 5^k - 4^k is prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A082982 (Numbers k such that k, k+1 and k+2 are sums of 2 squares)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A061068 (Primes which are the sum of a prime and its subscript)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A057562 (Number of partitions of n into parts all relatively prime to n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ 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 A261983 (Number of compositions of n such that at least two adjacent parts are equal)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A053781 (Numbers k that divide the sum of the first k composite numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- 1 2 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.
- ↑ 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.
- 1 2 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 A286518 (Number of finite connected sets of positive integers greater than one with least common multiple n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A004041 (Scaled sums of odd reciprocals: (2*n + 1)!!*(Sum_{0..n} 1/(2*k + 1)))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A023359 (Number of compositions (ordered partitions) of n into powers of 2)". 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, 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.
- ↑ "Sloane's A000073 : Tribonacci numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.
- ↑ Sloane, N. J. A. (ed.). "Sequence A020989 ((5*4^n - 2)/3)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A301700 (Number of aperiodic rooted trees with n nodes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A056045 ("Sum_{d divides n}(binomial(n,d))")". 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 A161757 ((prime(n))^2 - (nonprime(n))^2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A078374 (Number of partitions of n into distinct and relatively prime parts)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A005918 (Number of points on surface of square pyramid: 3*n^2 + 2 (n>0))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A167008 (Sum_{0..n} C(n,k)^k)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A350507 (Number of (not necessarily connected) unit-distance graphs on n nodes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A102627 (Number of partitions of n into distinct parts in which the number of parts divides n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ 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.
- ↑ Sloane, N. J. A. (ed.). "Sequence A144391 (3*n^2 + n - 1)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A325349 (Number of integer partitions of n whose augmented differences are distinct)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A216955 (number of binary sequences of length n and curling number k)". 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 A055327 (Triangle of rooted identity trees with n nodes and k leaves)". 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 A064118 (Numbers k such that the first k digits of e form a prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A325860 (Number of subsets of {1..n} such that every pair of distinct elements has a different quotient)". 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.
- ↑ Sloane, N. J. A. (ed.). "Sequence A288253 (Number of heptagons that can be formed with perimeter n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A056220 (2*n^2 - 1)". 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 A005260 (Sum_{0..n} binomial(n,k)^4)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A056877 (Number of polyominoes with n cells, symmetric about two orthogonal axes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A061801 ((7*6^n - 2)/5)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A037032 (Total number of prime parts in all partitions of n)". 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.
- 1 2 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.
- ↑ Sloane, N. J. A. (ed.). "Sequence A007585 (10-gonal (or decagonal) pyramidal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ 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 A039771 (Numbers k such that phi(k) is a perfect cube)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A024026 (3^n - n^3)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A235945 (Number of partitions of n containing at least one prime)". 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 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 A004799 (Self convolution of Lucas numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A005920 (Tricapped prism 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 A259793 (Number of partitions of n^4 into fourth powers)". 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's A034897 : Hyperperfect numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.
- ↑ Sloane, N. J. A. (ed.). "Sequence A240736 (Number of compositions of n having exactly one fixed point)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ 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 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 A002845 (Number of distinct values taken by 2^2^...^2 (with n 2's and parentheses inserted in all possible ways))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ 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.
- ↑ Sloane, N. J. A. (ed.). "Sequence A045648 (Number of chiral n-ominoes in (n-1)-space, one cell labeled)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ 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 A178084 (Numbers k for which 10k + 1, 10k + 3, 10k + 7, 10k + 9 and 10k + 13 are primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- 1 2 Sloane, N. J. A. (ed.). "Sequence A007419 (Largest number not the sum of distinct n-th-order polygonal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A100953 (Number of partitions of n into relatively prime parts such that multiplicities of parts are also relatively prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A226366 (Numbers k such that 5*2^k + 1 is a prime factor of a Fermat number 2^(2^m) + 1 for some m)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A007491 (Smallest prime > n^2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A319014 (1*2*3 + 4*5*6 + 7*8*9 + 10*11*12 + 13*14*15 + 16*17*18 + ... + (up to n))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ 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 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 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 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 A000124 (Central polygonal numbers (the Lazy Caterer's sequence): n(n+1)/2 + 1; or, maximal number of pieces formed when slicing a pancake with n cuts)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A058037 (Numbers k such that 3^k - k is prime)". 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 A096711 (Number of balanced primes less than 10^n.)". 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.
- ↑ (sequence A059801 in the OEIS)
- ↑ Sloane, N. J. A. (ed.). "Sequence A263341 (Triangle read by rows: T(n,k) is the number of unlabeled graphs on n vertices with independence number k)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A011755 (Sum_{1..n} k*phi(k))". 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.