1000 (número)

1000 o mil es el número natural que sigue a 999 y precede a 1001. En la mayoría de los países de habla inglesa , se puede escribir con o sin coma o, a veces, con un punto que separe la cifra de las unidades de millar : 1,000 .

Un grupo de mil unidades se conoce a veces, del griego antiguo , como una quiliad . ^{[ 1 ]} Un período de mil años puede conocerse como una quiliad o, más a menudo del latín , como un milenio . El número 1000 también se describe a veces como un mil corto en contextos medievales donde es necesario distinguir el concepto germánico de 1200 como un mil largo . Es el primer entero de 4 dígitos .

Notación

La representación decimal de mil es
- 1000 —un uno seguido de tres ceros , en la notación general;
- 1 × 10³ ^—en notación de ingeniería , que para este número coincide con:
- 1 × 10³ ^exactamente , en notación exponencial normalizada científica ;
- 1 E+3 exactamente—en notación científica E .
El prefijo del SI para mil unidades es " kilo- ", abreviado como "k"; por ejemplo, un kilogramo o "kg" son mil gramos . Esto a veces se extiende a contextos que no pertenecen al SI, como "ka" ( kiloannum ), que se usa como abreviatura de períodos de 1000 años. Sin embargo, en informática , "kilo-" se usa de forma más laxa para referirse a 2 elevado a la décima potencia (1024 o 2¹⁰ ⁾ .
En el estilo de escritura del SI , se puede usar un espacio de no separación como separador de miles , es decir, para separar los dígitos de un número en cada potencia de 1000.
Los múltiplos de miles se representan ocasionalmente reemplazando sus últimos tres ceros con la letra "K" o "k": por ejemplo, escribir "$30k" para $30,000 o usar "Y2K" para denotar el problema informático del año 2000 .
Mil unidades monetarias , especialmente dólares o libras , se denominan coloquialmente grand . En Estados Unidos, a veces se abrevia con el sufijo "G".

En matemáticas

Un chiliágono es un polígono de 1000 lados . ^{[ 2 ]}

Números comprendidos entre 1001 y 1999.

1001 a 1099

1001

1002

1002 = 2 × 3 × 167. Es un número esfénico , un número abundante y un cero de la función de Mertens . Hay 1002 particiones de 22.

1004

1004 = 2² ^× 251. Es un número heptanacci . ^{[ 3 ]}

1006

1006 = 2 × 503. Es un número inusual , un número equidigital y un número libre de cuadrados . Es una brecha récord entre primos gemelos . ^{[ 4 ]} Hay 1006 composiciones ( particiones ordenadas ) de 22 en cuadrados 1006 caminos hamiltonianos no dirigidos en un grafo de cuadrícula cuadrada de 4 por 5. ^{[ 5 ]}

1009

1009 es el primo de cuatro dígitos más pequeño , un primo de la suerte y un primo de Chen . Es palíndromo en bases 11, 15, 19, 24 y 28: (838 ₁₁ , 474 ₁₅ , 2F2 ₁₉ , 1I1 ₂₄ , 181 ₂₈ ).

1011

1011 = 3 × 337. Es un número de Harshad en bases 5, 10, 15, 20, 25, 30, 35, 40, 45, 50, 55, 60, 65, 70, 75 (y otras 202 bases). Es el mayor número natural n tal que 2 ⁿ contiene 101 y no contiene 11011. Hay 1011 particiones de 1 en recíprocos de enteros positivos <= 16 fracción egipcia . ^{[ 6 ]}

1012

1012 = 2 ² × 11 × 23. Hay 1012 particiones de 1 en recíprocos de enteros positivos <= 17 fracción egipcia . ^{[ 6 ]}

1013

1013 es un número primo, un primo de Sophie Germain , ^{[ 7 ]} y un número cuadrado centrado , ^{[ 8 ]}

1016

1016 = 2 ³ × 127. Es el número de Stella Octangula y un miembro de la secuencia de Mian-Chowla . ^{[ 9 ]} Hay 1016 puntos de superficie en un cubo con longitud de arista 14. ^{[ 10 ]}

1019

1019 es un número primo, un primo de Sophie Germain , ^{[ 7 ]} un primo seguro , ^{[ 11 ]} y un primo de Chen .

1021

1021 es un número primo, un primo afortunado y un primo gemelo con 1019 .

1023

1024

1025

1025 = 5 ² × 41. Es un número de Jacobsthal-Lucas y la hipotenusa de un triángulo pitagórico primitivo . Es un número de Proth porque 1025 = 2 ¹⁰ + 1. Es un miembro de la secuencia de Moser-de Bruijn porque su representación en base 4 (100001 ₄ ) contiene solo los dígitos 0 y 1, o equivalentemente, es una suma de potencias distintas de 4 (4 ⁵ + 4 ⁰ ).

1028

1028 = 2² ^× 257. Es la suma de la función totiente para los primeros 58 enteros. Hay 1029 primos <= ^2¹³ . ^{[ 12 ]}

1031

1031 es un número primo, un primo de Sophie Germain , ^{[ 7 ]} un superprimo y un primo de Chen . Es el exponente y el número de unos del quinto primo repunit de base 10. ^{[ 13 ]}

1033

1033 es un número primo y un número primo equivalente . Forma un par primo gemelo con 1031.

1035

1035 = 3 ² × 5 × 23. Es un número hexagonal ^{[ 14 ]} y el 45.º número triangular . ^{[ 15 ]}

1039

1039 es un primo de la forma 8n+7, ^{[ 16 ]} un primo de Chen y un primo de Lucky . Hay 1039 particiones de 30 que no contienen 1 como parte. ^{[ 17 ]}

1040

1040 = 2 ⁴ × 5 × 13. Hay 1040 piezas que se pueden ver en un teseracto de Rubik de 6 × 6 × 6 × 6.

1046

1046 = 2 × 523. Es un coeficiente de f(q), la función theta simulada de tercer orden. ^{[ 18 ]}

1047

1047 = 3 × 349. Hay 1047 maneras de dividir una composición estricta de 18 en subsecuencias contiguas que tengan la misma suma. ^{[ 19 ]}

1049

1049 es un número primo, un primo de Sophie Germain , ^{[ 7 ]} un número altamente cototiente , ^{[ 20 ]} y un primo de Chen .

1051

1051 es un número primo, un número pentagonal centrado , ^{[ 21 ]} y un número decagonal centrado .

1056

1056 = 2 ⁵ × 3 × 11. Es un número prónico . ^{[ 22 ]}

1059

1059 = 3 × 353. Es un número n tal que n ⁴ se escribe como una suma de cuatro potencias cuartas positivas. ^{[ 23 ]}

1060

1060 = 2² ^× 5 × 53. Es la suma de los primeros veinticinco primos del 2 al 97 (el número de primos menores que 100 ) ^{[ 24 ]} y la sexta suma de 10 primos consecutivos, comenzando con ^el 23 hasta el 131. ^[²⁵ ]

1061

1061 es un número primo, un número primo equivalente y un primo gemelo con 1063. Hay 1061 números primos entre 1000 y 10000 (o, el número de primos de cuatro dígitos en representación decimal ). ^{[ 26 ]}

1063

1063 es un número primo, un superprimo , un primo gemelo con 1061 , un primo cercano a la pared-sol-sol. ^{[ 27 ]} y la suma de siete primos consecutivos (137 + 139 + 149 + 151 + 157 + 163 + 167)

1069

1069 es un número primo y un emirp . ^{[ 28 ]}

1076

1076 = 2 ² × 269. Hay 1076 árboles estrictos de peso 11. ^{[ 29 ]}

1078

1078 = 2 × 7 ² × 11. Es una transformada de Euler de enteros negativos . ^{[ 30 ]}

1080

1080 = 2³ ^× 3³ ^× 5. Es un número pentagonal ^{[ 31 ]} y un número compuesto en gran medida . ^{[ 32 ]}

1081

1081 = 23 × 47. Es el 46.º número triangular ^{[ 15 ]} y un miembro de la secuencia de Padovan . ^{[ 33 ]}

1086

1086 = 2 × 3 × 181. Es un número de Smith ^{[ 34 ]} y la suma de la función totiente para los primeros 59 enteros.

1087

1087 es un número primo, un superprimo, un primo primo y un primo afortunado . ^{[ 35 ]}

1089

1091

1091 es un número primo, un primo primo y un primo gemelo de 1093.

1093

1093 es un primo gemelo de 1091. Junto con 1091 y 1097, forma una terna de primos . Es un primo feliz y un primo estrella ^{[ 36 ]} . También es el primo de Wieferich más pequeño . 1093 es un primo repunit en base 3 porque:

1093=1111111_{3}=3^{6}+3^{5}+3^{4}+3^{3}+3^{2}+3^{1}+3^{0}={\frac {3^{7}-1}{2}}\,.

1096

1096 = 2 ³ × 137. Hay 1096 particiones sólidas estrictas de 18. ^{[ 37 ]}

1097

1097 es un número primo, un emirp , ^{[ 28 ]} y un primo de Chen .

1100 a 1199

1102

1102 = 2 × 19 × 29. Es la suma de la función totiente para los primeros 60 enteros.

1103

1103 es un número primo, un primo de Sophie Germain , ^{[ 7 ]} y un primo equilibrado . ^{[ 38 ]}

1104

1104 = 2 ⁴ × 3 × 23. Es un número de Keith ^{[ 39 ].}

1105

1107

1107 = 3 ³ × 41. Hay 1107 particiones de multiconjuntos estrictos T ₀ no isomorfos de peso 8. ^{[ 40 ]}

1109

1109 es un primo de Friedlander-Iwaniec ^{[ 41 ]} y un primo de Chen .

1113

1113 = 3 × 7 × 53. Hay 1113 particiones estrictas de 40. ^{[ 42 ]}

1114

1114 = 2 × 557. Hay 1114 maneras de escribir 22 como un producto desordenado de sumas desordenadas. ^{[ 43 ]}

1117

1117 es un número primo de Chen . Hay 1117 poliominós diagonalmente simétricos con 16 celdas. ^{[ 44 ]}

1118

1118 = 2 × 13 × 43. Hay 1118 matrices unimodulares de 2 × 2 cuyos términos están todos en {0,1,...,21}. ^{[ 45 ]}

1119

1119 = 3 × 373. Hay 1119 grafos bipartitos con 9 nodos. ^{[ 46 ]}

1122

1122 = 2 × 3 × 11 × 17. Es un número prónico. ^{[ 22 ]}

1123

1123 es un primo equilibrado . ^{[ 38 ]}

1124

1124 = 2 ² × 281. Es un número de Leyland ^{[ 47 ]} usando 2 y 10: 1124 = 2 ¹⁰ + 10 ² . Es un número espía.

1126

1126 = 2 × 563. Hay 1126 matrices enteras no singulares de 2 × 2 con entradas de {0, 1, 2, 3, 4, 5}. ^{[ 48 ]}

1127

1127 = 7 ² × 23. Es el número máximo de piezas que se pueden obtener cortando un anillo con 46 cortes. ^{[ 49 ]}

1128

1128 = 2³ ^× 3 × 47. Es el 47.º número triangular ^{[ 15 ]} y el 24.º número hexagonal ^{[ 14 ]} . 1128 es la representación dimensional del álgebra de operador de vértice más grande con carga central de 24 _,D₂₄ ^[⁵⁰^] .

1129

1129 es un número primo. Hay 1129 puntos de la red dentro de un círculo de radio 19. ^{[ 51 ]}

1130

1130 = 2 × 5 × 113. Es un número skiponacci. ^{[ 52 ]}

1131

1131 = 3 × 13 × 29. Hay 1131 aristas en el triángulo hexagonal T(26). ^{[ 53 ]}

1132

1132 = 2 ² × 283. Hay 1132 grafos simples sin etiquetar con 9 nodos de 2 colores cuyos componentes son grafos completos. ^{[ 54 ]}

1133

1133 = 11 × 103. Hay 1133 subsecuencias primitivas de {1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15}. ^{[ 55 ]}

1135

1135 = 5 × 227. Es un número triangular centrado . ^{[ 56 ]}

1136

1136 = 2 ⁴ × 71. Hay 1136 conjuntos de vértices independientes y cubiertas de vértices en el grafo 7-sunlet . ^{[ 57 ]}

1137

1137 = 3 × 379. Es la suma de los valores de los vértices del nivel 5 de la pirámide hiperbólica de Pascal. ^{[ 58 ]}

1139

1139 = 17 × 67. Es el índice de Wiener del grafo de molino de viento D(3,17). ^{[ 59 ]}

1140

1140 = 2² ^× 3 × 5 × 19. Es un número tetraédrico . ^{[ 60 ]}

1141

1141 = 7 × 163. Es un número de Knödel de 7. ^{[ 61 ]}

1142

1142 = 2 × 571. Es un número espía y un número n tal que n ³² + 1 es primo. ^{[ 62 ]}

1143

1143 = 3 ² × 127. Hay 1143 particiones de conjuntos de 8 elementos con 2 conectores. ^{[ 63 ]}

1145

1145 = 5 × 229. Es un número de Knödel de grado 5. ^{[ 64 ]}

1150

1150 = 2 × 5 ² × 23. Hay 1150 diamantes de 11 miembros sin simetría bilateral. ^{[ 65 ]}

1151

1151 es el primer número primo después de una brecha de primos de 22. ^{[ 66 ]} También es un primo de Chen .

1152

1152 = 2 ⁷ × 3 ² . Es un número altamente totiente , ^{[ 67 ]} un número 3-suave y un número de Aquiles .

1153

1153 es un superprimo y un primo Proth . ^{[ 68 ]}

1154

1154 = 2 × 577. Como 1154 = 2 × 24² ⁺ 2, hay 1154 puntos en la superficie del tetraedro con longitud de arista 24. ^{[ 69 ]}

1155

1155 = 3 × 5 × 7 × 11. Es el producto de los primeros cuatro primos impares. Hay 1155 aristas en la unión de dos grafos cíclicos de orden 33.

1156

1156 = 2² ^× 17² ⁼ 34² ^. Es un número octaédrico , ^{[ 70 ]} un número pentagonal centrado, ^{[ 21 ]} y un número hendecagonal centrado. ^{[ 71 ]}

1157

1157 = 13 × 89. Es el número más pequeño que se puede escribir como n^2+1 sin ningún factor primo de la forma a^2+1. ^{[ 72 ]}

1158

1158 = 2 × 3 × 193. Hay 1158 puntos en la superficie de un octaedro con una longitud de arista de 17. ^{[ 73 ]}

1159

1159 = 19 × 61. Es un número octaédrico centrado ^{[ 74 ]} y un miembro de la secuencia de Mian-Chowla. ^{[ 9 ]}

1160

1160 = 2³ ^× 5 × 29. Es un número octogonal . ^{[ 75 ]}

1161

1161 = 3³ ^× 43. Es la suma de los primeros veintiséis números primos.

1162

1162 = 2 × 7 × 83. Es la suma de la función totiente para los primeros 61 enteros y un número pentagonal. ^{[ 31 ]}

1163

1163 es un número primo de Chen .

1164

1164 = 2 ² × 3 × 97. Hay 1164 cadenas de multiconjuntos que particionan un multiconjunto normal de peso 8, donde un multiconjunto es normal si abarca un intervalo inicial de enteros positivos ^{[ 76 ].}

1165

1165 = 5 × 233. Es un número de Knödel de orden 5. ^{[ 64 ]}

1169

1169 = 7 × 167. Es un número altamente cototiente ^{[ 20 ].}

1171

1171 es un número superprimo.

1173

1173 = 3 × 17 × 23. Hay 1173 triangulaciones simples en un plano con 9 nodos. ^{[ 77 ]}

1174

1174 = 2 × 587. Hay 1174 composiciones ampliamente totalmente normales de 16. (secuencia A332337 en el OEIS ) .

1175

1175 = 5 ² × 47. Es el número máximo de piezas que se pueden obtener cortando un anillo con 47 cortes. ^{[ 49 ]}

1176

1176 = 2³ ^× 3 × 7² ^. Es el 48.º número triangular . ^{[ 15 ]}

1178

1178 = 2 × 19 × 31. Hay 1178 puntos de superficie en un cubo con longitud de arista 15. ^{[ 10 ]}

1179

1179 = 3 ² × 131. Hay 1179 permanentes diferentes de matrices binarias de 7 por 7. ^{[ 78 ]}

1182

1182 = 2 × 3 × 197. Hay 1182 collares posibles con 14 cuentas de 2 colores (que no se pueden voltear). ^{[ 79 ]}

1184

1184 = 2 ⁵ × 37. Es un número amigo de 1210. ^{[ 80 ]}

1186

1186 = 2 × 593. Hay 1186 poliominós diagonalmente simétricos con 15 celdas. ^{[ 44 ]}

1187

1187 es un primo seguro, ^{[ 11 ]} un primo de Stern , ^{[ 81 ]} un primo equilibrado, ^{[ 38 ]} y un primo de Chen .

1190

1190 = 2 × 5 × 7 × 17. Es un número pronónico. ^{[ 22 ]} Construir un castillo de naipes de 28 niveles requiere 1190 cartas. ^{[ 82 ]}

1191

1191 = 3 × 397 = 35 ² - 35 + 1 = H ₃₅ , el 35º número de Hogben. ^{[ 83 ]}

1192

1192 = 2³ ^× 149. Es la suma de la función totiente para los primeros 62 enteros.

1193

1193 es un número primo de Chen .

4 ¹¹⁹³ - 3 ¹¹⁹³ es primo .

1194

1194 = 2 × 3 × 199. Hay 1194 permutaciones que se pueden alcanzar con 8 movimientos de 2 alfiles y 1 torre en un tablero de ajedrez de 3 × 3. ^{[ 84 ]}

1196

1196 = 2 ² × 13 × 23 = $\sum _{k=1}^{38}\sigma (k)$ . ^{[ 85 ]}

1198

1198 = 2 × 599. Es un número heptagonal centrado. ^{[ 86 ]}

1199

1199 = 11 × 10⁹. Es el área del vigésimo trapecio unido . ^{[ 87 ]}

1200 a 1299

1200

1200 = 2 ⁴ × 3 × 5 ² . Hay 1200 hogares en la muestra de calificaciones de Nielsen . ^{[ 88 ]}

1200 se conoce como el millar largo o diez centenas largas de 120 cada una. Es la forma tradicional de contar grandes números en las lenguas germánicas .

1201

1201 es un superprimo , un número cuadrado centrado, ^{[ 8 ]} y un número decagonal centrado .

1202

1202 = 2 × 601. Hay un máximo de 1202 regiones cuando el plano se divide por 25 elipses . ^{[ 89 ]}

1203

1203 = 3 × 401. Es el número más pequeño mayor que 1000 en la secuencia de coordenadas para el teselado (2,6,∞) del plano hiperbólico. ^{[ 90 ]}

1204

1204 = 2² ^× 7 × 43. Es la constante mágica para un cubo mágico de 7 × 7 × 7. ^{[ 91 ]}

1205

1205 = 5 × 241. Hay 1205 particiones de 28 tales que el número de partes impares es una parte ^{[ 92 ].}

1207

1207 = 17 × 71. Es un número de Polignac compuesto . ^{[ 93 ]}

1208

1208 = 2 ³ × 151. Hay 1208 cadenas estrictas de divisores que comienzan con el superprimorial A006939(3). ^{[ 94 ]}

1210

1210 = 2 × 5 × 11 ² . Es un número amigable con 1184 ^{[ 95 ]} y un número autodescriptivo .

1211

1211 = 7 × 173. Es un número compuesto de Polignac ^{[ 93 ].}

1212

1212 = 2 ² × 3 × 101 = $\sum _{k=0}^{17}p(k)$ , dónde $p(k)$ es el número de particiones de $k$ . ^{[ 96 ]}

1213

1213 es un número primo y un emirp .

1214

1214 = 2 × 607. Es un número espía y la suma de los primeros 39 números compuestos. ^{[ 97 ]}

1215

1215 = 3 ⁵ × 5. Hay 1215 aristas en el triángulo hexagonal T(27) ^{[ 53 ].}

1216

1216 = 2 ⁶ × 19. Es un número nonagonal ^{[ 98 ].}

1217

1217 es un superprimo y un primo Proth. ^{[ 68 ]}

1219

1219 = 23 × 53. Es un número triangular centrado ^{[ 56 ]} y un cero de la función de Mertens .

1220

1220 = 2² ^× 5 × 61. Es un cero de la función de Mertens. Hay 1220 vectores binarios de longitud 16 que no contienen elementos únicos. ^{[ 99 ]}

1222

1222 = 2 × 13 × 47. Es un número piramidal hexagonal .

1223

1223 es el 200º número primo. ^{[ 38 ]} También es un primo de Sophie Germain ^{[ 7 ]} y un primo equilibrado.

1224

1224 = 2³ ^× 3² ^× 17. Hay 1224 aristas en la unión de dos grafos cíclicos, ambos de orden 34. ^{[ 100 ]}

1225

1225 = 5 ² × 7 ² = 35 ² . Es el número más pequeño mayor que 1 que es un número triangular , ^{[ 15 ]} un número cuadrado y un número hexagonal . ^{[ 14 ]}^{[ 101 ]} Es el segundo número triangular cuadrado mayor que 1. ^{[ 102 ]} Es el 49.º número triangular, el 35.º número cuadrado, el 25.º número hexagonal, un número octogonal centrado, ^{[ 103 ]} un número 29-gonal, ^{[ 104 ]} un número 60-gonal, ^{[ 105 ]} y un número 124-gonal. Es la suma de 5 cubos impares consecutivos:

1225 = 1 ³ + 3 ³ + 5 ³ + 7 ³ + 9 ³ .

1226

1226 = 2 × 613. Hay 1226 árboles de identidad enraizados con 15 nodos. ^{[ 106 ]}

1228

1228 = 2 ² × 307. Es la suma de la función totiente para los primeros 63 enteros.

1229

1229 es un primo de Sophie Germain ^{[ 7 ]} y un emirp . Hay 1229 primos menores que 10 000.

1230

1230 = 2 × 3 × 5 × 41 = T(9, 6), el número de Mahon. ^{[ 107 ]}

1231

1231 es un número primo y un emirp.

1232

1232 = 2 ⁴ × 7 × 11. Hay 1232 conjuntos ordenados etiquetados de particiones de un conjunto de 7 en partes impares. ^{[ 108 ]}

1234

1234 = 2 × 617. Tiene dos factores primos distintos , lo que lo convierte en un semiprimo libre de cuadrados . Es el número entero más pequeño que contiene todos los números del 1 al 4. Hay 1234 partes en todas las particiones de 30 en partes distintas. ^{[ 109 ]} Hay 1234 conjuntos de vértices independientes en una cuadrícula cuadrada de 4×4 . De manera equivalente, hay 1234 matrices binarias de 4×4 distintas en las que no hay dos elementos adyacentes que sean ambos iguales a 1.

Un estudio de 2012 sobre los números de identificación personal (PIN) más utilizados reveló que, entre los códigos PIN de 4 dígitos, el 1234 es el más elegido.

1236

1236 = 2 ² × 3 × 103 = 617 + 619, la suma de un par de primos gemelos. ^{[ 110 ]}

1238

1238 = 2 × 619. Hay 1238 particiones de 31 que no contienen 1 como parte. ^{[ 17 ]}

1239

1239 = 3 × 7 × 59. Es un número de palillo de dientes en 3 dimensiones. ^{[ 111 ]}

1240

1240 = 2³ ^× 5 × 31. Es un número piramidal cuadrado. ^{[ 112 ]}

1241

1241 = 17 × 73. Es un número cúbico centrado ^{[ 113 ]} y un número espía.

1243

1243 = 11 × 113. Es un número de Polignac compuesto. ^{[ 93 ]}

1244

1244 = 2 ² × 311. Hay 1244 particiones completas de 25. ^{[ 114 ]}

1245

1245 = 3 × 5 × 83. Hay 1245 sistemas de conjuntos intersecantes etiquetados que abarcan 5 vértices. ^{[ 115 ]}

1247

1247 = 29 × 43. Es un número pentagonal. ^{[ 31 ]}

1249

1249 es un número primo, un emirp y un número trimórfico . ^{[ 116 ]}

1251

1251 = 3 ² × 139. Dado que 1251 = 2 × 25 ² + 1, existen 1251 determinantes diferentes de matrices de 2 × 2 con entradas enteras de 0 a 25. ^{[ 117 ]}

1252

1252 = 2 ² × 313. Dado que 1252 = 2 × 25 ² + 2, hay 1252 puntos en la superficie de un tetraedro con longitud de arista 25. ^{[ 69 ]}

1255

1255 = 5 × 251. Es un cero de la función de Mertens. Hay 1255 particiones de 23. ^{[ 118 ]} Hay 1255 maneras de escribir 23 como un producto desordenado de sumas desordenadas. ^{[ 43 ]}

1257

1257 = 3 × 419. Hay 1257 puntos de la red dentro de un círculo de radio 20. ^{[ 51 ]}

1259

1259 es un número primo y un número altamente cototiente . ^{[ 20 ]}

1260

1260 = 2 ² × 3 ² × 5 × 7. Es un número prónico, ^{[ 22 ]} el número vampiro más pequeño , ^{[ 119 ]} el decimosexto número altamente compuesto , ^{[ 120 ]} y la suma de la función totiente para los primeros 64 enteros. Hay 1260 particiones estrictas de 41. ^{[ 42 ]}

1261

1261 = 13 × 97. Es un número estrella ^{[ 36 ]} y un cero de la función de Mertens.

1264

1264 = 2 ⁴ × 79. Es la suma de los primeros 27 números primos.

1265

1265 = 5 × 11 × 23. Hay 1265 árboles con raíz de 43 vértices en los que los vértices del mismo nivel tienen el mismo grado. ^{[ 121 ]}

1266

1266 = 2 × 3 × 211. Es un número pentagonal centrado ^{[ 21 ]} y un cero de la función de Mertens.

1267

1267 = 7 × 181. Es un número de Knödel de 7. ^{[ 61 ]}

1269

1269 = 3 ³ × 47. Completar 11 revoluciones en la Espiral de Teodoro requiere 1269 triángulos. ^{[ 122 ]}

1275

1275 = 3 × 5 ² × 17. Es el 50.º número triangular . ^{[ 15 ]}

1276

1276 = 2 ² × 11 × 29. Hay 1276 conjuntos irredundantes en el grafo de la fiesta de cóctel de 25 elementos . ^{[ 123 ]}

1277

1277 es un número primo. Es el inicio de una constelación prima de longitud 9 (un "nonuplo primo").

1278

1278 = 2 × 3 ² × 71. Hay 1278 vacas y terneros de Narayana después de 20 años. ^{[ 124 ]}

1279

1279 es un número primo y un exponente primo de Mersenne .

1280

1280 = 2 ⁸ × 5. Hay 1280 partes en todas las composiciones de 9. ^{[ 125 ]}

1281

1281 = 3 × 7 × 61. Es un número octogonal . ^{[ 75 ]}

1283

1283 es un número primo seguro. ^{[ 11 ]}

1284

1284 = 2 ² × 3 × 107 = 641 + 643, la suma de un par de primos gemelos. ^{[ 110 ]}

1285

1285 = 5 × 257. Hay 1285 nonominós libres .

1286

1286 = 2 × 643. Hay 1286 figuras planas conectadas no equivalentes que se pueden formar a partir de cinco rectángulos (o dominós) de 1 × 2, de manera que cada par de rectángulos contiguos comparte exactamente una arista de longitud 1, y el grafo de adyacencia de los rectángulos es un árbol. ^{[ 126 ]}

1287

1287 = 3 ² × 11 × 13 = ${13 \choose 5}$ . ^{[ 127 ]}

1288

1288 = 2³ ^× 7 × 23. Es un número heptagonal . ^{[ 128 ]}

1289

1289 es un número primo de Sophie Germain ^{[ 7 ]} y un primo gemelo de 1291. 1289 es un número deficiente porque la suma de todos sus divisores positivos (excepto él mismo) es menor que 1289. 1289 es un número malo porque tiene un número par de 1 en su expansión binaria.

1291

1291 es un número primo gemelo de 1289.

1292

1292 = 2 ² × 17 × 19. fi(1292) = fi(sigma(1292)). ^{[ 129 ]}

1295

1295 = 5 × 7 × 37. Hay 1295 aristas en la unión de dos grafos cíclicos, ambos de orden 35. ^{[ 100 ]}

1296

1296 = 2⁴ ^× 3⁴ ⁼ 6⁴ ⁼ 36² ^. Es la suma de los cubos de los primeros ocho enteros positivos:

1 ³ + 2 ³ + 3 ³ + 3 ³ + 4 ³ + 5 ³ + 6 ³ + 7 ³ + 8 ³ = 1296.

En un tablero de ajedrez normal de 8 × 8 hay 1296 rectángulos . Hay 1296 combinaciones de 2 caracteres alfanuméricos .

1297

1297 es un superprimo , un número de molinete, ^{[ 130 ]} y un cero de la función de Mertens.

1300 a 1399

1300

1300 = 2² ^× 5² ^× 13. Es un cero de la función de Mertens y el número hiperperfecto par más pequeño con factor impar . Es la suma de las primeras 4 quintas potencias:

1300 = 1 ⁵ + 2 ⁵ + 3 ⁵ + 4 ⁵ .

1301

1301 es un número primo y un número cuadrado centrado . ^{[ 8 ]} Hay 1301 árboles con 13 nodos sin etiquetar. ^{[ 131 ]}

1306

1306 = 2 × 653. Es un número triangular centrado . ^{[ 56 ]}

1307

1307 es un número primo seguro . ^{[ 11 ]}

1308

1308 = 2² ^× 3 × 10⁹. Es la suma de la función totiente para los primeros 65 enteros.

1312

1312 = 2 ⁵ × 41. Es un miembro de la secuencia de Mian-Chowla . ^{[ 9 ]}

1316

1316 = 2 ² × 7 × 47. Es la transformación de Euler de sigma(11). ^{[ 132 ]}

1319

1319 es un número primo seguro . ^{[ 11 ]}

1320

1320 = 2³ ^× 3 × 5 × 11 = 659 + 661, la suma de un par de primos gemelos . ^{[ 110 ]}

1325

1325 = 5 ² × 53. Es un número de Markov ^{[ 133 ]} y un número tetraédrico centrado . ^{[ 134 ]}

1326

1326 = 2 × 3 × 13 × 17. Es el 51.º número triangular ^{[ 15 ]} y un número hexagonal . ^{[ 14 ]}

1327

1327 es el número primo más pequeño que precede a una brecha de números primos de 34.

1328

1328 = 2 ⁴ × 83. Es la suma de la función totiente para los primeros 66 enteros.

1330

1330 = 2 × 5 × 7 × 19. Es un número tetraédrico . ^{[ 60 ]} Forma un par Ruth-Aarón con 1331 según la segunda definición.

1331

1331 = 11 ³ . Es un número heptagonal centrado . ^{[ 86 ]} Forma un par Ruth-Aaron con 1330 bajo la segunda definición.

1334

1334 = 2 × 23 × 29. El número máximo de regiones en las que se puede dividir el plano dibujando 37 círculos es 1334. ^{[ 135 ]}

1335

1335 = 3 × 5 × 89. Es un número pentagonal . ^{[ 31 ]}

1342

1342 = 2 × 11 × 61 = $\sum _{k=1}^{40}\sigma (k)$ . ^{[ 85 ]}

1346

1346 = 2 × 673. Hay 1346 árboles enraizados disjuntos localmente con 10 nodos. ^{[ 136 ]}

1350

1350 = 2 × 3 ³ × 5 ² . Es un número nonagonal . ^{[ 98 ]}

1353

1353 = 3 × 11 × 41. Como 1353 = 2 × 26² ⁺ 1, hay 1353 determinantes diferentes de 2 × 2 con entradas enteras de 0 a 26. ^{[ 117 ]}

1361

1361 es el primer número primo después de una brecha de primos de 34 ^{[ 66 ]} y el tercer primo de Mills . Es un número decagonal centrado .

1363

1363 = 29 × 47. Hay 1363 maneras de modificar una disposición circular de 14 objetos intercambiando uno o más pares adyacentes. ^{[ 137 ]}

1364

1364 = 2² ^× 11 × 31. Es un número de Lucas. ^{[ 138 ]}

1365

1365 = 3 × 5 × 7 × 13. Es un número pentatópico . ^{[ 139 ]}

1367

1367 es un primo seguro ^{[ 11 ]} y un primo equilibrado . Es la suma de tres, nueve y once primos consecutivos: (449 + 457 + 461, 131 + 137 + 139 + 149 + 151 + 157 + 163 + 167 + 173 y 101 + 103 + 107 + 109 + 113 + 127 + 131 + 137 + 139 + 149 + 151), ^{[ 38 ]}

1368

1368 = 2 ³ × 3 ² × 19. Hay 1368 aristas en la unión de dos grafos cíclicos , ambos de orden 36. ^{[ 100 ]}

1371

1371 = 3 × 457. Es la suma de los primeros 28 números primos.

1373

1373 es un número primo. Hay 1373 puntos de la red dentro de un círculo de radio 21 ^{[ 51 ].}

1377

1377 = 3 ⁴ × 17. Es el número máximo de piezas que se pueden obtener cortando un anillo con 51 cortes ^{[ 49 ].}

1378

1378 = 2 × 13 × 53. Es el 52º número triangular ^{[ 15 ].}

1379

1379 = 7 × 197. Es la constante mágica del cuadrado mágico normal n × n y del problema de las n reinas para n = 14.

1380

1380 = 2 ² × 3 × 5 × 23. Hay 1380 asignaciones de 8 pasos con 4 entradas. ^{[ 140 ]}

1381

1381 es un número primo y un número pentagonal centrado . ^{[ 21 ]}

1384

1384 = 2 ³ × 173 = $\sum _{k=1}^{41}\sigma (k)$ ^{[ 85 ]}

1385

1385 = 5 × 277. Es un número ascendente/descendente . ^{[ 141 ]}

1387

1387 = 19 × 73. Es el quinto pseudoprimo de Fermat de base 2, ^{[ 142 ]} el vigésimo segundo número hexagonal centrado , el decimonoveno número decagonal , ^{[ 143 ]} y el segundo número de Super-Poulet . ^{[ 144 ]}

1388

1388 = 2 ² × 347. Porque 1388 = 4 × 19 ² - 3 × 19 + 1, está en el eje x de la espiral de Ulams . ^{[ 145 ]}

1393

1393 = 7 × 199. Es un número de Knödel de 7. ^{[ 61 ]}

1394

1394 = 2 × 17 × 41. Es la suma de la función totiente para los primeros 67 enteros.

1395

1395 = 3 ² × 5 × 19. Es un número vampiro ^{[ 119 ]} y un miembro de la secuencia Mian–Chowla ^{[ 9 ].}

1369

1396 = 2² ^× 349. Es un número triangular centrado . ^{[ 56 ]}

1399

1399 es un número primo y un emirp. ^{[ 146 ]}

1400 a 1499

1403

1403 = 23 × 61. Es el número más pequeño x tal que M(x) = 11, donde M() es la función de Mertens ^{[ 147 ].}

1404

1404 = 2² ^× 3² ^× 13. Es un número heptagonal . ^{[ 128 ]}

1405

1405 = 5 × 281 = 26² ⁺ 27² ⁼ 7² ⁺ 8² ⁺ ... + 16² ^. Es un número cuadrado centrado ^{[ 8 ] .}

1406

1406 = 2 × 19 × 37. Es un número semiméndrico . ^{[ 148 ]}

1409

1409 es un superprimo , un primo de Sophie Germain, ^{[ 7 ]} y un primo de Proth. ^{[ 68 ]}

1410

1410 = 2 × 3 × 5 × 47. Es el denominador del 46º número de Bernoulli ^{[ 149 ].}

1418

1418 = 2 × 709. Es el número más pequeño x tal que M(x) = 13, donde M() es la función de Mertens ^{[ 147 ].}

1425

1425 = 3 × 5 ² × 19. Es un número autodescriptivo en base 5.

1426

1426 = suma de la función totiente para los primeros 68 enteros, número pentagonal, ^{[ 31 ]} número de particiones estrictas de 42 ^{[ 42 ]}

1427

1427 = primo gemelo junto con 1429 ^{[ 150 ]}

1428

1428 = número de árboles ternarios completos con 6 nodos internos o 18 aristas; ^{[ 151 ]}

1429

1429 = primo gemelo junto con 1427 ^{[ 150 ]}

1430

1430 = número catalán ^{[ 152 ]}

1431

1431 = 53.º número triangular , ^{[ 15 ]} número hexagonal ^{[ 14 ]}

1432

1432 = miembro de la secuencia de Padova ^{[ 33 ]}

1433

1433 = superprimo , ^{[ 153 ]}

1435

1435 = número de vampiro ; ^{[ 119 ]}

1436

1436 = discriminante de un campo cúbico totalmente real ^{[ 154 ]}

1437

1437 = número más pequeño de complejidad 20: número más pequeño que requiere 20 1 para construir usando +, * y ^ ^{[ 155 ]}

1439

1439 = primo de Sophie Germain, ^{[ 7 ]} primo seguro ^{[ 11 ]}

1440

1440 = un número altamente totiente , ^{[ 67 ]} un número en gran medida compuesto ^{[ 32 ]}

1441

1441 = número de estrella ^{[ 36 ]}

1447

1447 = superprimo , número feliz

1451

1451 = Sophie Germain prima ^{[ 7 ]}

1452

1452 = primer índice de Zagreb del grafo completo K ₁₂^{[ 156 ]}

1453

1453 = Prime sexy con 1459

1458

1458 = 2 × 3 ⁶ . Es el determinante máximo de una matriz de 11 por 11 de ceros y unos ^{[ 157 ]} y un número 3-suave .

1458 es uno de los tres números que, al sumar sus dígitos en base 10, producen una suma que, al multiplicarse por su valor inverso, da como resultado el número original:

1 + 4 + 5 + 8 = 18

18 × 81 = 1458

Los únicos otros números no triviales con esta propiedad son 81 y 1729 , así como las soluciones triviales 1 y 0. Fue demostrado por Masahiko Fujiwara . ^{[ 158 ]}

1459

1459 = Primo sexy con 1453, suma de nueve primos consecutivos (139 + 149 + 151 + 157 + 163 + 167 + 173 + 179 + 181), primo de Pierpont

1462

1462 = (35 - 1) × (35 + 8) = el primer índice de Zagreb del grafo de rueda con 35 vértices ^{[ 159 ]}

1465

1465 = 5- Número de Knödel ^{[ 64 ]}

1466

1466 = $\sum _{k=1}^{256}d(k)$ , dónde $d(k)$ = número de divisores de $k$ ^{[ 160 ]}

1467

1467 = número de particiones de 39 con manivela cero ^{[ 161 ]}

1469 = número octaédrico, ^{[ 70 ]} número altamente cototiente ^{[ 20 ]}
1470 = número piramidal pentagonal , ^{[ 162 ]} suma de la función totiente para los primeros 69 enteros
1471 = superprimo , número heptagonal centrado ^{[ 86 ]}
1476 = número perfecto central ^{[ 163 ]}
1477 = número de 7 Knödel ^{[ 61 ]}
1480 = suma de los primeros 29 números primos
1481 = Sophie Germain prima ^{[ 7 ]}
1485 = 54º número triangular ^{[ 15 ]}
1486 = número de particiones sólidas estrictas de 19 ^{[ 37 ]}
1487 = primo seguro ^{[ 11 ]}
1489 = número triangular centrado ^{[ 56 ]}
1490 = número de tetranacci ^{[ 164 ]}
1491 = número nonagonal, ^{[ 98 ]}
1492 = discriminante de un campo cúbico totalmente real, ^{[ 154 ]}
1493 = primo de Stern ^{[ 81 ]}
1494 = suma de la función totiente para los primeros 70 enteros
1496 = número piramidal cuadrado ^{[ 112 ]}
1499 = Sophie Germain prima, ^{[ 7 ]} superprima

1500 a 1599

1500 = hipotenusa en tres triángulos pitagóricos diferentes ^{[ 165 ]}
1501 = número pentagonal centrado ^{[ 21 ]}
1502 = número de pares de enteros consecutivos x, x+1 tales que todos los factores primos de x y x+1 son como máximo 47 ^{[ 166 ]}
1503 = menor número de triángulos de la Espiral de Teodoro para completar 12 revoluciones ^{[ 122 ]}
1504 = número abundante primitivo ( número abundante cuyos divisores propios son todos números deficientes ) ^{[ 167 ]}
1508 = número piramidal heptagonal ^{[ 168 ]}
1509 = número de molinillo ^{[ 130 ]}
1510 = número deficiente , número odioso
1511 = primo de Sophie Germain, ^{[ 7 ]} primo equilibrado ^{[ 38 ]}
1513 = número cuadrado centrado ^{[ 8 ]}
1516 = $\left\lfloor 9^{\frac {10}{3}}\right\rfloor$ ^{[ 169 ]}
1517 = número de puntos de la red dentro de un círculo de radio 22 ^{[ 51 ]}
1519 = número de polihexágonos con 8 celdas, ^{[ 170 ]} función de Mertens cero
1520 = número pentagonal, ^{[ 31 ]} cero de la función de Mertens, forma un par Ruth-Aaron con 1521 bajo la segunda definición.
1521 = 39 ² , función de Mertens cero, número octogonal centrado, ^{[ 103 ]} forma un par Ruth-Aaron con 1520 bajo la segunda definición
1523 = superprimo , cero de la función de Mertens, primo seguro, ^{[ 11 ]} miembro de la secuencia de Mian-Chowla ^{[ 9 ]}
1525 = número heptagonal, ^{[ 128 ]}
1526 = número de clases de conjugación en el grupo alternante A ₂₇^{[ 171 ]}
1527 = número de particiones bidimensionales de 11, ^{[ 172 ]}
1529 = número compuesto de Polignac ^{[ 93 ]}
1530 = número de vampiro ^{[ 119 ]}
1531 = número primo, número decagonal centrado , cero de la función de Mertens
1532 = número de redes serie-paralelo con 9 aristas sin etiquetar, ^{[ 173 ]} función de Mertens cero
1535 = Número de Thabit
1536 = un tamaño común de microplaca , número 3-suave (2 ⁹ ×3), número de funciones umbral de exactamente 4 variables ^{[ 174 ]}
1537 = Número de Keith, ^{[ 39 ]}
1539 = número máximo de piezas que se pueden obtener cortando un anillo con 54 cortes ^{[ 49 ]}
1540 = 55º número triangular , ^{[ 15 ]} número hexagonal, ^{[ 14 ]} número decagonal, ^{[ 143 ]} número tetraédrico ^{[ 60 ]}
1541 = número octogonal ^{[ 75 ]}
1543 = primo que divide todas las secuencias de Fibonacci, ^{[ 175 ]}
1546 = número de matrices binarias de 5 x 5 con como máximo un 1 en cada fila y columna, ^{[ 176 ]} cero de la función de Mertens
1547 = número piramidal hexagonal
1548 = número perfecto central ^{[ 163 ]}
1549 = prima de Polignac ^{[ 177 ]}
1550 = ${\frac {31\times (3\times 31+7)}{2}}$ = número de cartas necesarias para construir un castillo de naipes de 31 niveles con un techo plano de una carta de ancho ^{[ 178 ]}
1552 = Número de particiones de 57 en partes primas.
1556 = suma de los cuadrados de los primeros nueve números primos
1557 = número de grafos con 8 nodos y 13 aristas ^{[ 179 ]}
1559 = Sophie Germain prima ^{[ 7 ]}
1561 = un número octaédrico centrado , ^{[ 74 ]} número de árboles reducidos en serie con 19 nodos ^{[ 180 ]}
1562 = número máximo de regiones en las que se divide el plano dibujando 40 círculos ^{[ 135 ]}
1563 = $\sum _{k=1}^{50}{\frac {50}{\gcd(50,k)}}$ ^{[ 181 ]}
1564 = suma de la función totiente para los primeros 71 enteros
1565 = ${\sqrt {1036^{2}+1173^{2}}}$ y $1036+1173=47^{2}$ ^{[ 182 ]}
1566 = número k tal que k ⁶⁴ + 1 es primo
1567 = número de particiones de 24 con al menos una parte distinta ^{[ 183 ]}
1568 = Número de Aquiles ^{[ 184 ]}
1569 = 2 × 28 ² + 1 = número de determinantes diferentes de 2 × 2 con entradas enteras de 0 a 28 ^{[ 117 ]}
1570 = 2 × 28 ² + 2 = número de puntos en la superficie del tetraedro con longitud de arista 28 ^{[ 69 ]}
1571 = Honaker primo ^{[ 153 ]}
1572 = miembro de la secuencia Mian–Chowla ^{[ 9 ]}
1573 = discriminante de un campo cúbico totalmente real ^{[ 154 ]}
1575 = número impar abundante , ^{[ 185 ]} suma de los números no triangulares entre números triangulares sucesivos , número de particiones de 24 ^{[ 118 ]}
1583 = Sophie Germain primo
1585 = número de Riordan , número triangular centrado ^{[ 56 ]}
1587 = 3 × 23 ² = número de aristas de un grafo tripartito completo de orden 69, K _23,23,23^{[ 186 ]}
1588 = suma de la función totiente para los primeros 72 enteros
1589 = número compuesto de Polignac ^{[ 93 ]}
1592 = suma de todos los divisores de los primeros 36 números impares ^{[ 187 ]}
1593 = suma de los primeros 30 números primos
1594 = costo mínimo de altura máxima del árbol Huffman de tamaño 17 ^{[ 188 ]}
1595 = número de sistemas de conjuntos no isomorfos de peso 10
1596 = 56º número triangular ^{[ 15 ]}
1597 = primo de Fibonacci , ^{[ 189 ]} primo de Markov , ^{[ 133 ]} superprimo , emirp
1599 = número de aristas en la unión de dos grafos cíclicos, ambos de orden 39 ^{[ 100 ]}

1600 a 1699

1600 = 40 ² , dígito repetido en base 7 (4444 ₇ ),
1601 = Sophie Germain prima, Proth prima, ^{[ 68 ]}
1602 = número de puntos en la superficie de un octaedro con longitud de arista 20 ^{[ 73 ]}
1603 = número de particiones de 27 con rango no negativo ^{[ 190 ]}
1604 = número de composiciones de 22 en partes primas ^{[ 191 ]}
1605 = número de poliominós que constan de 7 octágonos regulares ^{[ 192 ]}
1607 = miembro de la terna prima con 1609 y 1613 ^{[ 193 ]}
1608 = $\sum _{k=1}^{44}\sigma (k)$ ^{[ 85 ]}
1610 = número de particiones estrictas de 43 ^{[ 42 ]}
1611 = número de números racionales que se pueden construir a partir del conjunto de enteros entre 1 y 51 ^{[ 194 ]}
1612 = dimensión máxima de los espacios euclidianos que bastan para que toda variedad riemanniana compacta y lisa de 31 dimensiones sea realizable como una subvariedad ^{[ 195 ]}
1613 , 1607 y 1619 son todos primos ^{[ 196 ]}
1614 = número de maneras de refinar la partición 8^1 para obtener 1^8 ^{[ 197 ]}
1615 = número compuesto tal que la media cuadrática de sus factores primos es un entero no primo ^{[ 198 ]}
1616 = ${\frac {16(16^{2}+3\times 16-1)}{3}}$ = número de ternas monótonas (x,y,z) en {1,2,...,16} ³^{[ 199 ]}
1617 = número pentagonal ^{[ 31 ]}
1618 = número heptagonal centrado ^{[ 86 ]}
1619 = primo palíndromo en binario , primo seguro ^{[ 11 ]}
1620 = 809 + 811: suma de un par de primos gemelos ^{[ 110 ]}
1621 = superprimo , número de molinillo ^{[ 130 ]}
1622 = semiprimo de la forma primo + 1 ^{[ 200 ]}
1623 no es la suma de dos números triangulares y una cuarta potencia ^{[ 201 ]}
1624 = número de cuadrados en el diamante azteca de orden 28 ^{[ 202 ]}
1625 = número cuadrado centrado ^{[ 8 ]}
1626 = número pentagonal centrado ^{[ 21 ]}
1628 = número pentagonal centrado ^{[ 21 ]}
1629 = volumen redondeado de un tetraedro regular con longitud de arista 24 ^{[ 203 ]}
1631 = $\sum _{k=0}^{5}(k+1)!{\binom {5}{k}}$ ^{[ 204 ]}
1632 = número de triángulos agudos formados a partir de los vértices de un polígono regular de 18 lados ^{[ 205 ]}
1633 = número de estrella ^{[ 36 ]}
1634 = el número narcisista de cuatro dígitos más pequeño en base 10
1635 = número de particiones de 56 cuya suma recíproca es un número entero ^{[ 206 ]}
1637 = isla prima: el primo más pequeño cuyos primos adyacentes están separados exactamente por 30 ^{[ 207 ]}
1638 = número divisor armónico , ^{[ 208 ]} 5 × 2 ¹⁶³⁸ - 1 es primo ^{[ 209 ]}
1639 = número nonagonal ^{[ 98 ]}
1640 = número prónico ^{[ 22 ]}
1641 = 41 ² - 41 + 1 = H ₄₁ (el 41.º número de Hogben) ^{[ 83 ]}
1642 = número máximo de regiones en las que se divide el plano dibujando 41 círculos ^{[ 135 ]}
1643 = suma de los primeros 46 números compuestos ^{[ 97 ]}
1644 = 821 + 823: suma de un par de primos gemelos ^{[ 110 ]}
1645 = número de pseudo bodegones de 16 celdas en El juego de la vida de Conway, hasta rotación y reflexión ^{[ 210 ]}
1646 = número de grafos con 8 nodos y 14 aristas ^{[ 179 ]}
1647 y 1648 son ambos divisibles por cubos ^{[ 211 ].}
1648 = número de particiones de 34 ³ en cubos distintos ^{[ 212 ]}
1649 = número altamente cototiente, ^{[ 20 ]} número de Leyland ^{[ 47 ]} usando 4 y 5 (4 ⁵ + 5 ⁴ )
1650 = número de cartas para construir un castillo de naipes de 33 niveles ^{[ 82 ]}
1651 = número heptagonal ^{[ 128 ]}
1652 = número de particiones de 29 en un número primo de partes ^{[ 213 ]}
1653 = 57º número triangular , ^{[ 15 ]} número hexagonal, ^{[ 14 ]} número de puntos de la red dentro de un círculo de radio 23 ^{[ 51 ]}
1654 = número de particiones de 42 en divisores de 42 ^{[ 214 ]}
1656 = 827 + 829: suma de un par de primos gemelos ^{[ 110 ]}
1657 = primo cubano , ^{[ 215 ]}
1658 = compuesto más pequeño que, al sumarse a la suma de factores primos, alcanza un número primo después de 25 iteraciones ^{[ 216 ]}
1659 = número de números racionales que se pueden construir a partir del conjunto de enteros entre 1 y 52 ^{[ 194 ]}
1660 = suma de la función totiente para los primeros 73 enteros
1661 = 11 × 151, palíndromo que es producto de dos primos palíndromos ^{[ 217 ]}
1662 = número de particiones de 49 en partes relativamente primas por pares ^{[ 218 ]}
1663 = un número primo y 5 ¹⁶⁶³ - 4 ¹⁶⁶³ es un número primo de 1163 dígitos ^{[ 219 ]}
1664 = k tal que k, k+1 y k+2 son sumas de 2 cuadrados ^{[ 220 ]}
1665 = número tetraédrico centrado ^{[ 134 ]}
1666 = el mayor número pandigital eficiente en números romanos (cada símbolo aparece exactamente una vez).
1667 = 228 + 1439 y el 228º primo es 1439 ^{[ 221 ]}
1668 = número de particiones de 33 en partes todas relativamente primas a 33 ^{[ 222 ]}
1669 = superprimo , primo más pequeño con una diferencia de exactamente 24 con respecto al siguiente primo ^{[ 223 ].}
1670 = número de composiciones de 12 tales que al menos dos partes adyacentes son iguales ^{[ 224 ]}
1671 divide la suma de los primeros 1671 números compuestos ^{[ 225 ]}
1672 = 41 ² - 3 ² , la única forma de expresar 1672 como una diferencia de cuadrados primos ^{[ 226 ]}
1676 = número de particiones de 34 en partes, cada una de las cuales se utiliza un número diferente de veces ^{[ 227 ]}
1679 = número altamente cototiente, ^{[ 20 ]} semiprimo (23 × 73, véase también el mensaje de Arecibo ), número de partes en todas las particiones de 32 en partes distintas ^{[ 109 ]}
1680 = el 17º número altamente compuesto , ^{[ 120 ]} número de aristas en la unión de dos grafos cíclicos, ambos de orden 40 ^{[ 100 ]}
1681 = 41 ² , el número más pequeño que se obtiene con la fórmula n ² + n + 41 que no es primo; número octogonal centrado ^{[ 103 ]}
1682 y 1683 es un miembro de una pareja Ruth-Aaron (primera definición)
1683 = número de cerilla triangular ^{[ 228 ]}
1684 = número triangular centrado ^{[ 56 ]}
1685 = 5- Número de Knödel ^{[ 64 ]}
1686 = $\sum _{k=1}^{45}\sigma (k)$ ^{[ 85 ]}
1687 = número de 7 Knödel ^{[ 61 ]}
1688 = número de conjuntos conexos finitos de enteros positivos mayores que uno con mínimo común múltiplo 72 ^{[ 229 ]}
1689 = $9!!\sum _{k=0}^{4}{\frac {1}{2k+1}}$ ^{[ 230 ]}
1690 = número de composiciones de 14 en potencias de 2 ^{[ 231 ]}
1691 = lo mismo al revés, lo que lo convierte en un número estrobogramático ^{[ 232 ]}
1692 = número perfecto central ^{[ 163 ]}
1695 = constante mágica del cuadrado mágico normal n × n y del problema de las n -reinas para n = 15. Número de particiones de 58 en partes primas.
1696 = suma de la función totiente para los primeros 74 enteros
1698 = número de árboles enraizados con 47 vértices en los que los vértices del mismo nivel tienen el mismo grado ^{[ 121 ]}
1699 = número de árboles enraizados con 48 vértices en los que los vértices del mismo nivel tienen el mismo grado ^{[ 121 ]}

1700 a 1799

1700 = σ ₂ (39): suma de los cuadrados de los divisores de 39 ^{[ 233 ]}
1702 = palíndromo en 3 bases consecutivas: 898 ₁₄ , 787 ₁₅ , 6A6 ₁₆
1705 = número de tribonacci ^{[ 234 ]}
1706 = 1 + 4 + 16 + 64 + 256 + 1024 + 256 + 64 + 16 + 4 + 1 suma de la quinta fila del triángulo de potencias de 4 ^{[ 235 ]}
1710 = número máximo de piezas que se pueden obtener cortando un anillo con 57 cortes ^{[ 49 ]}
1711 = 58.º número triangular , ^{[ 15 ]} número decagonal centrado
1712 = número de conjuntos irredundantes en el grafo de la fiesta de 29 cócteles ^{[ 123 ]}
1713 = número de árboles enraizados aperiódicos con 12 nodos ^{[ 236 ]}
1716 = 857 + 859: suma de un par de primos gemelos, ^{[ 110 ]}
1717 = número pentagonal ^{[ 31 ]}
1718 = $\sum _{d|12}{\binom {12}{d}}$ ^{[ 237 ]}
1719 = número compuesto de Polignac ^{[ 93 ]}
1720 = suma de los primeros 31 números primos
1721 = primo gemelo; número de cuadrados entre ^42² y ^42⁴ . ^{[ 238 ]}
1722 = número de Giuga , ^{[ 239 ]} número pronico ^{[ 22 ]}
1723 = superprimo
1724 = número máximo de regiones en las que se divide el plano dibujando 42 círculos ^{[ 135 ]}
1725 = 47² ^- 22² ⁼ (primo(15)) ^² - (no primo(15)) ^²^{[ 240 ]}
1726 = número de particiones de 44 en partes distintas y relativamente primas ^{[ 241 ]}
1727 = área del trapecio 24 unido ^{[ 87 ]}
1728 = la cantidad expresada como 1000 en duodecimal , es decir, el cubo de doce (llamado gran gruesa ), y por lo tanto, el número de pulgadas cúbicas en un pie cúbico , palíndromo en base 11 (1331₁₁ ) y 23 (363₂₃ )
1729 = número de taxi , número de Carmichael, número de Zeisel, número de cubo centrado, número de Hardy-Ramanujan . En la expansión decimal de e, la primera vez que aparecen los 10 dígitos en secuencia comienza en el dígito 1729 (o en la posición decimal 1728). En 1979, el musical de rock Hair cerró en Broadway en la ciudad de Nueva York después de 1729 funciones. Palíndromo en bases 12, 32, 36.
1730 = 3 × 24 ² + 2 = número de puntos en la superficie de una pirámide cuadrada de lado 24 ^{[ 242 ]}
1732 = $\sum _{k=0}^{5}{\binom {5}{k}}^{k}$ ^{[ 243 ]}
1733 = Sophie Germain primo , palíndromo en bases 3, 18, 19.
1736 = suma de la función totiente para los primeros 75 enteros, número de puntos de superficie en un cubo con longitud de arista 18 ^{[ 10 ]}
1737 = número de molinillo ^{[ 130 ]}
1740 = número de cuadrados en el diamante azteca de orden 29 ^{[ 202 ]}
1741 = superprimo , número cuadrado centrado ^{[ 8 ]}
1742 = número de regiones en las que se divide el plano mediante 30 elipses ^{[ 89 ]}
1743 = índice de Wiener del grafo del molino de viento D(3,21) ^{[ 59 ]}
1745 = 5- Número de Knödel ^{[ 64 ]}
1746 = número de grafos de distancia unitaria en 8 nodos ^{[ 244 ]}
1747 = primo equilibrado ^{[ 38 ]}
1748 = número de particiones de 55 en partes distintas en las que el número de partes divide a 55 ^{[ 245 ]}
1749 = número de particiones enteras de 33 sin que ninguna parte divida a todas las demás ^{[ 246 ]}
1750 = hipotenusa en tres triángulos pitagóricos diferentes ^{[ 165 ]}
1751 = hexágono recortado ^{[ 247 ]}
1753 = primo equilibrado ^{[ 38 ]}
1755 = número de particiones enteras de 50 cuyas diferencias aumentadas son distintas ^{[ 248 ]}
1756 = número pentagonal centrado ^{[ 21 ]}
1757 = menor número de triángulos de la Espiral de Teodoro para completar 13 revoluciones ^{[ 122 ]}
1758 = $\sum _{k=1}^{46}\sigma (k)$ ^{[ 85 ]}
1759 = prima de Polignac ^{[ 177 ]}
1762 = número de secuencias binarias de longitud 12 y número de rizado 2 ^{[ 249 ]}
1763 = número de aristas en la unión de dos grafos cíclicos, ambos de orden 41 ^{[ 100 ]}
1765 = número de pilas o particiones planas de 15 ^{[ 250 ]}
1769 = número máximo de piezas que se pueden obtener cortando un anillo con 58 cortes ^{[ 49 ]}
1770 = 59.º número triangular , ^{[ 15 ]} número hexagonal, ^{[ 14 ]} Diecisiete Setenta , ciudad en Australia
1771 = número tetraédrico ^{[ 60 ]}
1772 = número heptagonal centrado, ^{[ 86 ]} suma de la función totiente para los primeros 76 enteros
1774 = número de árboles de identidad enraizados con 15 nodos y 5 hojas ^{[ 251 ]}
1776 = 24.º número de estrella cuadrada . ^{[ 252 ]} El número de piezas que se podían ver en un teseracto de Rubik de 7 × 7 × 7 × 7.
1780 = número de caminos reticulares desde (0, 0) hasta (7, 7) usando E (1, 0) y N (0, 1) como pasos que cruzan horizontalmente la diagonal y = x con un número par de veces ^{[ 253 ]}
1781 = los primeros 1781 dígitos de e forman un número primo ^{[ 254 ]}
1782 = número heptagonal ^{[ 128 ]}
1783 = prima de Polignac ^{[ 177 ]}
1784 = número de subconjuntos de {1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12} tales que cada par de elementos distintos tiene un cociente diferente ^{[ 255 ]}
1785 = número piramidal cuadrado, ^{[ 112 ]} número de cerilla triangular ^{[ 228 ]}
1786 = número triangular centrado ^{[ 56 ]}
1787 = superprimo , suma de once primos consecutivos (137 + 139 + 149 + 151 + 157 + 163 + 167 + 173 + 179 + 181 + 191)
1788 = Transformada de Euler de -1, -2, ..., -34 ^{[ 256 ]}
1790 = número de particiones de 50 en partes relativamente primas por pares ^{[ 218 ]}
1791 = el mayor número natural que no puede expresarse como suma de como máximo cuatro números hexagonales .
1792 = Número de Granville
1793 = número de puntos de la red dentro de un círculo de radio 24 ^{[ 51 ]}
1794 = número nonagonal, ^{[ 98 ]} número de particiones de 33 que no contienen 1 como parte ^{[ 17 ]}
1795 = número de heptágonos con perímetro 38 ^{[ 257 ]}
1799 = 2 × 30 ² − 1 = un cuadrado gemelo ^{[ 258 ]}

1800 a 1899

1801 = primo cubano , suma de cinco y nueve primos consecutivos (349 + 353 + 359 + 367 + 373 y 179 + 181 + 191 + 193 + 197 + 199 + 211 + 223 + 227) ^{[ 215 ]}
1803 = número de decahexos que recubren el plano isoédricamente pero no por traslación ni por rotación de 180 grados (criterio de Conway) ^{[ 259 ]}
1806 = número prónico, ^{[ 22 ]} producto de los primeros cuatro términos de la secuencia de Sylvester , número pseudoperfecto primario , ^{[ 260 ]} único número para el cual n es igual al denominador del n -ésimo número de Bernoulli , ^{[ 261 ]} número de Schröder ^{[ 262 ]}
1807 = quinto término de la secuencia de Sylvester ^{[ 263 ]}
1808 = número máximo de regiones en las que se divide el plano dibujando 43 círculos ^{[ 135 ]}
1809 = suma de los primeros 17 superprimos ^{[ 264 ]}
1810 = $\sum _{k=0}^{4}{\binom {4}{k}}^{4}$ ^{[ 265 ]}
1811 = Sophie Germain primo
1813 = número de poliominós con 26 celdas, simétricos respecto a dos ejes ortogonales ^{[ 266 ]}
1814 = 1 + 6 + 36 + 216 + 1296 + 216 + 36 + 6 + 1 = suma de la cuarta fila del triángulo de potencias de seis ^{[ 267 ]}
1817 = número total de partes primas en todas las particiones de 20 ^{[ 268 ]}
1820 = número pentagonal, ^{[ 31 ]} número pentatópico, ^{[ 139 ]} número de composiciones de 13 cuyas longitudes de ejecución son débilmente crecientes o débilmente decrecientes ^{[ 269 ]}
1821 = miembro de la secuencia Mian–Chowla ^{[ 9 ]}
1822 = número de particiones enteras de 43 cuyas partes distintas están conectadas ^{[ 270 ]}
1823 = superprimo , primo seguro ^{[ 11 ]}
1824 = 43² ^- 5² ^, la única forma de expresar 1824 como una diferencia de cuadrados primos ^{[ 226 ]}
1825 = número octogonal ^{[ 75 ]}
1826 = número piramidal decagonal ^{[ 271 ]}
1827 = número de vampiro ^{[ 119 ]}
1828 = número meándrico , número meándrico abierto , aparece dos veces en los primeros 10 dígitos decimales de e
1829 = número compuesto de Polignac ^{[ 93 ]}
1830 = 60º número triangular ^{[ 15 ]}
1831 = primo más pequeño con una diferencia de exactamente 16 hasta el siguiente primo (1847) ^{[ 272 ]}
1832 = suma de la función totiente para los primeros 77 enteros
1833 = número de átomos en un decaedro con 13 capas ^{[ 273 ]}
1834 = número octaédrico, ^{[ 70 ]} suma de los cubos de los primeros cinco primos
1835 = valor absoluto del numerador de $D_{6}^{(5)}$ ^{[ 274 ]}
1836 = factor por el cual un protón es más masivo que un electrón
1837 = número de estrella ^{[ 36 ]}
1841 = solución al problema de los sellos postales con 3 denominaciones y 29 sellos, ^{[ 275 ]}
1842 = número de árboles enraizados sin etiquetar con 11 nodos ^{[ 276 ]}
1843 = k tal que phi(k) es un cubo perfecto, ^{[ 277 ]} cero de la función de Mertens
1844 = 3 ⁷ - 7 ³ , ^{[ 278 ]} cero de la función de Mertens
1845 = número de particiones de 25 que contienen al menos un número primo, ^{[ 279 ]} cero de la función de Mertens
1847 = superprimo
1848 = número de aristas en la unión de dos grafos cíclicos, ambos de orden 42 ^{[ 100 ]}
1849 = 43 ² , palíndromo en base 6 (= 12321 ₆ ), número octogonal centrado ^{[ 103 ]}
1850 = Número de particiones de 59 en partes primas.
1851 = suma de los primeros 32 números primos
1853 = suma de raíces primitivas del primo 27, ^{[ 280 ]} cero de la función de Mertens
1854 = número de permutaciones de 7 elementos sin puntos fijos, ^{[ 281 ]} función de Mertens cero
1855 = número de encuentros: número de permutaciones de [7] con exactamente un punto fijo ^{[ 282 ]}
1856 = suma de la función totiente para los primeros 78 enteros
1857 = cero de la función de Mertens, número de molinete ^{[ 130 ]}
1858 = número de alcanos de 14 carbonos C ₁₄ H ₃₀ ignorando los estereoisómeros ^{[ 283 ]}
1859 = número compuesto de Polignac ^{[ 93 ]}
1860 = número de cuadrados en el diamante azteca de orden 30 ^{[ 284 ]}
1861 = número cuadrado centrado, ^{[ 8 ]} cero de la función de Mertens
1862 = forma un par Ruth-Aaron con 1863 según la segunda definición.
1863 = forma un par Ruth-Aaron con 1862 según la segunda definición.
1865 = 12345 ₆ : Metódromo senario más grande (número con dígitos en estricto orden ascendente en base 6) ^{[ 285 ]}
1866 = número de particiones planas de 16 con como máximo dos filas ^{[ 286 ]}
1867 = número primo de Polignac ^{[ 177 ]}
1868 = número más pequeño de complejidad 21: número más pequeño que requiere 21 1 para construir usando +, * y ^ ^{[ 155 ]}
1870 = número decagonal ^{[ 143 ]}
1871 = el primer primo de los 2 pares de primos gemelos consecutivos: (1871, 1873) y (1877, 1879) ^{[ 287 ]}
1872 = primer índice de Zagreb del grafo completo K ₁₃^{[ 156 ]}
1873 = número de vacas y terneros de Narayana después de 21 años ^{[ 124 ]}
1880 = el décimo elemento de la autoconvolución de los números de Lucas ^{[ 288 ]}
1881 = número de prisma tricapado ^{[ 289 ]}
1882 = número de funciones booleanas linealmente separables en 4 variables ^[²⁹⁰^]
1883 = número de clases de conjugación en el grupo alternante A ₂₈^{[ 171 ]}
1886 = número de particiones de 6 ⁴ en cuartas potencias ^{[ 291 ]}
1887 = número de aristas en el triángulo hexagonal T(34) ^{[ 53 ]}
1889 = Número primo de Sophie Germain, número altamente cototiente ^{[ 20 ]}
1891 = 61.º número triangular , ^{[ 15 ]} suma de 5 primos consecutivos ( $367 + 373 + 379 + 383 + 389$ ) número hexagonal, ^{[ 14 ]} número pentagonal centrado, ^{[ 21 ]} número triangular centrado ^{[ 56 ]}
1892 = número pronético ^{[ 22 ]}
1894 = número máximo de regiones en las que se divide el plano dibujando 44 círculos ^{[ 135 ]}
1896 = miembro de la secuencia Mian-Chowla ^{[ 9 ]}
1897 = miembro de la secuencia de Padovan, ^{[ 33 ]} número de grafos sin triángulos en 9 vértices ^{[ 292 ]}

1900 a 1999

1900 = número de primos <= 2 ¹⁴^{[ 12 ]}
1901 = Número primo de Sophie Germain, número decagonal centrado
1902 = número de particiones planas simétricas de 27 ^{[ 293 ]}
1903 = número catalán generalizado ^{[ 294 ]}
1905 = Pseudoprimo de Fermat ^{[ 295 ]}
1907 = primo seguro, ^{[ 11 ]} primo equilibrado ^{[ 38 ]}
1908 = número perfecto central ^{[ 163 ]}
1909 = número hiperperfecto ^{[ 296 ]}
1910 = número de composiciones de 13 que tienen exactamente un punto fijo ^{[ 297 ]}
1911 = número piramidal heptagonal ^{[ 168 ]}
1912 = tamaño de la sexta subida máxima después de una ciega en el póker pot-limit ^{[ 298 ]}
1913 = superprimo , primo de Honaker ^{[ 153 ]}
1915 = número de semigrupos no isomorfos de orden 5 ^{[ 299 ]}
1917 = número de particiones de 51 en partes relativamente primas por pares ^{[ 218 ]}
1918 = número heptagonal ^{[ 128 ]}
1919 = número más pequeño con recíproco de longitud de período 36 en base 10 ^{[ 300 ]}
1920 = suma de los números no triangulares entre los números triangulares sucesivos 120 y 136 ,
1923 = 2 × 31 ² + 1 = número de determinantes diferentes de 2 X 2 con entradas enteras de 0 a 31 ^{[ 117 ]}
1925 = número de maneras de escribir 24 como un producto desordenado de sumas desordenadas ^{[ 43 ]}
1926 = número pentagonal ^{[ 31 ]}
1928 = número de valores distintos tomados por 2^2^...^2 (con 13 2 y paréntesis insertados de todas las formas posibles) ^{[ 301 ]}
1929 = cero de la función de Mertens, número de particiones enteras de 42 cuyas partes distintas están conectadas ^{[ 270 ]}
1930 = número de pares de enteros consecutivos x, x+1 tales que todos los factores primos de x y x+1 son como máximo 53 ^{[ 166 ]}
1931 = Sophie Germain en su mejor momento
1932 = número de particiones de 40 en partes de potencias primas ^{[ 302 ]}
1933 = número heptagonal centrado, ^{[ 86 ]} primo de Honaker ^{[ 153 ]}
1934 = suma de la función totiente para los primeros 79 enteros
1935 = número de aristas en la unión de dos grafos cíclicos, ambos de orden 43 ^{[ 100 ]}
1937 = número de n-ominós quirales en el espacio de 12, una celda etiquetada ^{[ 303 ]}
1938 = cero de la función de Mertens, número de puntos en la superficie de un octaedro con longitud de arista 22 ^{[ 73 ]}
1939 = número de 7 Knödel ^{[ 61 ]}
1940 = el número de Mahon: T(8, 9) ^{[ 107 ]}
1941 = número máximo de regiones obtenidas al unir 16 puntos alrededor de un círculo mediante líneas rectas ^{[ 304 ]}
1942 = número k para el cual 10k + 1, 10k + 3, 10k + 7, 10k + 9 y 10k + 13 son primos ^{[ 305 ]}
1943 = número más grande que no es la suma de números tetradecagonales distintos ^{[ 306 ]}
1944 = número 3-suave (2 ³ ×3 ⁵ ), número de Aquiles ^{[ 184 ]}
1945 = número de particiones de 25 en partes relativamente primas tales que las multiplicidades de las partes también son relativamente primas ^{[ 307 ]}
1947 = k tal que 5·2 ^k + 1 es un factor primo de un número de Fermat 2 ^{2 ^m} + 1 para algún m ^{[ 308 ]}
1948 = número de particiones sólidas estrictas de 20 ^{[ 37 ]}
1949 = primo más pequeño > 44 ² . ^{[ 309 ]}
1950 = $1\cdot 2\cdot 3+4\cdot 5\cdot 6+7\cdot 8\cdot 9+10\cdot 11\cdot 12$ , ^{[ 310 ]} número más grande que no es la suma de números pentadecagonales distintos ^{[ 306 ]}
1951 = primo cubano ^{[ 215 ]}
1952 = número de portadas de {1, 2, 3, 4} ^{[ 311 ]}
1953 = número de prisma hexagonal, ^{[ 312 ]} 62º número triangular ^{[ 15 ]}
1955 = número de particiones de 25 con al menos una parte distinta ^{[ 183 ]}
1956 = número nonagonal ^{[ 98 ]}
1957 = $\sum _{k=0}^{6}{\frac {6!}{k!}}$ = número total de k-tuplas ordenadas (k=0,1,2,3,4,5,6) de elementos distintos de un conjunto de 6 elementos ^{[ 313 ]}
1958 = número de particiones de 25 ^{[ 118 ]}
1960 = número de partes en todas las particiones de 33 en partes distintas ^{[ 109 ]}
1961 = número de puntos de la red dentro de un círculo de radio 25 ^{[ 51 ]}
1962 = number of edges in the join of the complete graph K₃₆ and the cycle graph C₃₆^[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 ${\frac {n^{37}-1}{n-1}}$ 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 45² and 45⁴,^[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 3¹⁹⁸² - 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 4¹⁹⁹³ - 3¹⁹⁹³ 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 = $\sum _{k=1}^{21}{k\cdot \phi (k)}$ ^[337]
1999 = centered triangular number,^[56] number of regular forms in a myriagram.

Prime numbers

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

References

↑"chiliad". Merriam-Webster.{{cite web}}: CS1 maint: url-status (link)
↑Sloane, N. J. A. (ed.). "SequenceA195163(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.). "SequenceA122189(Heptanacci numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA036063(Increasing gaps among twin primes: size)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA332307(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 2Sloane, N. J. A. (ed.). "SequenceA020473(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 15Sloane, N. J. A. (ed.). "SequenceA005384(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 9Sloane, N. J. A. (ed.). "SequenceA001844(Centered square numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2 3 4 5 6 7 8Sloane, N. J. A. (ed.). "SequenceA005282(Mian-Chowla sequence)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2 3Sloane, N. J. A. (ed.). "SequenceA005897(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 12Sloane, N. J. A. (ed.). "SequenceA005385(Safe primes p: (p-1)/2 is also prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2Sloane, N. J. A. (ed.). "SequenceA007053(Number of primes <= 2^n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA004023(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 9Sloane, N. J. A. (ed.). "SequenceA000384(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 18Sloane, N. J. A. (ed.). "SequenceA000217(Triangular numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA007522(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 3Sloane, N. J. A. (ed.). "SequenceA002865(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.). "SequenceA000025(Coefficients of the 3rd-order mock theta function f(q))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA336130(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 7Sloane, N. J. A. (ed.). "SequenceA100827(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 9Sloane, N. J. A. (ed.). "SequenceA005891(Centered pentagonal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2 3 4 5 6 7 8 9Sloane, N. J. A. (ed.). "SequenceA002378(Oblong (or promic, pronic, or heteromecic) numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA003294(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.). "SequenceA007504(Sum of the first n primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA127337(Numbers that are the sum of 10 consecutive primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA006879(Number of primes with n digits.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA347565(Primes p such that A241014(A000720(p)) is +1 or -1)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2Sloane, N. J. A. (ed.). "SequenceA006567(Emirps (primes whose reversal is a different prime))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA273873(Number of strict trees of weight n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA073592(Euler transform of negative integers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2 3 4 5 6 7 8 9 10Sloane, N. J. A. (ed.). "SequenceA000326(Pentagonal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2Sloane, N. J. A. (ed.). "SequenceA067128(Ramanujan's largely composite numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2 3Sloane, N. J. A. (ed.). "SequenceA000931(Padovan sequence)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA006753(Smith numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA031157(Numbers that are both lucky and prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2 3 4 5Sloane, N. J. A. (ed.). "SequenceA003154(Centered 12-gonal numbers. Also star numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2 3Sloane, N. J. A. (ed.). "SequenceA323657(Number of strict solid partitions of n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2 3 4 5 6 7 8 9Sloane, N. J. A. (ed.). "SequenceA006562(Balanced primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2Sloane, N. J. A. (ed.). "SequenceA007629(Repfigit (REPetitive FIbonacci-like diGIT) numbers (or Keith numbers))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA319560(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.). "SequenceA028916(Friedlander-Iwaniec primes: Primes of form a^2 + b^4)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2 3 4Sloane, N. J. A. (ed.). "SequenceA000009(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 4Sloane, N. J. A. (ed.). "SequenceA318949(Number of ways to write n as an orderless product of orderless sums)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2Sloane, N. J. A. (ed.). "SequenceA006748(Number of diagonally symmetric polyominoes with n cells)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA210000(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.). "SequenceA033995(Number of bipartite graphs with n nodes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2Sloane, N. J. A. (ed.). "SequenceA076980(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.). "SequenceA062801(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 6Sloane, N. J. A. (ed.). "SequenceA000096(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 7Sloane, N. J. A. (ed.). "SequenceA000328". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA001608(Perrin sequence)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2 3Sloane, N. J. A. (ed.). "SequenceA140091(3*n*(n + 3)/2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA005380". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA051026(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 10Sloane, N. J. A. (ed.). "SequenceA005448(Centered triangular numbers: 3n(n-1)/2 + 1)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA080040(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.). "SequenceA264237(Sum of values of vertices at level n of the hyperbolic Pascal pyramid)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2Sloane, N. J. A. (ed.). "SequenceA033991(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 6Sloane, N. J. A. (ed.). "SequenceA208155(7-Knödel numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA006315(Numbers n such that n^32 + 1 is prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA185982(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 5Sloane, N. J. A. (ed.). "SequenceA050993(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 3Sloane, N. J. A. (ed.). "SequenceA005893(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 3Sloane, N. J. A. (ed.). "SequenceA005899(Number of points on surface of octahedron)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2Sloane, N. J. A. (ed.). "SequenceA001845(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 5Sloane, N. J. A. (ed.). "SequenceA000567(Octagonal numbers: n*(3*n-2). Also called star numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA055887(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 2Sloane, N. J. A. (ed.). "SequenceA005449(Second pentagonal numbers: n*(3*n + 1)/2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2Sloane, N. J. A. (ed.). "SequenceA002061(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 6Sloane, N. J. A. (ed.). "SequenceA024916(Sum_1^n sigma(k))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2 3 4 5 6Sloane, N. J. A. (ed.). "SequenceA069099(Centered heptagonal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2Sloane, N. J. A. (ed.). "SequenceA080663(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 2Sloane, N. J. A. (ed.). "SequenceA051890(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.). "SequenceA240574(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 8Sloane, N. J. A. (ed.). "SequenceA098237(Composite de Polignac numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA337070(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.). "SequenceA000070(Sum_{0..n} A000041(k))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2Sloane, N. J. A. (ed.). "SequenceA053767(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 2Sloane, N. J. A. (ed.). "SequenceA006355(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 8Sloane, N. J. A. (ed.). "Sequencen*(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.). "SequenceA303815(Generalized 29-gonal (or icosienneagonal) numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA249911(60-gonal (hexacontagonal) numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑"A004111 - OEIS". oeis.org.
1 2Sloane, N. J. A. (ed.). "SequenceA008302(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 3Sloane, N. J. A. (ed.). "SequenceA015723(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 7Sloane, N. J. A. (ed.). "SequenceA054735(Sums of twin prime pairs)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑"A160160 - OEIS". oeis.org.
1 2 3Sloane, N. J. A. (ed.). "SequenceA000330(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.). "SequenceA126796(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 4Sloane, N. J. A. (ed.). "SequenceA058331(2*n^2 + 1)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2 3Sloane, N. J. A. (ed.). "SequenceA000041(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 3Sloane, N. J. A. (ed.). "SequenceA003238(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 3Sloane, N. J. A. (ed.). "SequenceA072895(Least k for the Theodorus spiral to complete n revolutions)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2Sloane, N. J. A. (ed.). "SequenceA084849(1 + n + 2*n^2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2Sloane, N. J. A. (ed.). "SequenceA000930(Narayana's cows sequence)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA001792((n+2)*2^(n-1))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA216492(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.). "SequenceA007318(Pascal's triangle read by rows)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2 3 4 5 6Sloane, N. J. A. (ed.). "SequenceA000566(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.). "SequenceA006872(Numbers k such that phi(k) equals phi(sigma(k)))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2 3 4 5 6Sloane, N. J. A. (ed.). "SequenceA059993(Pinwheel numbers: 2*n^2 + 6*n + 1)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA000055(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 2Sloane, N. J. A. (ed.). "SequenceA005894(Centered tetrahedral numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2 3 4 5 6 7Sloane, N. J. A. (ed.). "SequenceA014206(n^2 + n + 2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑"A316473 - OEIS". oeis.org.
↑Sloane, N. J. A. (ed.). "SequenceA001610(a(n-1) + a(n-2) + 1)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA000032(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 2Sloane, N. J. A. (ed.). "SequenceA005945(Number of n-step mappings with 4 inputs)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA000111(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.). "SequenceA054552(4*n^2 - 3*n + 1)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA109308(Lesser emirps (primes whose digit reversal is a larger prime))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2Sloane, N. J. A. (ed.). "SequenceA051400(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.). "SequenceA002445(Denominators of Bernoulli numbers B_{2n})". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
12Sloane, N. J. A. (ed.). "SequenceA001359(Lesser of twin primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA001764(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 4Sloane, N. J. A. (ed.). "SequenceA033548(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 3Sloane, N. J. A. (ed.). "SequenceA006832(Discriminants of totally real cubic fields)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2Sloane, N. J. A. (ed.). "SequenceA003037(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 2Sloane, N. J. A. (ed.). "SequenceA011379(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.). "SequenceA028569(n*(n + 9))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA085831(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.). "SequenceA064410(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 4Sloane, N. J. A. (ed.). "SequenceA307958(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 2Sloane, N. J. A. (ed.). "SequenceA084647(Hypotenuses for which there exist exactly 3 distinct integer triangles)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2Sloane, N. J. A. (ed.). "SequenceA002071(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.). "SequenceA071395(Primitive abundant numbers (abundant numbers all of whose proper divisors are deficient numbers))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2Sloane, N. J. A. (ed.). "SequenceA002413(Heptagonal (or 7-gonal) pyramidal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA018000(Powers of cube root of 9 rounded down)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA038147(Number of polyhexes with n cells)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2Sloane, N. J. A. (ed.). "SequenceA000702(number of conjugacy classes in the alternating group A_n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA001970(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.). "SequenceA000084(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.). "SequenceA000615(Threshold functions of exactly n variables)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA000057(Primes dividing all Fibonacci sequences)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA002720(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 4Sloane, N. J. A. (ed.). "SequenceA065381(Primes not of the form p + 2^k)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA140090(n*(3*n + 7)/2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2Sloane, N. J. A. (ed.). "SequenceA008406(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.). "SequenceA000014(Number of series-reduced trees with n nodes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA057660(Sum_{1..n} n/gcd(n,k))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA088319(Ordered hypotenuses of primitive Pythagorean triangles having legs that add up to a square)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2Sloane, N. J. A. (ed.). "SequenceA144300(Number of partitions of n minus number of divisors of n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2Sloane, N. J. A. (ed.). "SequenceA052486(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.). "SequenceA033428(3*n^2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA326123(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.). "SequenceA006327(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 2Sloane, N. J. A. (ed.). "SequenceA064174(Number of partitions of n with nonnegative rank)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA023360(Number of compositions of n into prime parts)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA103473(Number of polyominoes consisting of 7 regular unit n-gons)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA022004(Initial members of prime triples (p, p+2, p+6))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2Sloane, N. J. A. (ed.). "SequenceA018805". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA059845(n*(3*n + 11)/2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA006489(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.). "SequenceA213427(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.). "SequenceA134602(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.). "SequenceA084990(n*(n^2+3*n-1)/3)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA077068(Semiprimes of the form prime + 1)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA115160(Numbers that are not the sum of two triangular numbers and a fourth power)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2Sloane, N. J. A. (ed.). "SequenceA046092(4 times triangular numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA071399(Rounded volume of a regular tetrahedron with edge length n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA001339(Sum_{0..n} (k+1)! binomial(n,k))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA007290(2*binomial(n,3))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA058360(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.). "SequenceA046931(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.). "SequenceA001770(Numbers k such that 5*2^k - 1 is prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA056613(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.). "SequenceA068140(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.). "SequenceA030272(Number of partitions of n^3 into distinct cubes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2Sloane, N. J. A. (ed.). "SequenceA038499(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.). "SequenceA018818(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.). "SequenceA050710(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.). "SequenceA046376(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 3Sloane, N. J. A. (ed.). "SequenceA051424(Number of partitions of n into pairwise relatively prime parts)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA059802(Numbers k such that 5^k - 4^k is prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA082982(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.). "SequenceA061068(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.). "SequenceA057562(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.). "SequenceA000230(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.). "SequenceA261983(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.). "SequenceA053781(Numbers k that divide the sum of the first k composite numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2Sloane, N. J. A. (ed.). "SequenceA090781(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.). "SequenceA098859(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 2Sloane, N. J. A. (ed.). "SequenceA045943(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.). "SequenceA286518(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.). "SequenceA004041(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.). "SequenceA023359(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.). "SequenceA000787(Strobogrammatic numbers: the same upside down)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA001157(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.). "SequenceA020989((5*4^n - 2)/3)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA301700(Number of aperiodic rooted trees with n nodes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA056045("Sum_{d divides n}(binomial(n,d))")". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2Sloane, N. J. A. (ed.). "SequenceA028387(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.). "SequenceA161757((prime(n))^2 - (nonprime(n))^2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA078374(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.). "SequenceA005918(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.). "SequenceA167008(Sum_{0..n} C(n,k)^k)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA350507(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.). "SequenceA102627(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.). "SequenceA338470(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.). "SequenceA144391(3*n^2 + n - 1)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA325349(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.). "SequenceA216955(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.). "SequenceA001523(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.). "SequenceA055327(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.). "SequenceA045944(Rhombic matchstick numbers: n*(3*n+2))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA005317((2^n + C(2*n,n))/2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA064118(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.). "SequenceA325860(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.). "SequenceA073592(Euler transform of negative integers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA288253(Number of heptagons that can be formed with perimeter n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA056220(2*n^2 - 1)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA075213(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(B_n) = n has only one solution'
↑Sloane, N. J. A. (ed.). "SequenceA006318(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.). "SequenceA083186(Sum of first n primes whose indices are primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA005260(Sum_{0..n} binomial(n,k)^4)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA056877(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.). "SequenceA061801((7*6^n - 2)/5)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA037032(Total number of prime parts in all partitions of n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA332835(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 2Sloane, N. J. A. (ed.). "SequenceA304716(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.). "SequenceA007585(10-gonal (or decagonal) pyramidal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA000230(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.). "SequenceA004068(Number of atoms in a decahedron with n shells)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA001905(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.). "SequenceA001208(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.). "SequenceA000081(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.). "SequenceA039771(Numbers k such that phi(k) is a perfect cube)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA024026(3^n - n^3)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA235945(Number of partitions of n containing at least one prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA088144(Sum of primitive roots of n-th prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA000166(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.). "SequenceA000240(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.). "SequenceA000602(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.). "SequenceA023811(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.). "SequenceA000990(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.). "SequenceA007530(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.). "SequenceA004799(Self convolution of Lucas numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA005920(Tricapped prism numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA000609(Number of threshold functions of n or fewer variables)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA259793(Number of partitions of n^4 into fourth powers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA006785(Number of triangle-free graphs on n vertices)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA005987(Number of symmetric plane partitions of n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA023431(Generalized Catalan Numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA001567(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.). "SequenceA240736(Number of compositions of n having exactly one fixed point)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA007070(4*a(n-1) - 2*a(n-2))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA027851(Number of nonisomorphic semigroups of order n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA003060(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.). "SequenceA002845(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.). "SequenceA023894(Number of partitions of n into prime power parts)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA045648(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.). "SequenceA000127(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.). "SequenceA178084(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 2Sloane, N. J. A. (ed.). "SequenceA007419(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.). "SequenceA100953(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.). "SequenceA226366(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.). "SequenceA007491(Smallest prime > n^2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA319014(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.). "SequenceA055621(Number of covers of an unlabeled n-set)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA005915(Hexagonal prism numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA000522(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.). "SequenceA005449(Second pentagonal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA002982(Numbers n such that n! - 1 is prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA030238(Backwards shallow diagonal sums of Catalan triangle A009766)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA006128(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.). "SequenceA089046(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.). "SequenceA065900(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.). "SequenceA052542(2*a(n-1) + a(n-2))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA217076(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.). "SequenceA302545(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.). "SequenceA343971(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.). "SequenceA034090(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.). "SequenceA000124(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.). "SequenceA058037(Numbers k such that 3^k - k is prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA064591(Nonunitary perfect numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA007504(Sum of the first n primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA053767(Sum of the first n composite numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA096711(Number of balanced primes less than 10^n.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑ Sloane, N. J. A. (ed.). "Secuencia A187220 (secuencia de alas de gaviota)" . La enciclopedia en línea de secuencias enteras . Fundación OEIS.
↑ Sloane, N. J. A. (ed.). "Secuencia A046351 (Números compuestos palíndromos con solo factores primos palíndromos)" . La enciclopedia en línea de secuencias de enteros . Fundación OEIS.
↑ Sloane, N. J. A. (ed.). "Secuencia A000612 (Número de clases de P-equivalencia de funciones de conmutación de n o menos variables, dividido por 2)" . La enciclopedia en línea de secuencias enteras . Fundación OEIS.
↑ (secuencia A059801 en el OEIS )
↑ Sloane, N. J. A. (ed.). "Secuencia A263341 (Triángulo leído por filas: T(n,k) es el número de grafos sin etiquetar en n vértices con número de independencia k)" . La enciclopedia en línea de secuencias enteras . Fundación OEIS.
↑ Sloane, N. J. A. (ed.). "Secuencia A011755 (Suma_{1..n} k*phi(k))" . La enciclopedia en línea de secuencias enteras . Fundación OEIS.
↑ Sloane, N. J. A. (ed.). "Secuencia A038823 (Número de primos entre n*1000 y (n+1)*1000)" . La enciclopedia en línea de secuencias de enteros . Fundación OEIS.
↑ Stein, William A. (10 de febrero de 2017). "La hipótesis de Riemann y la conjetura de Birch y Swinnerton-Dyer" . wstein.org . Consultado el 6 de febrero de 2021 .

[1] "chiliad". Merriam-Webster.{{cite web}}: CS1 maint: url-status (link)

[Chilia-2] Sloane, N. J. A. (ed.). "SequenceA195163(1000-gonal numbers: a(n) equal to n*(499*n - 498))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[Heptanacci_numbers-3] Sloane, N. J. A. (ed.). "SequenceA122189(Heptanacci numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[4] Sloane, N. J. A. (ed.). "SequenceA036063(Increasing gaps among twin primes: size)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[5] Sloane, N. J. A. (ed.). "SequenceA332307(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.

[A020473-6] 1 2Sloane, N. J. A. (ed.). "SequenceA020473(Egyptian fractions: number of partitions of 1 into reciprocals of positive integers <= n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[Sophie_Germain-7] 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15Sloane, N. J. A. (ed.). "SequenceA005384(Sophie Germain primes p: 2p+1 is also prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[Centered_square_numbers-8] 1 2 3 4 5 6 7 8 9Sloane, N. J. A. (ed.). "SequenceA001844(Centered square numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[Mian-Chowla-9] 1 2 3 4 5 6 7 8Sloane, N. J. A. (ed.). "SequenceA005282(Mian-Chowla sequence)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[A005897-10] 1 2 3Sloane, N. J. A. (ed.). "SequenceA005897(6*n^2 + 2 for n > 0)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[Safe_primes-11] 1 2 3 4 5 6 7 8 9 10 11 12Sloane, N. J. A. (ed.). "SequenceA005385(Safe primes p: (p-1)/2 is also prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[auto3-12] 1 2Sloane, N. J. A. (ed.). "SequenceA007053(Number of primes <= 2^n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[13] Sloane, N. J. A. (ed.). "SequenceA004023(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.

[Hexagonal_number-14] 1 2 3 4 5 6 7 8 9Sloane, N. J. A. (ed.). "SequenceA000384(Hexagonal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[Triangular_number-15] 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18Sloane, N. J. A. (ed.). "SequenceA000217(Triangular numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[16] Sloane, N. J. A. (ed.). "SequenceA007522(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.

[auto8-17] 1 2 3Sloane, N. J. A. (ed.). "SequenceA002865(Number of partitions of n that do not contain 1 as a part)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[18] Sloane, N. J. A. (ed.). "SequenceA000025(Coefficients of the 3rd-order mock theta function f(q))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[19] Sloane, N. J. A. (ed.). "SequenceA336130(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.

[highly_cototient-20] 1 2 3 4 5 6 7Sloane, N. J. A. (ed.). "SequenceA100827(Highly cototient numbers: records for a(n) in A063741)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[Centered_pentagonal-21] 1 2 3 4 5 6 7 8 9Sloane, N. J. A. (ed.). "SequenceA005891(Centered pentagonal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[pronic_number-22] 1 2 3 4 5 6 7 8 9Sloane, N. J. A. (ed.). "SequenceA002378(Oblong (or promic, pronic, or heteromecic) numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[23] Sloane, N. J. A. (ed.). "SequenceA003294(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.

[24] Sloane, N. J. A. (ed.). "SequenceA007504(Sum of the first n primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[auto102-25] Sloane, N. J. A. (ed.). "SequenceA127337(Numbers that are the sum of 10 consecutive primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[26] Sloane, N. J. A. (ed.). "SequenceA006879(Number of primes with n digits.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[27] Sloane, N. J. A. (ed.). "SequenceA347565(Primes p such that A241014(A000720(p)) is +1 or -1)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[auto4-28] 1 2Sloane, N. J. A. (ed.). "SequenceA006567(Emirps (primes whose reversal is a different prime))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[29] Sloane, N. J. A. (ed.). "SequenceA273873(Number of strict trees of weight n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[30] Sloane, N. J. A. (ed.). "SequenceA073592(Euler transform of negative integers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[Pentagonal_number-31] 1 2 3 4 5 6 7 8 9 10Sloane, N. J. A. (ed.). "SequenceA000326(Pentagonal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[OEIS-A067128-32] 1 2Sloane, N. J. A. (ed.). "SequenceA067128(Ramanujan's largely composite numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[Padovan_sequence-33] 1 2 3Sloane, N. J. A. (ed.). "SequenceA000931(Padovan sequence)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[34] Sloane, N. J. A. (ed.). "SequenceA006753(Smith numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[35] Sloane, N. J. A. (ed.). "SequenceA031157(Numbers that are both lucky and prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[Centered_12-gonal_numbers-36] 1 2 3 4 5Sloane, N. J. A. (ed.). "SequenceA003154(Centered 12-gonal numbers. Also star numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[auto43-37] 1 2 3Sloane, N. J. A. (ed.). "SequenceA323657(Number of strict solid partitions of n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[Balanced_prime-38] 1 2 3 4 5 6 7 8 9Sloane, N. J. A. (ed.). "SequenceA006562(Balanced primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[Keith_number-39] 1 2Sloane, N. J. A. (ed.). "SequenceA007629(Repfigit (REPetitive FIbonacci-like diGIT) numbers (or Keith numbers))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[40] Sloane, N. J. A. (ed.). "SequenceA319560(Number of non-isomorphic strict T_0 multiset partitions of weight n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[auto12-41] Sloane, N. J. A. (ed.). "SequenceA028916(Friedlander-Iwaniec primes: Primes of form a^2 + b^4)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[auto20-42] 1 2 3 4Sloane, N. J. A. (ed.). "SequenceA000009(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.

[auto79-43] 1 2 3 4Sloane, N. J. A. (ed.). "SequenceA318949(Number of ways to write n as an orderless product of orderless sums)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[auto23-44] 1 2Sloane, N. J. A. (ed.). "SequenceA006748(Number of diagonally symmetric polyominoes with n cells)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[auto54-45] Sloane, N. J. A. (ed.). "SequenceA210000(Number of unimodular 2 X 2 matrices having all terms in {0,1,...,n})". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[46] Sloane, N. J. A. (ed.). "SequenceA033995(Number of bipartite graphs with n nodes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[A076980-47] 1 2Sloane, N. J. A. (ed.). "SequenceA076980(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.

[48] Sloane, N. J. A. (ed.). "SequenceA062801(Number of 2 X 2 non-singular integer matrices with entries from {0,...,n})". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[auto73-49] 1 2 3 4 5 6Sloane, N. J. A. (ed.). "SequenceA000096(n*(n+3)/2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[50] 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.

[auto22-51] 1 2 3 4 5 6 7Sloane, N. J. A. (ed.). "SequenceA000328". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[auto25-52] Sloane, N. J. A. (ed.). "SequenceA001608(Perrin sequence)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[auto60-53] 1 2 3Sloane, N. J. A. (ed.). "SequenceA140091(3*n*(n + 3)/2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[54] Sloane, N. J. A. (ed.). "SequenceA005380". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[55] Sloane, N. J. A. (ed.). "SequenceA051026(Number of primitive subsequences of 1, 2, ..., n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[auto52-56] 1 2 3 4 5 6 7 8 9 10Sloane, N. J. A. (ed.). "SequenceA005448(Centered triangular numbers: 3n(n-1)/2 + 1)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[57] Sloane, N. J. A. (ed.). "SequenceA080040(2*a(n-1) + 2*a(n-2) for n > 1)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[58] Sloane, N. J. A. (ed.). "SequenceA264237(Sum of values of vertices at level n of the hyperbolic Pascal pyramid)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[auto90-59] 1 2Sloane, N. J. A. (ed.). "SequenceA033991(n*(4*n-1))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[Tetrahedral_nu-60] 1 2 3 4"Sloane's A000292 : Tetrahedral numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.

[auto21-61] 1 2 3 4 5 6Sloane, N. J. A. (ed.). "SequenceA208155(7-Knödel numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[auto51-62] Sloane, N. J. A. (ed.). "SequenceA006315(Numbers n such that n^32 + 1 is prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[63] Sloane, N. J. A. (ed.). "SequenceA185982(Triangle read by rows: number of set partitions of n elements with k connectors)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[auto14-64] 1 2 3 4 5Sloane, N. J. A. (ed.). "SequenceA050993(5-Knödel numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[65] "1150 (number)". The encyclopedia of numbers.

[Prime_gap-66] 1 2"Sloane's A000101 : Increasing gaps between primes (upper end)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 10 July 2016.

[highly_totient-67] 1 2"Sloane's A097942 : Highly totient numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.

[Proth_prime-68] 1 2 3 4"Sloane's A080076 : Proth primes". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.

[auto59-69] 1 2 3Sloane, N. J. A. (ed.). "SequenceA005893(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.

[Octahedral_number-70] 1 2 3"Sloane's A005900 : Octahedral numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.

[71] "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.

[72] "1157 (number)". The encyclopedia of numbers.

[auto61-73] 1 2 3Sloane, N. J. A. (ed.). "SequenceA005899(Number of points on surface of octahedron)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[auto7-74] 1 2Sloane, N. J. A. (ed.). "SequenceA001845(Centered octahedral numbers (crystal ball sequence for cubic lattice))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2 June 2022.

[auto17-75] 1 2 3 4 5Sloane, N. J. A. (ed.). "SequenceA000567(Octagonal numbers: n*(3*n-2). Also called star numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[76] Sloane, N. J. A. (ed.). "SequenceA055887(Number of ordered partitions of partitions)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[77] "A000256 - OEIS". oeis.org.

[78] "1179 (number)". The encyclopedia of numbers.

[79] "A000031 - OEIS". oeis.org.

[80] Higgins, Peter (2008). Number Story: From Counting to Cryptography. New York: Copernicus. p. 61. ISBN 978-1-84800-000-1.

[Stern_prime-81] 1 2"Sloane's A042978 : Stern primes". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.

[auto45-82] 1 2Sloane, N. J. A. (ed.). "SequenceA005449(Second pentagonal numbers: n*(3*n + 1)/2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[auto77-83] 1 2Sloane, N. J. A. (ed.). "SequenceA002061(Central polygonal numbers: n^2 - n + 1)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[84] "A175654 - OEIS". oeis.org.

[auto38-85] 1 2 3 4 5 6Sloane, N. J. A. (ed.). "SequenceA024916(Sum_1^n sigma(k))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[centered_heptagonal_number-86] 1 2 3 4 5 6Sloane, N. J. A. (ed.). "SequenceA069099(Centered heptagonal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[auto13-87] 1 2Sloane, N. J. A. (ed.). "SequenceA080663(3*n^2 - 1)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[88] Meehan, Eileen R., Why TV is not our fault: television programming, viewers, and who's really in control Lanham, MD: Rowman & Littlefield, 2005

[auto91-89] 1 2Sloane, N. J. A. (ed.). "SequenceA051890(2*(n^2 - n + 1))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[90] "A265070 - OEIS". oeis.org.

[91] "1204 (number)". The encyclopedia of numbers.

[auto72-92] Sloane, N. J. A. (ed.). "SequenceA240574(Number of partitions of n such that the number of odd parts is a part)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[auto53-93] 1 2 3 4 5 6 7 8Sloane, N. J. A. (ed.). "SequenceA098237(Composite de Polignac numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[94] Sloane, N. J. A. (ed.). "SequenceA337070(Number of strict chains of divisors starting with the superprimorial A006939(n))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[95] Higgins, ibid.

[96] Sloane, N. J. A. (ed.). "SequenceA000070(Sum_{0..n} A000041(k))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[auto94-97] 1 2Sloane, N. J. A. (ed.). "SequenceA053767(Sum of first n composite numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[Nonagonal_number-98] 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.

[auto50-99] 1 2Sloane, N. J. A. (ed.). "SequenceA006355(Number of binary vectors of length n containing no singletons)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[auto89-100] 1 2 3 4 5 6 7 8Sloane, N. J. A. (ed.). "Sequencen*(n+2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[101] "Sloane's A001110 : Square triangular numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.

[102] "A046177 - OEIS". oeis.org. Retrieved 18 December 2024.

[Centered_octagonal_number-103] 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.

[104] Sloane, N. J. A. (ed.). "SequenceA303815(Generalized 29-gonal (or icosienneagonal) numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[105] Sloane, N. J. A. (ed.). "SequenceA249911(60-gonal (hexacontagonal) numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[106] "A004111 - OEIS". oeis.org.

[A008302-107] 1 2Sloane, N. J. A. (ed.). "SequenceA008302(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.

[108] "A006154 - OEIS". oeis.org.

[auto46-109] 1 2 3Sloane, N. J. A. (ed.). "SequenceA015723(Number of parts in all partitions of n into distinct parts)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[auto48-110] 1 2 3 4 5 6 7Sloane, N. J. A. (ed.). "SequenceA054735(Sums of twin prime pairs)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[111] "A160160 - OEIS". oeis.org.

[Square_pyramidal_numbers-112] 1 2 3Sloane, N. J. A. (ed.). "SequenceA000330(Square pyramidal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[113] "Sloane's A005898 : Centered cube numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.

[114] Sloane, N. J. A. (ed.). "SequenceA126796(Number of complete partitions of n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[115] s.org/A305843

[116] "Sloane's A033819 : Trimorphic numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.

[auto32-117] 1 2 3 4Sloane, N. J. A. (ed.). "SequenceA058331(2*n^2 + 1)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[auto35-118] 1 2 3Sloane, N. J. A. (ed.). "SequenceA000041(a(n) is the number of partitions of n (the partition numbers))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[Vampire_number-119] 1 2 3 4 5"Sloane's A014575 : Vampire numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.

[Highly_composite-120] 1 2"Sloane's A002182 : Highly composite numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.

[auto28-121] 1 2 3Sloane, N. J. A. (ed.). "SequenceA003238(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.

[auto85-122] 1 2 3Sloane, N. J. A. (ed.). "SequenceA072895(Least k for the Theodorus spiral to complete n revolutions)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[auto34-123] 1 2Sloane, N. J. A. (ed.). "SequenceA084849(1 + n + 2*n^2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[auto98-124] 1 2Sloane, N. J. A. (ed.). "SequenceA000930(Narayana's cows sequence)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[125] Sloane, N. J. A. (ed.). "SequenceA001792((n+2)*2^(n-1))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[126] Sloane, N. J. A. (ed.). "SequenceA216492(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.

[127] Sloane, N. J. A. (ed.). "SequenceA007318(Pascal's triangle read by rows)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[heptagonal_number-128] 1 2 3 4 5 6Sloane, N. J. A. (ed.). "SequenceA000566(Heptagonal numbers (or 7-gonal numbers): n*(5*n-3)/2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[129] Sloane, N. J. A. (ed.). "SequenceA006872(Numbers k such that phi(k) equals phi(sigma(k)))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[Pinwheel-130] 1 2 3 4 5 6Sloane, N. J. A. (ed.). "SequenceA059993(Pinwheel numbers: 2*n^2 + 6*n + 1)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[131] Sloane, N. J. A. (ed.). "SequenceA000055(Number of trees with n unlabeled nodes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[132] "A061256 - OEIS". oeis.org.

[Markov_number-133] 1 2"Sloane's A002559 : Markoff (or Markov) numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.

[auto42-134] 1 2Sloane, N. J. A. (ed.). "SequenceA005894(Centered tetrahedral numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[auto27-135] 1 2 3 4 5 6 7Sloane, N. J. A. (ed.). "SequenceA014206(n^2 + n + 2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[136] "A316473 - OEIS". oeis.org.

[137] Sloane, N. J. A. (ed.). "SequenceA001610(a(n-1) + a(n-2) + 1)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[138] Sloane, N. J. A. (ed.). "SequenceA000032(Lucas numbers: L(n-1) + L(n-2))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[Pentatope_number-139] 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.

[auto95-140] 1 2Sloane, N. J. A. (ed.). "SequenceA005945(Number of n-step mappings with 4 inputs)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[141] Sloane, N. J. A. (ed.). "SequenceA000111(Euler or up/down numbers: e.g.f. sec(x) + tan(x))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[142] "Sloane's A001567 : Fermat pseudoprimes to base 2". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.

[Decagonal-143] 1 2 3"Sloane's A001107 : 10-gonal (or decagonal) numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.

[144] "Sloane's A050217 : Super-Poulet numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.

[145] Sloane, N. J. A. (ed.). "SequenceA054552(4*n^2 - 3*n + 1)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[146] Sloane, N. J. A. (ed.). "SequenceA109308(Lesser emirps (primes whose digit reversal is a larger prime))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[ReferenceC-147] 1 2Sloane, N. J. A. (ed.). "SequenceA051400(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.

[148] "Sloane's A000682 : Semimeanders". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.

[149] Sloane, N. J. A. (ed.). "SequenceA002445(Denominators of Bernoulli numbers B_{2n})". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[:0-150] 12Sloane, N. J. A. (ed.). "SequenceA001359(Lesser of twin primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[151] Sloane, N. J. A. (ed.). "SequenceA001764(binomial(3*n,n)/(2*n+1) (enumerates ternary trees and also noncrossing trees))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[152] "Sloane's A000108 : Catalan numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.

[auto39-153] 1 2 3 4Sloane, N. J. A. (ed.). "SequenceA033548(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.

[ReferenceF-154] 1 2 3Sloane, N. J. A. (ed.). "SequenceA006832(Discriminants of totally real cubic fields)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[auto49-155] 1 2Sloane, N. J. A. (ed.). "SequenceA003037(Smallest number of complexity n: smallest number requiring n 1's to build using +, * and ^)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[auto100-156] 1 2Sloane, N. J. A. (ed.). "SequenceA011379(n^2*(n+1))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[157] Hadamard, J. (1893), "Résolution d'une question relative aux déterminants", Bulletin des Sciences Mathématiques, 17: 240–246

[158] Fujiwara, M. (2005), Introduction to Truly Beautiful Mathematics, pp. 100–101

[159] Sloane, N. J. A. (ed.). "SequenceA028569(n*(n + 9))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[160] Sloane, N. J. A. (ed.). "SequenceA085831(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.

[161] Sloane, N. J. A. (ed.). "SequenceA064410(Number of partitions of n with zero crank)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[Pentagonal_pyramidal_number-162] "Sloane's A002411 : Pentagonal pyramidal numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.

[auto31-163] 1 2 3 4Sloane, N. J. A. (ed.). "SequenceA307958(Coreful perfect numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[164] "Sloane's A000078 : Tetranacci numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.

[auto101-165] 1 2Sloane, N. J. A. (ed.). "SequenceA084647(Hypotenuses for which there exist exactly 3 distinct integer triangles)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[auto80-166] 1 2Sloane, N. J. A. (ed.). "SequenceA002071(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.

[auto92-167] Sloane, N. J. A. (ed.). "SequenceA071395(Primitive abundant numbers (abundant numbers all of whose proper divisors are deficient numbers))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[auto82-168] 1 2Sloane, N. J. A. (ed.). "SequenceA002413(Heptagonal (or 7-gonal) pyramidal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[169] Sloane, N. J. A. (ed.). "SequenceA018000(Powers of cube root of 9 rounded down)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[170] Sloane, N. J. A. (ed.). "SequenceA038147(Number of polyhexes with n cells)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[auto33-171] 1 2Sloane, N. J. A. (ed.). "SequenceA000702(number of conjugacy classes in the alternating group A_n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[172] Sloane, N. J. A. (ed.). "SequenceA001970(Functional determinants; partitions of partitions; Euler transform applied twice to all 1's sequence)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[173] Sloane, N. J. A. (ed.). "SequenceA000084(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.

[174] Sloane, N. J. A. (ed.). "SequenceA000615(Threshold functions of exactly n variables)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[175] Sloane, N. J. A. (ed.). "SequenceA000057(Primes dividing all Fibonacci sequences)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[176] Sloane, N. J. A. (ed.). "SequenceA002720(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.

[auto67-177] 1 2 3 4Sloane, N. J. A. (ed.). "SequenceA065381(Primes not of the form p + 2^k)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[178] Sloane, N. J. A. (ed.). "SequenceA140090(n*(3*n + 7)/2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[auto78-179] 1 2Sloane, N. J. A. (ed.). "SequenceA008406(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.

[180] Sloane, N. J. A. (ed.). "SequenceA000014(Number of series-reduced trees with n nodes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[181] Sloane, N. J. A. (ed.). "SequenceA057660(Sum_{1..n} n/gcd(n,k))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[182] Sloane, N. J. A. (ed.). "SequenceA088319(Ordered hypotenuses of primitive Pythagorean triangles having legs that add up to a square)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[auto66-183] 1 2Sloane, N. J. A. (ed.). "SequenceA144300(Number of partitions of n minus number of divisors of n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[Achilles-184] 1 2Sloane, N. J. A. (ed.). "SequenceA052486(Achilles numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[185] "Sloane's A005231 : Odd abundant numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.

[186] Sloane, N. J. A. (ed.). "SequenceA033428(3*n^2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[187] Sloane, N. J. A. (ed.). "SequenceA326123(a(n) is the sum of all divisors of the first n odd numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[188] Sloane, N. J. A. (ed.). "SequenceA006327(Fibonacci(n) - 3. Number of total preorders)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[189] "Sloane's A000045 : Fibonacci numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.

[auto18-190] 1 2Sloane, N. J. A. (ed.). "SequenceA064174(Number of partitions of n with nonnegative rank)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[191] Sloane, N. J. A. (ed.). "SequenceA023360(Number of compositions of n into prime parts)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[192] Sloane, N. J. A. (ed.). "SequenceA103473(Number of polyominoes consisting of 7 regular unit n-gons)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[193] Sloane, N. J. A. (ed.). "SequenceA022004(Initial members of prime triples (p, p+2, p+6))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[auto56-194] 1 2Sloane, N. J. A. (ed.). "SequenceA018805". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[ReferenceE-195] Sloane, N. J. A. (ed.). "SequenceA059845(n*(3*n + 11)/2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[196] Sloane, N. J. A. (ed.). "SequenceA006489(Numbers k such that k-6, k, and k+6 are primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[197] Sloane, N. J. A. (ed.). "SequenceA213427(Number of ways of refining the partition n^1 to get 1^n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[198] Sloane, N. J. A. (ed.). "SequenceA134602(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.

[199] Sloane, N. J. A. (ed.). "SequenceA084990(n*(n^2+3*n-1)/3)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[200] Sloane, N. J. A. (ed.). "SequenceA077068(Semiprimes of the form prime + 1)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[201] Sloane, N. J. A. (ed.). "SequenceA115160(Numbers that are not the sum of two triangular numbers and a fourth power)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[auto36-202] 1 2Sloane, N. J. A. (ed.). "SequenceA046092(4 times triangular numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[auto88-203] Sloane, N. J. A. (ed.). "SequenceA071399(Rounded volume of a regular tetrahedron with edge length n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[204] Sloane, N. J. A. (ed.). "SequenceA001339(Sum_{0..n} (k+1)! binomial(n,k))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[205] Sloane, N. J. A. (ed.). "SequenceA007290(2*binomial(n,3))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[206] Sloane, N. J. A. (ed.). "SequenceA058360(Number of partitions of n whose reciprocal sum is an integer)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[207] Sloane, N. J. A. (ed.). "SequenceA046931(Prime islands: least prime whose adjacent primes are exactly 2n apart)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[208] "Sloane's A001599 : Harmonic or Ore numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.

[auto69-209] Sloane, N. J. A. (ed.). "SequenceA001770(Numbers k such that 5*2^k - 1 is prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[210] Sloane, N. J. A. (ed.). "SequenceA056613(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.

[211] Sloane, N. J. A. (ed.). "SequenceA068140(Smaller of two consecutive numbers each divisible by a cube greater than one)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[212] Sloane, N. J. A. (ed.). "SequenceA030272(Number of partitions of n^3 into distinct cubes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[auto70-213] 1 2Sloane, N. J. A. (ed.). "SequenceA038499(Number of partitions of n into a prime number of parts)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[214] Sloane, N. J. A. (ed.). "SequenceA018818(Number of partitions of n into divisors of n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[Cuban_Prime-215] 1 2 3"Sloane's A002407 : Cuban primes". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.

[auto37-216] Sloane, N. J. A. (ed.). "SequenceA050710(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.

[auto29-217] Sloane, N. J. A. (ed.). "SequenceA046376(Palindromes with exactly 2 palindromic prime factors (counted with multiplicity), and no other prime factors)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[auto71-218] 1 2 3Sloane, N. J. A. (ed.). "SequenceA051424(Number of partitions of n into pairwise relatively prime parts)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[219] Sloane, N. J. A. (ed.). "SequenceA059802(Numbers k such that 5^k - 4^k is prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[auto97-220] Sloane, N. J. A. (ed.). "SequenceA082982(Numbers k such that k, k+1 and k+2 are sums of 2 squares)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[auto47-221] Sloane, N. J. A. (ed.). "SequenceA061068(Primes which are the sum of a prime and its subscript)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[222] Sloane, N. J. A. (ed.). "SequenceA057562(Number of partitions of n into parts all relatively prime to n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[223] Sloane, N. J. A. (ed.). "SequenceA000230(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.

[224] Sloane, N. J. A. (ed.). "SequenceA261983(Number of compositions of n such that at least two adjacent parts are equal)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[225] Sloane, N. J. A. (ed.). "SequenceA053781(Numbers k that divide the sum of the first k composite numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[auto96-226] 1 2Sloane, N. J. A. (ed.). "SequenceA090781(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.

[ReferenceG-227] Sloane, N. J. A. (ed.). "SequenceA098859(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.

[auto5-228] 1 2Sloane, N. J. A. (ed.). "SequenceA045943(Triangular matchstick numbers: 3*n*(n+1)/2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2 June 2022.

[229] Sloane, N. J. A. (ed.). "SequenceA286518(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.

[230] Sloane, N. J. A. (ed.). "SequenceA004041(Scaled sums of odd reciprocals: (2*n + 1)!!*(Sum_{0..n} 1/(2*k + 1)))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[231] Sloane, N. J. A. (ed.). "SequenceA023359(Number of compositions (ordered partitions) of n into powers of 2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[232] Sloane, N. J. A. (ed.). "SequenceA000787(Strobogrammatic numbers: the same upside down)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[auto76-233] Sloane, N. J. A. (ed.). "SequenceA001157(sigma_2(n): sum of squares of divisors of n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[234] "Sloane's A000073 : Tribonacci numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.

[235] Sloane, N. J. A. (ed.). "SequenceA020989((5*4^n - 2)/3)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[236] Sloane, N. J. A. (ed.). "SequenceA301700(Number of aperiodic rooted trees with n nodes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[237] Sloane, N. J. A. (ed.). "SequenceA056045("Sum_{d divides n}(binomial(n,d))")". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[auto40-238] 1 2Sloane, N. J. A. (ed.). "SequenceA028387(n + (n+1)^2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[239] "Sloane's A007850 : Giuga numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.

[240] Sloane, N. J. A. (ed.). "SequenceA161757((prime(n))^2 - (nonprime(n))^2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[241] Sloane, N. J. A. (ed.). "SequenceA078374(Number of partitions of n into distinct and relatively prime parts)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[auto58-242] Sloane, N. J. A. (ed.). "SequenceA005918(Number of points on surface of square pyramid: 3*n^2 + 2 (n>0))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[243] Sloane, N. J. A. (ed.). "SequenceA167008(Sum_{0..n} C(n,k)^k)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[244] Sloane, N. J. A. (ed.). "SequenceA350507(Number of (not necessarily connected) unit-distance graphs on n nodes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[245] Sloane, N. J. A. (ed.). "SequenceA102627(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.

[auto30-246] Sloane, N. J. A. (ed.). "SequenceA338470(Number of integer partitions of n with no part dividing all the others)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[auto44-247] Sloane, N. J. A. (ed.). "SequenceA144391(3*n^2 + n - 1)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[auto19-248] Sloane, N. J. A. (ed.). "SequenceA325349(Number of integer partitions of n whose augmented differences are distinct)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[249] Sloane, N. J. A. (ed.). "SequenceA216955(number of binary sequences of length n and curling number k)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[250] Sloane, N. J. A. (ed.). "SequenceA001523(Number of stacks, or planar partitions of n; also weakly unimodal compositions of n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[251] Sloane, N. J. A. (ed.). "SequenceA055327(Triangle of rooted identity trees with n nodes and k leaves)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[252] Sloane, N. J. A. (ed.). "SequenceA045944(Rhombic matchstick numbers: n*(3*n+2))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[253] Sloane, N. J. A. (ed.). "SequenceA005317((2^n + C(2*n,n))/2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[254] Sloane, N. J. A. (ed.). "SequenceA064118(Numbers k such that the first k digits of e form a prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[255] Sloane, N. J. A. (ed.). "SequenceA325860(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.

[256] Sloane, N. J. A. (ed.). "SequenceA073592(Euler transform of negative integers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[257] Sloane, N. J. A. (ed.). "SequenceA288253(Number of heptagons that can be formed with perimeter n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[auto83-258] Sloane, N. J. A. (ed.). "SequenceA056220(2*n^2 - 1)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[259] Sloane, N. J. A. (ed.). "SequenceA075213(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.

[260] "Sloane's A054377 : Primary pseudoperfect numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.

[261] Kellner, Bernard C.; 'The equation denom(B_n) = n has only one solution'

[262] Sloane, N. J. A. (ed.). "SequenceA006318(Large Schröder numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 22 May 2016.

[263] "Sloane's A000058 : Sylvester's sequence". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.

[264] Sloane, N. J. A. (ed.). "SequenceA083186(Sum of first n primes whose indices are primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[265] Sloane, N. J. A. (ed.). "SequenceA005260(Sum_{0..n} binomial(n,k)^4)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[266] Sloane, N. J. A. (ed.). "SequenceA056877(Number of polyominoes with n cells, symmetric about two orthogonal axes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[267] Sloane, N. J. A. (ed.). "SequenceA061801((7*6^n - 2)/5)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[268] Sloane, N. J. A. (ed.). "SequenceA037032(Total number of prime parts in all partitions of n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[auto1-269] Sloane, N. J. A. (ed.). "SequenceA332835(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.

[auto86-270] 1 2Sloane, N. J. A. (ed.). "SequenceA304716(Number of integer partitions of n whose distinct parts are connected)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[auto62-271] Sloane, N. J. A. (ed.). "SequenceA007585(10-gonal (or decagonal) pyramidal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[272] Sloane, N. J. A. (ed.). "SequenceA000230(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.

[273] Sloane, N. J. A. (ed.). "SequenceA004068(Number of atoms in a decahedron with n shells)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[274] Sloane, N. J. A. (ed.). "SequenceA001905(From higher-order Bernoulli numbers: absolute value of numerator of D-number D2n(2n-1))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[275] Sloane, N. J. A. (ed.). "SequenceA001208(solution to the postage stamp problem with 3 denominations and n stamps)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[276] Sloane, N. J. A. (ed.). "SequenceA000081(Number of unlabeled rooted trees with n nodes (or connected functions with a fixed point))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[277] Sloane, N. J. A. (ed.). "SequenceA039771(Numbers k such that phi(k) is a perfect cube)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[278] Sloane, N. J. A. (ed.). "SequenceA024026(3^n - n^3)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[279] Sloane, N. J. A. (ed.). "SequenceA235945(Number of partitions of n containing at least one prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[280] Sloane, N. J. A. (ed.). "SequenceA088144(Sum of primitive roots of n-th prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[281] Sloane, N. J. A. (ed.). "SequenceA000166(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.

[282] Sloane, N. J. A. (ed.). "SequenceA000240(Rencontres numbers: number of permutations of [n] with exactly one fixed point)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[283] Sloane, N. J. A. (ed.). "SequenceA000602(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.

[284] ""Aztec Diamond"". Retrieved 20 September 2022.

[285] Sloane, N. J. A. (ed.). "SequenceA023811(Largest metadrome (number with digits in strict ascending order) in base n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[286] Sloane, N. J. A. (ed.). "SequenceA000990(Number of plane partitions of n with at most two rows)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[287] Sloane, N. J. A. (ed.). "SequenceA007530(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.

[288] Sloane, N. J. A. (ed.). "SequenceA004799(Self convolution of Lucas numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[289] Sloane, N. J. A. (ed.). "SequenceA005920(Tricapped prism numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[290] Sloane, N. J. A. (ed.). "SequenceA000609(Number of threshold functions of n or fewer variables)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[291] Sloane, N. J. A. (ed.). "SequenceA259793(Number of partitions of n^4 into fourth powers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[292] Sloane, N. J. A. (ed.). "SequenceA006785(Number of triangle-free graphs on n vertices)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[293] Sloane, N. J. A. (ed.). "SequenceA005987(Number of symmetric plane partitions of n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[294] Sloane, N. J. A. (ed.). "SequenceA023431(Generalized Catalan Numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[auto93-295] Sloane, N. J. A. (ed.). "SequenceA001567(Fermat pseudoprimes to base 2, also called Sarrus numbers or Poulet numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[296] "Sloane's A034897 : Hyperperfect numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.

[297] Sloane, N. J. A. (ed.). "SequenceA240736(Number of compositions of n having exactly one fixed point)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[298] Sloane, N. J. A. (ed.). "SequenceA007070(4*a(n-1) - 2*a(n-2))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[299] Sloane, N. J. A. (ed.). "SequenceA027851(Number of nonisomorphic semigroups of order n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[300] Sloane, N. J. A. (ed.). "SequenceA003060(Smallest number with reciprocal of period length n in decimal (base 10))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[301] Sloane, N. J. A. (ed.). "SequenceA002845(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.

[auto87-302] Sloane, N. J. A. (ed.). "SequenceA023894(Number of partitions of n into prime power parts)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[303] Sloane, N. J. A. (ed.). "SequenceA045648(Number of chiral n-ominoes in (n-1)-space, one cell labeled)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[304] Sloane, N. J. A. (ed.). "SequenceA000127(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.

[305] Sloane, N. J. A. (ed.). "SequenceA178084(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.

[auto24-306] 1 2Sloane, N. J. A. (ed.). "SequenceA007419(Largest number not the sum of distinct n-th-order polygonal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[307] Sloane, N. J. A. (ed.). "SequenceA100953(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.

[308] Sloane, N. J. A. (ed.). "SequenceA226366(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.

[auto57-309] Sloane, N. J. A. (ed.). "SequenceA007491(Smallest prime > n^2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[310] Sloane, N. J. A. (ed.). "SequenceA319014(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.

[311] Sloane, N. J. A. (ed.). "SequenceA055621(Number of covers of an unlabeled n-set)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[312] Sloane, N. J. A. (ed.). "SequenceA005915(Hexagonal prism numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[313] Sloane, N. J. A. (ed.). "SequenceA000522(Total number of ordered k-tuples of distinct elements from an n-element set)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[314] Sloane, N. J. A. (ed.). "SequenceA005449(Second pentagonal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[315] Sloane, N. J. A. (ed.). "SequenceA002982(Numbers n such that n! - 1 is prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[316] Sloane, N. J. A. (ed.). "SequenceA030238(Backwards shallow diagonal sums of Catalan triangle A009766)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[auto16-317] Sloane, N. J. A. (ed.). "SequenceA006128(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.

[318] Sloane, N. J. A. (ed.). "SequenceA089046(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.

[319] Sloane, N. J. A. (ed.). "SequenceA065900(Numbers n such that sigma(n) equals sigma(n-1) + sigma(n-2))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[320] 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.

[321] Sloane, N. J. A. (ed.). "SequenceA052542(2*a(n-1) + a(n-2))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[322] Sloane, N. J. A. (ed.). "SequenceA217076(Numbers n such that (n^37-1)/(n-1) is prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[323] Sloane, N. J. A. (ed.). "SequenceA302545(Number of non-isomorphic multiset partitions of weight n with no singletons)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[324] Sloane, N. J. A. (ed.). "SequenceA343971(Numbers that are the sum of four positive cubes in four or more ways)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[325] Sloane, N. J. A. (ed.). "SequenceA034090(Numbers k whose sum of proper divisors exceeds that of all smaller numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[auto11-326] Sloane, N. J. A. (ed.). "SequenceA000124(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.

[327] Sloane, N. J. A. (ed.). "SequenceA058037(Numbers k such that 3^k - k is prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[328] Sloane, N. J. A. (ed.). "SequenceA064591(Nonunitary perfect numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[329] Sloane, N. J. A. (ed.). "SequenceA007504(Sum of the first n primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[330] Sloane, N. J. A. (ed.). "SequenceA053767(Sum of the first n composite numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[331] Sloane, N. J. A. (ed.). "SequenceA096711(Number of balanced primes less than 10^n.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[332] Sloane, N. J. A. (ed.). "Secuencia A187220 (secuencia de alas de gaviota)" . La enciclopedia en línea de secuencias enteras . Fundación OEIS.

[333] Sloane, N. J. A. (ed.). "Secuencia A046351 (Números compuestos palíndromos con solo factores primos palíndromos)" . La enciclopedia en línea de secuencias de enteros . Fundación OEIS.

[334] Sloane, N. J. A. (ed.). "Secuencia A000612 (Número de clases de P-equivalencia de funciones de conmutación de n o menos variables, dividido por 2)" . La enciclopedia en línea de secuencias enteras . Fundación OEIS.

[335] (secuencia A059801 en el OEIS )

[336] Sloane, N. J. A. (ed.). "Secuencia A263341 (Triángulo leído por filas: T(n,k) es el número de grafos sin etiquetar en n vértices con número de independencia k)" . La enciclopedia en línea de secuencias enteras . Fundación OEIS.

[337] Sloane, N. J. A. (ed.). "Secuencia A011755 (Suma_{1..n} k*phi(k))" . La enciclopedia en línea de secuencias enteras . Fundación OEIS.

[338] Sloane, N. J. A. (ed.). "Secuencia A038823 (Número de primos entre n*1000 y (n+1)*1000)" . La enciclopedia en línea de secuencias de enteros . Fundación OEIS.

[339] Stein, William A. (10 de febrero de 2017). "La hipótesis de Riemann y la conjetura de Birch y Swinnerton-Dyer" . wstein.org . Consultado el 6 de febrero de 2021 .

[ 1 ]

[ 2 ]

[ 3 ]

[ 4 ]

[ 5 ]

[ 6 ]

[ 7 ]

[ 8 ]

[ 9 ]

[ 10 ]

[ 11 ]

[ 12 ]

[ 13 ]

[ 14 ]

[ 15 ]

[ 16 ]

[ 17 ]

[ 18 ]

[ 19 ]

[ 20 ]

[ 21 ]

[ 22 ]

[ 23 ]

[ 24 ]

el

[ 26 ]

[ 27 ]

[ 28 ]

[ 29 ]

[ 30 ]

[ 31 ]

[ 32 ]

[ 33 ]

[ 34 ]

[ 35 ]

[ 36 ]

[ 37 ]

[ 38 ]

[ 39 ].

[ 40 ]

[ 41 ]

[ 42 ]

[ 43 ]

[ 44 ]

[ 45 ]

[ 46 ]

[ 47 ]

[ 48 ]

[ 49 ]

[

[ 51 ]

[ 52 ]

[ 53 ]

[ 54 ]

[ 55 ]

[ 56 ]

[ 57 ]

[ 58 ]

[ 59 ]

[ 60 ]

[ 61 ]

[ 62 ]

[ 63 ]

[ 64 ]

[ 65 ]

[ 66 ]

[ 67 ]

[ 68 ]

[ 69 ]

[ 70 ]

[ 71 ]

[ 72 ]

[ 73 ]

[ 74 ]

[ 75 ]

[ 76 ].

[ 77 ]

[ 78 ]

[ 79 ]

[ 80 ]

[ 81 ]

[ 82 ]

[ 83 ]

[ 84 ]

[ 85 ]

[ 86 ]

[ 87 ]

[ 88 ]

[ 89 ]

[ 90 ]

[ 91 ]

[ 92 ].

[ 93 ]

[ 94 ]

[ 95 ]

[ 96 ]

[ 97 ]

[ 98 ].

[ 99 ]

[ 100 ]