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.

1003

1003 = 17 × 59. Es el producto de algún primo p y el p ^-ésimo primo, es decir, cuando p = 17.

1004

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

1005

1005 = 3 × 5 × 67. Es un número piramidal decagonal ^{[ 4 ]} y un cero de la función de Mertens.

1006

1006 = 2 × 503. Es un número inusual , un número equidigital , un número libre de cuadrados y la suma de dos números pentatópicos distintos (5 y 1001). Es un semiprimo , el producto de dos primos distintos (2 y 503). Es la suma de 7 quintas potencias positivas. ^{[ 5 ]} Es una brecha récord entre primos gemelos . ^{[ 6 ]} 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. [ ⁷^]

En decimal, su cubo se puede concatenar a partir de otros cubos, 1_0_1_8_1_0_8_216 ("_" indica concatenación, 0 = 0 ³ , 1 = 1 ³ , 8 = 2 ³ , 216 = 6 ³ ) ^{[ 8 ]}

1007

1007 = 19 × 53. Es la suma de 8 potencias quintas positivas. ^{[ 9 ]}

1008

1008 = 2⁴ ^× 3² ^× 7. Es divisible por 168, el número de primos que hay debajo.

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 ₂₈ ).

1010

1010 = 2 × 5 × 101 = 10 ³ + 10. ^{[ 10 ]} Es un cero de la función de Mertens.

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 . ^{[ 11 ]}

1012

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

número ternario , (32 ₁₀ )

1013

1013 es un número primo, un primo de Sophie Germain , ^{[ 12 ]} un número cuadrado centrado , ^{[ 13 ]} y un cero de la función de Mertens.

1014

1014 = 2 × 3 × 13 ² = 2 ¹⁰ -10. ^{[ 14 ]} Es un cero de la función de Mertens y la suma de los números no triangulares entre los números triangulares sucesivos 78 y 91. ^{[ 15 ]}

1015

1015 = 5 × 7 × 29. Es un número piramidal cuadrado . ^{[ 16 ]}

1016

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

1017

1017 = 3 ² × 113. Es un número triacontagonal generalizado. ^{[ 19 ]}

1018

1018 = 2 × 509. Es un cero de la función de Mertens. 1018 ¹⁶ + 1 es primo. ^{[ 20 ]}

1019

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

1020

1020 = 2 ² × 3 × 5 × 17. Es un número polidivisible .

1021

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

1022

1022 = 2 × 7 × 73. Es un número de Friedman .

1023

1024

1025

1025 = 5 ² × 41. Es un número de Jacobsthal-Lucas y la hipotenusa del 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 distintas potencias de 4 (4 ⁵ + 4 ⁰ ).

1026

1026 = 2 × 3 ³ × 19. Es la suma de dos potencias distintas de 2: 1026 = 2 ¹⁰ + 2 ¹ .

1027

1027 = 13 × 79. Es la suma de los cuadrados de los primeros ocho números primos. Se puede escribir en cualquier base, desde la base 2 hasta la base 18, usando solo los dígitos del 0 al 9.

1028

1028 = 2² ^× 257. Es la suma de la función totiente para los primeros 58 enteros. Se puede escribir en cualquier base desde la base 2 hasta la base 18 usando solo los dígitos del 0 al 9. Hay 1029 primos <= ^2¹³ . ^{[ 22 ]}

1029

1029 = 3 × 7³ ^. Se puede escribir en cualquier base desde la base 2 hasta la base 18 usando solo los dígitos del 0 al 9.

1030

1030 = 2 × 5 × 103. Es un número heptagonal generalizado.

1031

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

1032

1032 = 2 ³ × 3 × 43. Es la suma de dos potencias distintas de 2: 1032 = 2 ¹⁰ + 2 ³ .

1033

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

1034

1034 = 2 × 11 × 47. Es la suma de 12 potencias novenas positivas. ^{[ 24 ]}

1035

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

1036

1036 = 2² ^× 7 × 37. Es un número poligonal central. ^{[ 27 ]}

1037

1037 = 17 × 61. Es un número de la secuencia E-toothpick. ^{[ 28 ]}

1038

1038 = 2 × 3 × 173. Es un número entero par que es una suma no ordenada de dos números primos de exactamente 40 maneras. ^{[ 29 ]}

1039

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

1040

1040 = 2 ⁴ × 5 × 13. Es la suma de potencias distintas de 4: 1040 = 4 ⁵ + 4 ² . ^{[ 32 ]} Hay 1040 piezas que se pueden ver en un teseracto de Rubik de 6 × 6 × 6 × 6.

1041

1041 = 3 × 347. Es la suma de 11 potencias quintas positivas. ^{[ 33 ]}

1042

1042 = 2 × 521. Es la suma de 12 potencias quintas positivas. ^{[ 34 ]}

1043

1043 = 7 × 149. Es un número cuya suma de sus dígitos pares y la suma de sus dígitos impares son pares. ^{[ 35 ]}

1044

1044 = 2² ^× 3² ^× 29. Es la suma de potencias distintas de 4: 1044 = ^2¹⁰ + ^2⁴ + ^2² . ^{[ 32 ]}

1045

1045 = 5 × 11 × 19. Es un número octogonal . ^{[ 36 ]}

1046

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

1047

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

1048

1048 = 2³ ^× 131. Hay 1048 particiones de 27 en partes libres de cuadrados . ^{[ 39 ]} 1049

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

1050

1050 = 2 × 3 × 5 ² × 7. Hay 1050 partes en todas las particiones de 29 en partes distintas. ^{[ 41 ]}

1051

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

1052

1052 = 2² ^× 263. Es la suma de 9 sextas potencias positivas. ^{[ 43 ]}

1053

1053 = 3 ⁴ × 13. Es un número triangular de cerillas. ^{[ 44 ]}

1054

1054 = 2 × 17 × 31. Es un número triangular centrado . ^{[ 45 ]}

1055

1055 = 5 × 211. Es la suma de 12 sextas potencias positivas. ^{[ 46 ]}

1056

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

1057

1057 = 7 × 151. Es un número poligonal central. ^{[ 48 ]}

1058

1058 = 2 × 23² ^. Es la suma de 4 quintas potencias positivas. ^{[ 49 ]}

1059

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

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 ) ^{[ 51 ]} 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 ). ^{[ 53 ]}

1062

1062 = 2 × 3 ² × 59. Es un número que no es la suma de dos palíndromos . ^{[ 54 ]}

1063

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

1064

1064 = 2³ ^× 7 × 19. Es la suma de dos cubos positivos . ^{[ 56 ]}

1065

1065 = 3 × 5 × 71. Es un número duodecagonal generalizado. ^{[ 57 ]}

1066

1066 = 2 × 13 × 41. Es un número cuya suma de sus divisores es un cuadrado . ^{[ 58 ]}

1067

1067 = 11 × 97. Hay 1067 particiones enteras estrictas de 45 que están vacías o tienen una parte más pequeña que no divide a las demás. ^[⁵⁹^]

1068

1068 = 2² ^× 3 × 89. Es la suma de 7 quintas potencias positivas. ^{[ 5 ]} Hay un total de 1068 partes en todas las particiones de 15. ^{[ 60 ]}

1069

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

1070

1070 = 2 × 5 × 107. Es la suma de 9 potencias quintas positivas. ^{[ 62 ]}

1071

1071 = 3² ^× 7 × 17. Es un número heptagonal . ^{[ 63 ]}

1072

1072 = 2 ⁴ × 67. Es un número heptagonal centrado . ^{[ 64 ]}

1073

1073 = 29 × 37. Es la suma de 12 potencias quintas positivas. ^{[ 34 ]}

1074

1074 = 2 × 3 × 179. Es un número que no es la suma de dos palíndromos . ^{[ 54 ]}

1075

1075 = 5² ^× 43. Es un número que no es la suma de dos palíndromos . ^{[ 54 ]}

1076

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

1077

1077 = 3 × 359.

1078

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

1079

1079 = 13 × 83. Todo entero positivo es la suma de como máximo 1079 potencias décima.

1080

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

1081

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

1082

1082 = 2 × 541. Es un número poligonal central. ^{[ 27 ]}

1083

1083 = 3 × 19² ^. Es un número cuadrado de tres cuartos. ^{[ 70 ]} Hay 1083 particiones de 53 en partes primas. ^{[ 71 ]}

1084

1084 = 2² ^× 271. Es el tercer radio de una espiral hexagonal. ^{[ 72 ]}

1084 ⁶⁴ + 1 es primo .

1085

1085 = 5 × 7 × 31. Hay 1085 particiones de n en partes distintas > o = 2. ^{[ 73 ]}

1086

1086 = 2 × 3 × 181. Es un número de Smith ^{[ 74 ]} 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 . ^{[ 75 ]}

1088

1088 = 2 ⁶ × 17. Es un número octotriangular cuyo resultado triangular es 136. ^{[ 76 ]} Es la suma de dos potencias distintas de 2: 1088 = 2 ¹⁰ + 2 ⁶ . ^{[ 77 ]}

1089

1090

1090 = 2 × 5 × 109. Es la suma de 5 potencias quintas positivas. ^{[ 78 ]}

1091

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

1092

1092 = 2² ^× 3 × 7 × 13. Es divisible por la cantidad de primos que hay debajo.

1093

1093 = el primo de Wieferich más pequeño (el único otro primo de Wieferich conocido es 3511^{[ 79 ]} ), primo gemelo de 1091 y número estrella ^{[ 80 ]}

1093 es un número primo . Junto con 1091 y 1097, forma una terna de primos . Es un primo feliz y un primo estrella . 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}}\,.

1094

1094 = 2 × 547. Es la suma de 9 potencias quintas positivas. ^{[ 62 ]}

1094 ⁶⁴ + 1 es primo .

1095

1095 = 3 × 5 × 73. Es la suma de 10 potencias quintas positivas. ^{[ 81 ]} Es un número que no es la suma de dos palíndromos .

1096

1096 = 2 ³ × 137. Es un número hendecagonal. ^{[ 82 ]} Hay 1096 particiones sólidas estrictas de 18. ^{[ 83 ]}

1097

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

1098

1098 = 2 × 3 ² × 61.

1099

1099 = 7 × 157.

1100 a 1199

1100

1100 = 2² ^× 5² ^× 11. Hay 1100 particiones de 61 en partes libres de cuadrados distintas. ^{[ 84 ]}

1101

1101 = 3 × 367. It is a pinwheel number.^[85]

1102

1102 = 2 × 19 × 29. It is the sum of the totient function for the first 60 integers.

1103

1103 is a prime number, a Sophie Germain prime,^[12] and a balanced prime.^[86]

1104

1104 = 2⁴ × 3 × 23. It is a Keith number^[87]

1105

1106

1106 = 2 × 7 × 79. There are 1106 regions into which the plane is divided when drawing 24 ellipses.^[88]

1107

1107 = 3³ × 41. There are 1107 non-isomorphic strict T₀ multiset partitions of weight 8.^[89]

1108

1108 = 2² × 277. It is a number k such that k⁶⁴ + 1 is prime.

1109

1109 is a prime number, a Friedlander-Iwaniec prime,^[90] and a Chen prime.

1110

1110 = 2 × 3 × 5 × 37. It is a number k such that 2^k + 3 is prime.^[91]

1111

1111 = 11 × 101. It is a repunit^[92] and a palindrome that is a product of two palindromic primes.^[93]

1112

1112 = 2³ × 139. It is a number k such that 9^k - 2 is a prime.^[94]

1113

1113 = 3 × 7 × 53. There are 1113 strict partions of 40.^[95]

1114

1114 = 2 × 557. There are 1114 ways to write 22 as an orderless product of orderless sums.^[96]

1115

1115 = 5 × 223. There are 1115 partitions of 27 into a prime number of parts.^[97]

1116

1116 = 2² × 3² × 31. It is divisible by the number of primes below it.

1117

1117 is a prime number and a Chen prime. There are 1117 diagonally symmetric polyominoes with 16 cells.^[98]

1118

1118 = 2 × 13 × 31. There are 1118 unimodular 2 × 2 matrices having all terms in {0,1,...,21}.^[99]

1119

1119 = 3 × 373. There are 1119 bipartite graphs with 9 nodes.^[100]

1120

1120 = 2⁵ × 5 × 7. It is a number k such that k⁶⁴ + 1 is prime.

1121

1121 = 19 × 59. Hay 1121 cuadrados entre 34 ² y 34 ⁴ . ^{[ 101 ]}

1122

1122 = 2 × 3 × 11 × 17. Es un número prónico. ^{[ 47 ]} Es divisible por la cantidad de primos que están debajo de él.

1123

1123 es un número primo y un primo equilibrado . ^{[ 86 ]}

1124

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

1125

1125 = 3 ² × 5 ³ . Es un número de Aquiles .

1126

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

1127

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

1128

1128 = 2³ ^× 3 × 47. Es el 47.º número triangular ^{[ 26 ]} y el 24.º número hexagonal ^{[ 25 ]} . 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. ^{[ 106 ]}

1130

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

1131

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

1132

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

1133

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

1134

1134 = 2 × 3 ⁴ × 7. Es un número triangular de cerillas. ^{[ 44 ]}

1135

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

1136

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

1137

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

1138

1138 = 2 × 569.

Número recurrente en las obras de George Lucas y sus compañías, comenzando con su primer largometraje: THX 1138 ; en particular, un código especial para huevos de Pascua en los DVD de Star Wars .

1139

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

1140

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

1141

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

1142

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

1143

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

1144

1144 = 2 ³ × 11 × 13.

1145

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

1146

1146 = 2 × 3 × 191.

1147

1147 = 31 × 37. Es el producto de 2 primos consecutivos. ^{[ 120 ]}

1148

1148 = 2 ² × 7 × 41.

1149

1149 = 3 × 383. Es el producto de dos primos palíndromos. ^{[ 121 ]}

1150

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

1151

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

1152

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

1153

1153 es un número primo, un superprimo y un primo de Proth . ^{[ 125 ]}

1154

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

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 , ^{[ 127 ]} un número pentagonal centrado, ^{[ 42 ]} y un número hendecagonal centrado. ^{[ 128 ]}

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. ^{[ 129 ]}

1158

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

1159

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

1160

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

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. ^{[ 67 ]}

1163

1163 es el primo más pequeño mayor que 34 ² . ^{[ 133 ]} También es un 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 ^{[ 134 ].}

1165

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

1166

1166 = 2 × 11 × 53. Es un número piramidal heptagonal. ^{[ 135 ]}

1167

1167 = 3 × 389. Hay 1167 números racionales que se pueden construir a partir del conjunto de enteros entre 1 y 43. ^{[ 136 ]}

1168

1168 = 2 ⁴ × 73 = antisigma(49). ^{[ 137 ]}

1169

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

1170

1170 = 2 × 3 ² × 5 × 13. Es la puntuación más alta posible en un partido de los Torneos Nacionales de Preguntas Académicas (NAQT).

1171

1171 es un número superprimo.

1172

1172 = 2² ^× 293. Hay 1172 subconjuntos de los primeros 14 enteros cuya suma es divisible por 14. ^{[ 138 ]}

1173

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

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. ^{[ 104 ]}

1176

1176 = 48º número triangular ^{[ 26 ]}

1177

1177 = número heptagonal ^{[ 63 ]}

1178

1178 = número de puntos de superficie en un cubo con longitud de arista 15 ^{[ 18 ]}

1179

1179 = número de permanentes diferentes de matrices binarias de 7*7 ^{[ 140 ]}

1180

1180 = número más pequeño de particiones no enteras en potencias no enteras >1000. ^{[ 141 ]}

1181

1181 = el k más pequeño sobre 1000 tal que 8*10^k-49 es primo. ^{[ 142 ]}

1182

1182 = número de collares posibles con 14 cuentas de 2 colores (que no se pueden voltear) ^{[ 143 ]}

1183

1183 = número piramidal pentagonal

1184

1184 = número amigable con 1210 ^{[ 144 ]}

1185

1185 = número de particiones de 45 en partes relativamente primas por pares ^{[ 145 ]}

1186

1186 = número de poliominós diagonalmente simétricos con 15 celdas, ^{[ 98 ]} número de particiones de 54 en partes primas

1187

1187 = primo seguro, ^{[ 21 ]} primo de Stern , ^{[ 146 ]} primo equilibrado, ^{[ 86 ]} primo de Chen

1188

1188 = primer múltiplo de 4 dígitos de 18 que contiene 18 ^{[ 147 ]}

1189

1189 = número de cuadrados entre 35 ² y 35 ⁴ . ^{[ 101 ]}

1190

1190 = número pronético, ^{[ 47 ]} número de cartas para construir un castillo de naipes de 28 niveles ^{[ 148 ]}

1191

1191 = 35 ² - 35 + 1 = H ₃₅ (el 35º número de Hogben) ^{[ 149 ]}

1192

1192 = suma de la función totiente para los primeros 62 enteros

1193

1193 = un número tal que 4 ¹¹⁹³ - 3 ¹¹⁹³ es primo , Chen primo

1194

1194 = número de permutaciones que se pueden alcanzar con 8 movimientos de 2 alfiles y 1 torre en un tablero de ajedrez de 3 × 3 ^{[ 150 ]}

1195

1195 = el número de cuatro dígitos más pequeño para el cual a ⁻¹ (n) es un entero es a(n) es 2*a(n-1) - (-1) ⁿ^{[ 151 ]}

1196

1196 = $\sum _{k=1}^{38}\sigma (k)$ ^{[ 152 ]}

1197

1197 = número de molinillo ^{[ 85 ]}

1198

1198 = número heptagonal centrado ^{[ 64 ]}

1199

1199 = área del vigésimo trapecio unido ^{[ 153 ]}

1200 a 1299

1200 = el mil largo , diez " cientos largos " de 120 cada uno, el cálculo tradicional de grandes números en lenguas germánicas , el número de hogares de la muestra de calificaciones de Nielsen , ^{[ 154 ]} número k tal que k ⁶⁴ + 1 es primo
1201 = número cuadrado centrado, ^{[ 13 ]} superprimo , número decagonal centrado
1202 = número de regiones en las que se divide el plano mediante 25 elipses ^{[ 88 ]}
1203 : primer número de 4 dígitos en la secuencia de coordenadas para el teselado (2,6,∞) del plano hiperbólico ^{[ 155 ]}
1204 : constante mágica de un cubo mágico de 7 × 7 × 7 ^{[ 156 ]}
1205 = número de particiones de 28 tales que el número de partes impares es una parte ^{[ 157 ]}
1206 = número 29-gonal ^{[ 158 ]}
1207 = número compuesto de Polignac ^{[ 159 ]}
1208 = número de cadenas estrictas de divisores que comienzan con el superprimorial A006939(3) ^{[ 160 ]}
1209 = El producto de todos los subconjuntos ordenados no vacíos de {3,1} si {a,b} es a||b: 1209=1*3*13*31
1210 = número amigable con 1184; ^{[ 161 ]} Número autodescriptivo .
1211 = número compuesto de Polignac ^{[ 159 ]}
1212 = $\sum _{k=0}^{17}p(k)$ , dónde $p$ es el número de particiones de $k$ ^{[ 162 ]}
1213 = emirp
1214 = suma de los primeros 39 números compuestos, ^{[ 163 ]} número de espía
1215 = número de aristas en el triángulo hexagonal T(27) ^{[ 108 ]}
1216 = número nonagonal ^{[ 164 ]}
1217 = superprimo , Proth primo ^{[ 125 ]}
1218 = número de cerilla triangular ^{[ 44 ]}
1219 = cero de la función de Mertens , número triangular centrado ^{[ 111 ]}
1220 = cero de la función de Mertens, número de vectores binarios de longitud 16 que no contienen elementos únicos ^{[ 165 ]}
1221 = producto de los dos primeros dígitos y los tres primeros dígitos repetidos
1222 = número piramidal hexagonal
1223 = primo de Sophie Germain , ^{[ 12 ]} primo equilibrado, número primo número 200 ^{[ 86 ]}
1224 = número de aristas en la unión de dos grafos cíclicos, ambos de orden 34 ^{[ 166 ]}
1225 = 35 ² , 49.º número triangular , ^{[ 26 ]} 2.º número triangular cuadrado no trivial , ^{[ 167 ]} 25.º número hexagonal , ^{[ 25 ]} y el número más pequeño >1 que sea los tres. ^{[ 168 ]} Además, un número octogonal centrado, ^{[ 169 ]} icosienneagonal, ^{[ 170 ]} hexacontagonal, ^{[ 171 ]} y hecatonicositetragonal (124-gonal), y la suma de 5 cubos impares consecutivos (1 ³ + 3 ³ + 5 ³ + 7 ³ + 9 ³ )
1226 = número de árboles de identidad enraizados con 15 nodos ^{[ 172 ]}
1227 = número más pequeño que se puede representar como la suma de 3 números triangulares de 27 maneras ^{[ 173 ]}
1228 = suma de la función totiente para los primeros 63 enteros
1229 = primo de Sophie Germain , ^{[ 12 ]} número de primos menores que 10.000, emirp
1230 = el número de Mahon: T(9, 6) ^{[ 174 ]}
1231 = emirpa de montaña más pequeña, como 121, el número de montaña más pequeño es 11 × 11
1232 = número de conjuntos ordenados etiquetados de particiones de un conjunto de 7 en partes impares ^{[ 175 ]}
1233 = ^12² + ^33²
1234 = número de partes en todas las particiones de 30 en partes distintas,^{[ 41 ]} el número entero más pequeño que contiene todos los números del 1 al 4
1235 = excluyendo duplicados, contiene los primeros cuatro números de Fibonacci ^{[ 176 ]}
1236 = 617 + 619: suma de un par de primos gemelos ^{[ 177 ]}
1237 = primo de la forma 2p-1
1238 = número de particiones de 31 que no contienen 1 como parte ^{[ 31 ]}
1239 = número de palillos de dientes en 3D ^{[ 178 ]}
1240 = número piramidal cuadrado ^{[ 16 ]}
1241 = número de cubo centrado , ^{[ 179 ]} número de espía
1242 = número decagonal ^{[ 180 ]}
1243 = número compuesto de Polignac ^{[ 159 ]}
1244 = número de particiones completas de 25 ^{[ 181 ]}
1245 = Número de sistemas de conjuntos intersecantes de expansión etiquetados en 5 vértices. ^{[ 182 ]}
1246 = número de particiones de 38 tales que ninguna parte aparece más de una vez ^{[ 183 ]}
1247 = número pentagonal ^{[ 67 ]}
1248 = las primeras cuatro potencias de 2 concatenadas
1249 = emirp, número trimórfico ^{[ 184 ]}
1250 = área de un cuadrado con diagonal 50 ^{[ 185 ]}
1251 = 2 × 25 ² + 1 = número de determinantes diferentes de 2 × 2 con entradas enteras de 0 a 25 ^{[ 186 ]}
1252 = 2 × 25 ² + 2 = número de puntos en la superficie del tetraedro con longitud de arista 25 ^{[ 126 ]}
1253 = número de particiones de 23 con al menos una parte distinta ^{[ 187 ]}
1254 = número de particiones de 23 en partes relativamente primas ^{[ 188 ]}
1255 = cero de la función de Mertens, número de maneras de escribir 23 como un producto desordenado de sumas desordenadas, ^{[ 96 ]} número de particiones de 23 ^{[ 189 ]}
1256 = 1 × 2 × (5 ² ) ² + 6, ^{[ 190 ]} cero de la función de Mertens
1257 = número de puntos de la red dentro de un círculo de radio 20 ^{[ 106 ]}
1258 = 1 × 2 × (5 ² ) ² + 8, ^{[ 190 ]} cero de la función de Mertens
1259 = número altamente cototiente ^{[ 40 ]}
1260 = el decimosexto número altamente compuesto , ^{[ 191 ]} número prónico, ^{[ 47 ]} el número vampiro más pequeño , ^{[ 192 ]} suma de la función totiente para los primeros 64 enteros, número de particiones estrictas de 41 ^{[ 95 ]} y aparece dos veces en el Libro del Apocalipsis
1261 = número de estrella, ^{[ 80 ]} cero de la función de Mertens
1262 = número máximo de regiones en las que se divide el plano dibujando 36 círculos ^{[ 193 ]}
1263 = área superficial total redondeada de un tetraedro regular con longitud de arista 27 ^{[ 194 ]}
1264 = suma de los primeros 27 números primos
1265 = número de árboles enraizados con 43 vértices en los que los vértices del mismo nivel tienen el mismo grado ^{[ 195 ]}
1266 = número pentagonal centrado, ^{[ 42 ]} cero de la función de Mertens
1267 = número de 7 Knödel ^{[ 116 ]}
1268 = número de particiones de 37 en partes de potencias primas ^{[ 196 ]}
1269 = menor número de triángulos de la Espiral de Teodoro para completar 11 revoluciones ^{[ 197 ]}
1270 = 25 + 24×26 + 23×27, ^{[ 198 ]} cero de la función de Mertens
1271 = suma de los primeros 40 números compuestos ^{[ 163 ]}
1272 = suma de los primeros 41 números no primos ^{[ 199 ]}
1273 = 19 × 67 = 19 × primo(19) ^{[ 200 ]}
1274 = suma de los números no triangulares entre números triangulares sucesivos
1275 = 50.º número triangular , ^{[ 26 ]} equivalentemente la suma de los primeros 50 números naturales.
1276 = número de conjuntos irredundantes en el grafo de la fiesta de 25 cócteles ^{[ 201 ]}
1277 = el inicio de una constelación prima de longitud 9 (un "nonuplo primo")
1278 = número de vacas y terneros de Narayana después de 20 años ^{[ 202 ]}
1279 = cero de la función de Mertens, exponente primo de Mersenne
1280 = función de Mertens cero, número de partes en todas las composiciones de 9 ^{[ 203 ]}
1281 = número octogonal ^{[ 132 ]}
1282 = cero de la función de Mertens, número de particiones de 46 en partes relativamente primas por pares ^{[ 145 ]}
1283 = primo seguro ^{[ 21 ]}
1284 = 641 + 643: suma de un par de primos gemelos ^{[ 177 ]}
1285 = cero de la función de Mertens, número de nonominós libres , número de poliominós de paralelogramo con 10 celdas. ^{[ 204 ]}
1286 = número de figuras planas conectadas no equivalentes que se pueden formar a partir de cinco rectángulos de 1 x 2 (o dominós) de tal manera que cada par de rectángulos que se tocan comparten exactamente una arista, de longitud 1, y el grafo de adyacencia de los rectángulos es un árbol ^{[ 205 ]}
1287 = ${13 \choose 5}$ ^{[ 206 ]}
1288 = número heptagonal ^{[ 63 ]}
1289 = primo de Sophie Germain,^{[ 12 ]} cero de la función de Mertens
1290 = ${\frac {1289+1291}{2}}$ , promedio de un par primo gemelo ^{[ 207 ]}
1291 = primo más grande < 6 ⁴ , ^{[ 208 ]} cero de la función de Mertens
1292 = número tal que phi(1292) = phi(sigma(1292)), ^{[ 209 ]} cero de la función de Mertens
1293 = $\sum _{j=1}^{n}j\times prime(j)$ ^{[ 210 ]}
1294 = volumen redondeado de un octaedro regular con longitud de arista 14 ^{[ 211 ]}
1295 = número de aristas en la unión de dos grafos cíclicos, ambos de orden 35 ^{[ 166 ]}
1296 = 36 ² = 6 ⁴ , suma de los cubos de los primeros ocho enteros positivos, el número de rectángulos en un tablero de ajedrez normal de 8 × 8 , también el tamaño máximo de fuente permitido en Adobe InDesign, número de combinaciones de 2 caracteres (00-ZZ)
1297 = superprimo , cero de la función de Mertens, número de molinete ^{[ 85 ]}
1298 = número de particiones de 55 en partes primas
1299 = cero de la función de Mertens, número de particiones de 52 tales que la parte más pequeña es mayor o igual que el número de partes ^{[ 212 ]}

1300 a 1399

1300 = Suma de las primeras 4 quintas potencias, cero de la función de Mertens, mayor margen de victoria posible en una partida NAQT ; menor número hiperperfecto de factor par o impar
1301 = número cuadrado centrado, ^{[ 13 ]} primo de Honaker, ^{[ 213 ]} número de árboles con 13 nodos sin etiquetar ^{[ 214 ]}
1302 = cero de la función de Mertens, número de aristas en el triángulo hexagonal T(28) ^{[ 108 ]}
1303 = primo de la forma 21n+1 y 31n+1 ^{[ 215 ]}^{[ 216 ]}
1304 = suma de 1304 ₆ y 1304 ₉ , que es 328 + 976
1305 = número de cerilla triangular ^{[ 44 ]}
1306 = cero de la función de Mertens. En base 10 , elevar los dígitos de 1306 a potencias de enteros sucesivos es igual a sí mismo: 1306 = 1 ¹ + 3 ² + 0 ³ + 6 ⁴ . 135 , 175 , 518 y 598 también tienen esta propiedad. Número triangular centrado . ^{[ 111 ]}
1307 = primo seguro ^{[ 21 ]}
1308 = suma de la función totiente para los primeros 65 enteros
1309 = el primer número esfénico seguido de dos números consecutivos de este tipo.
1310 = el número más pequeño en el medio de un conjunto de tres números esfénicos
1311 = número de particiones enteras de 32 sin que ninguna parte divida a todas las demás ^{[ 217 ]}
1312 = miembro de la secuencia de Mian-Chowla; ^{[ 17 ]}
1313 = suma de todas las partes de todas las particiones de 14 ^{[ 218 ]}
1314 = número de particiones enteras de 41 cuyas partes distintas están conectadas ^{[ 219 ]}
1315 = 10^(2n+1)-7*10^n-1 es primo. ^{[ 220 ]}
1316 = Transformación de Euler de sigma(11) ^{[ 221 ]}
1317 = 1317 Único número impar de cuatro dígitos para dividir la concatenación de todos los números hasta sí mismo en base 25 ^{[ 222 ]}
1318 ⁵¹² + 1 es primo, ^{[ 223 ]} función de Mertens cero
1319 = primo seguro ^{[ 21 ]}
1320 = 659 + 661: suma de un par de primos gemelos ^{[ 177 ]}
1321 = primo de Friedlander-Iwaniec ^{[ 90 ]}
1322 = área del trapecio 21 unido ^{[ 153 ]}
1323 = Número de Aquiles
1324 = si D(n) es la n-ésima representación de 1, 2 dispuesta lexicográficamente. 1324 es el primer número distinto de 1 que es D(D(x)) ^{[ 224 ]}
1325 = número de Markov , ^{[ 225 ]} número tetraédrico centrado ^{[ 226 ]}
1326 = 51.º número triangular , ^{[ 26 ]} número hexagonal, ^{[ 25 ]} cero de la función de Mertens
1327 = primer número primo seguido de 33 números compuestos consecutivos
1328 = suma de la función totiente para los primeros 66 enteros
1329 = cero de la función de Mertens, suma de los primeros 41 números compuestos ^{[ 163 ]}
1330 = número tetraédrico, ^{[ 115 ]} forma un par Ruth-Aaron con 1331 bajo la segunda definición.
1331 = 11 ³ , número heptagonal centrado, ^{[ 64 ]} forma un par Ruth-Aaron con 1330 bajo la segunda definición. Este es el único cubo no trivial de la forma x ² + x − 1, para x = 36.
1332 = número prónico ^{[ 47 ]}
1333 = 37 ² - 37 + 1 = H ₃₇ (el 37º número de Hogben) ^{[ 149 ]}
1334 = número máximo de regiones en las que se divide el plano dibujando 37 círculos ^{[ 193 ]}
1335 = número pentagonal, ^{[ 67 ]} cero de la función de Mertens
1336 = suma de mcd(x, y) para 1 <= x, y <= 24, ^{[ 227 ]} cero de la función de Mertens
1337 = Usado en la forma novedosa de ortografía llamada leet . Punto de fusión aproximado del oro en kelvin .
1338 = número atómico del elemento noble del periodo 18, ^{[ 228 ]} función de Mertens cero
1339 = Primer número de 4 dígitos que aparece dos veces en la secuencia de suma de cubos de primos que dividen a n ^{[ 229 ]}
1340 = k tal que 5 × 2 ^k - 1 es primo ^{[ 230 ]}
1341 = Primer número de montaña con 2 saltos de más de uno.
1342 = $\sum _{k=1}^{40}\sigma (k)$ , ^{[ 152 ]} Función de Mertens cero
1343 = hexágono recortado ^{[ 231 ]}
1344 = 37² ^- 5² ^, la única forma de expresar 1344 como una diferencia de cuadrados primos ^{[ 232 ]}
1345 = k tal que k, k+1 y k+2 son productos de dos primos ^{[ 233 ]}
1346 = número de árboles enraizados disjuntos localmente con 10 nodos ^{[ 234 ]}
1347 = concatenación de los primeros 4 números de Lucas ^{[ 235 ]}
1348 = número de maneras de apilar 22 centavos de tal manera que cada centavo esté en una pila de uno o dos ^{[ 236 ]}
1349 = Número de Stern-Jacobsthal ^{[ 237 ]}
1350 = número nonagonal ^{[ 164 ]}
1351 = número de particiones de 28 en un número primo de partes ^{[ 97 ]}
1352 = número de puntos de superficie en un cubo con longitud de arista 16, ^{[ 18 ]} número de Aquiles
1353 = 2 × 26 ² + 1 = número de determinantes diferentes de 2 × 2 con entradas enteras de 0 a 26 ^{[ 186 ]}
1354 = 2 × 26 ² + 2 = número de puntos en la superficie del tetraedro con longitud de arista 26 ^{[ 126 ]}
1355 aparece por primera vez en la secuencia de Recamán en n = 325,374,625,245. ^{[ 238 ]} O dicho de otro modo, A057167(1355) = 325,374,625,245 ^{[ 239 ]}^{[ 240 ]}
1356 no es la suma de un par de primos gemelos ^{[ 241 ]}
1357 = número de soluciones no negativas para ^x² + ^y² ≤ ^41²^{[ 242 ]}
1358 = área superficial total redondeada de un tetraedro regular con longitud de arista 28 ^{[ 194 ]}
1359 es el término 42 del tamiz de Flavio Josefo ^{[ 243 ].}
1360 = 37² ^- 3² ^, la única forma de expresar 1360 como una diferencia de cuadrados primos ^{[ 232 ]}
1361 = primer primo después de una brecha de primos de 34, ^{[ 123 ]} número decagonal centrado , tercer primo de Mills , primo de Honaker ^{[ 213 ]}
1362 = número de particiones enteras aquirales de 48 ^{[ 244 ]}
1363 = el número de maneras de modificar una disposición circular de 14 objetos intercambiando uno o más pares adyacentes ^{[ 245 ]}
1364 = Número de Lucas ^{[ 246 ]}
1365 = número de pentatopo ^{[ 247 ]}
1366 = Número de Arima, en honor a Yoriyuki Arima, quien en 1769 construyó esta secuencia como el número de movimientos del anillo exterior en la solución óptima para el rompecabezas de los Anillos Chinos ^{[ 248 ].}
1367 = primo seguro, ^{[ 21 ]} primo equilibrado, 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), ^{[ 86 ]}
1368 = número de aristas en la unión de dos grafos cíclicos, ambos de orden 36 ^{[ 166 ]}
1369 = 37 ² , número octogonal centrado ^{[ 169 ]}
1370 = σ ₂ (37): suma de los cuadrados de los divisores de 37 ^{[ 249 ]}
1371 = suma de los primeros 28 números primos
1372 = Número de Aquiles
1373 = número de puntos de la red dentro de un círculo de radio 21 ^{[ 106 ]}
1374 = número de matrices unimodulares de 2 × 2 que tienen todos los términos en {0,1,...,23} ^{[ 99 ]}
1375 = número piramidal decagonal ^{[ 4 ]}
1376 = número abundante primitivo ( número abundante cuyos divisores propios son todos números deficientes ) ^{[ 250 ]}
1377 = número máximo de piezas que se pueden obtener cortando un anillo con 51 cortes ^{[ 104 ]}
1378 = 52º número triangular ^{[ 26 ]}
1379 = constante mágica del cuadrado mágico normal n × n y del problema de las n reinas para n = 14.
1380 = número de asignaciones de 8 pasos con 4 entradas ^{[ 251 ]}
1381 = número pentagonal centrado ^{[ 42 ]} cero de la función de Mertens
1382 = primer número tetrachi de 4 dígitos ^{[ 252 ]}
1383 = 3 × 461. 10 ¹³⁸³ + 7 es primo ^{[ 253 ]}
1384 = $\sum _{k=1}^{41}\sigma (k)$ ^{[ 152 ]}
1385 = número de subida/bajada ^{[ 254 ]}
1386 = número piramidal octogonal ^{[ 255 ]}
1387 = 5.º pseudoprimo de Fermat de base 2, ^{[ 256 ]} 22.º número hexagonal centrado y 19.º número decagonal , ^{[ 180 ]} segundo número de Super-Poulet . ^{[ 257 ]}
1388 = 4 × 19 ² - 3 × 19 + 1 y, por lo tanto, está en el eje x de la espiral de Ulams ^{[ 258 ]}
1389 = suma de los primeros 42 números compuestos ^{[ 163 ]}
1390 = suma de los primeros 43 no primos ^{[ 199 ]}
1391 = número de números racionales que se pueden construir a partir del conjunto de enteros entre 1 y 47 ^{[ 136 ]}
1392 = número de aristas en el triángulo hexagonal T(29) ^{[ 108 ]}
1393 = número de 7 Knödel ^{[ 116 ]}
1394 = suma de la función totiente para los primeros 67 enteros
1395 = número vampiro , ^{[ 192 ]} miembro de la secuencia Mian–Chowla ^{[ 17 ]} número de cerilla triangular ^{[ 44 ]}
1396 = número triangular centrado ^{[ 111 ]}
1397 = $\left\lfloor 5^{\frac {9}{2}}\right\rfloor$ ^{[ 259 ]}
1398 = número de particiones enteras de 40 cuyas partes distintas están conectadas ^{[ 219 ]}
1399 = emirp ^{[ 260 ]}

1400 a 1499

1400 = número de subconjuntos libres de suma de {1, ..., 15} ^{[ 261 ]}
1401 = número de molinillo ^{[ 85 ]}
1402 = número de particiones enteras de 48 cuyas diferencias aumentadas son distintas, ^{[ 262 ]} número de árboles con signo con 8 nodos ^{[ 263 ]}
1403 = el menor x tal que M(x) = 11, donde M() es la función de Mertens ^{[ 264 ]}
1404 = número heptagonal ^{[ 63 ]}
1405 = 26² ⁺ 27² ^, 7² ⁺ 8² ⁺ ... + 16² ^, número cuadrado centrado ^{[ 13 ]}
1406 = número prónico, ^{[ 47 ]} número semimeándrico ^{[ 265 ]}
1407 = 38 ² - 38 + 1 = H ₃₈ (el 38º número de Hogben) ^{[ 149 ]}
1408 = número máximo de regiones en las que se divide el plano dibujando 38 círculos ^{[ 193 ]}
1409 = superprimo , primo de Sophie Germain, ^{[ 12 ]} número más pequeño cuya octava potencia es la suma de 8 octavas potencias, primo de Proth ^{[ 125 ]}
1410 = denominador del 46º número de Bernoulli ^{[ 266 ]}
1411 = LS(41) ^{[ 267 ]}
1412 = LS(42), ^{[ 267 ]} número de espía
1413 = LS(43) ^{[ 267 ]}
1414 = compuesto más pequeño que, al sumarse a la suma de factores primos, alcanza un número primo después de 27 iteraciones ^{[ 268 ]}
1415 = el número de Mahon: T(8, 8) ^{[ 174 ]}
1416 = LS(46) ^{[ 267 ]}
1417 = número de particiones de 32 en las que el número de partes divide a 32 ^{[ 269 ]}
1418 = el menor x tal que M(x) = 13, donde M() es la función de Mertens ^{[ 264 ]}
1419 = Número de Zeisel ^{[ 270 ]}
1420 = Número de particiones de 56 en partes primas.
1421 = dimensión máxima de los espacios euclidianos que bastan para que toda variedad riemanniana compacta y lisa de 29 dimensiones sea realizable como una subvariedad, ^{[ 271 ]} número de espía
1422 = número de particiones de 15 con dos partes marcadas ^{[ 272 ]}
1423 = 200 + 1223 y el primo número 200 es 1223; 1423 también es primo ^{[ 273 ]}
1424 = número de soluciones no negativas para ^x² + ^y² ≤ ^42²^{[ 242 ]}
1425 = número autodescriptivo en base 5
1426 = suma de la función totiente para los primeros 68 enteros, número pentagonal, ^{[ 67 ]} número de particiones estrictas de 42 ^{[ 95 ]}
1427 = primo gemelo junto con 1429 ^{[ 274 ]}
1428 = número de árboles ternarios completos con 6 nodos internos o 18 aristas; ^{[ 275 ]} los primeros 4 dígitos del decimal periódico para 1/7 ( 0,142857 )
1429 = número de particiones de 53 tales que la parte más pequeña es mayor o igual que el número de partes ^{[ 212 ]}
1430 = número catalán ^{[ 276 ]}
1431 = 53.º número triangular , ^{[ 26 ]} número hexagonal ^{[ 25 ]}
1432 = miembro de la secuencia de Padova ^{[ 69 ]}
1433 = superprimo , primo de Honaker, ^{[ 213 ]} puerto típico utilizado para conexiones remotas a bases de datos de Microsoft SQL Server
1434 = volumen redondeado de un tetraedro regular con longitud de arista 23 ^{[ 277 ]}
1435 = número vampiro ; ^{[ 192 ]} el ancho de vía estándar en milímetros, equivalente a 4 pies 8 + 1 ⁄ 2 pulgadas (1,435 m)
1436 = discriminante de un campo cúbico totalmente real ^{[ 278 ]}
1437 = número más pequeño de complejidad 20: número más pequeño que requiere 20 1 para construir usando +, * y ^ ^{[ 279 ]}
1438 = k tal que 5 × 2 ^k - 1 es primo ^{[ 230 ]}
1439 = primo de Sophie Germain, ^{[ 12 ]} primo seguro ^{[ 21 ]}
1440 = un número altamente totiente , ^{[ 124 ]} un número compuesto en gran medida ^{[ 68 ]} y un número 481-gonal . También, el número de minutos en un día, el tamaño en kibibytes (unidades de 1024 bytes) de un disquete estándar de 3 + 1/2 y la resolución horizontal de las pantallas de computadora WXGA(II) .
1441 = número de estrella ^{[ 80 ]}
1442 = número de partes en todas las particiones de 31 en partes distintas ^{[ 41 ]}
1443 = la suma del segundo trío de primos permutables de tres dígitos en decimal : 337 , 373 y 733. También el número de aristas en la unión de dos grafos cíclicos, ambos de orden 37 ^{[ 166 ]}
1444 = 38² ^, el número pandigital más pequeño en números romanos.
1445 = $\sum _{k=0}^{3}\left({\binom {3}{k}}\times {\binom {3+k}{k}}\right)^{2}$ ^{[ 280 ]}
1446 = número de puntos en la superficie de un octaedro con longitud de arista 19 ^{[ 130 ]}
1447 = superprimo , número feliz
1448 = número k tal que phi(primo(k)) es un cuadrado ^{[ 281 ]}
1449 = Número de Stella octangula
1450 = σ ₂ (34): suma de cuadrados de divisores de 34 ^{[ 249 ]}
1451 = Sophie Germain prima ^{[ 12 ]}
1452 = primer índice de Zagreb del grafo completo K ₁₂^{[ 282 ]}
1453 = Prime sexy con 1459
1454 = 3 × 22 ² + 2 = número de puntos en la superficie de una pirámide cuadrada de lado 22 ^{[ 283 ]}
1455 = k tal que la media geométrica de phi(k) y sigma(k) es un número entero ^{[ 284 ]}
1456 = número de regiones en un polígono regular de 15 lados con todas las diagonales trazadas ^{[ 285 ]}
1457 = 2 × 27 ² − 1 = un cuadrado gemelo ^{[ 286 ]}
1458 = determinante máximo de una matriz de 11 por 11 de ceros y unos,número 3-suave (2×3 ⁶ )
1459 = Primo sexy con 1453, suma de nueve primos consecutivos (139 + 149 + 151 + 157 + 163 + 167 + 173 + 179 + 181), primo de Pierpont
1460 = El número de años que tendrían que transcurrir en el calendario juliano para acumular un año completo de días bisiestos.
1461 = número de particiones de 38 en partes de potencias primas ^{[ 196 ]}
1462 = (35 - 1) × (35 + 8) = el primer índice de Zagreb del grafo de rueda con 35 vértices ^{[ 287 ]}
1463 = número total de partes en todas las particiones de 16 ^{[ 60 ]}
1464 = área superficial total redondeada de un icosaedro regular con longitud de arista 13 ^{[ 288 ]}
1465 = 5- Número de Knödel ^{[ 119 ]}
1466 = $\sum _{k=1}^{256}d(k)$ , dónde $d(k)$ = número de divisores de $k$ ^{[ 289 ]}
1467 = número de particiones de 39 con manivela cero ^{[ 290 ]}
1468 = número de polihexágonos con 11 celdas que recubren el plano mediante traslación ^{[ 291 ]}
1469 = número octaédrico, ^{[ 127 ]} número altamente cototiente ^{[ 40 ]}
1470 = número piramidal pentagonal , ^{[ 292 ]} suma de la función totiente para los primeros 69 enteros
1471 = superprimo , número heptagonal centrado ^{[ 64 ]}
1472 = número de sobreparticiones de 15 ^{[ 293 ]}
1473 = hexágono recortado ^{[ 231 ]}
1474 = ${\frac {44(44+1)}{2}}+{\frac {44^{2}}{4}}$ : número triangular más cuarto de cuadrado (es decir, A000217(44) + A002620(44)) ^{[ 294 ]}
1475 = número de particiones de 33 en partes, cada una de las cuales se utiliza un número diferente de veces ^{[ 295 ]}
1476 = número perfecto central ^{[ 296 ]}
1477 = número de 7 Knödel ^{[ 116 ]}
1478 = número total de partes más grandes en todas las composiciones de 11 ^{[ 297 ]}
1479 = número de particiones planas de 12 ^{[ 298 ]}
1480 = suma de los primeros 29 números primos
1481 = Sophie Germain prima ^{[ 12 ]}
1482 = número prónico, ^{[ 47 ]} número de composiciones unimodales de 15 donde la parte máxima aparece una vez ^{[ 299 ]}
1483 = 39 ² - 39 + 1 = H ₃₉ (el 39º número de Hogben) ^{[ 149 ]}
1484 = número máximo de regiones en las que se divide el plano dibujando 39 círculos ^{[ 193 ]}
1485 = 54º número triangular ^{[ 26 ]}
1486 = número de particiones sólidas estrictas de 19 ^{[ 83 ]}
1487 = primo seguro ^{[ 21 ]}
1488 = número triangular de cerilla, ^{[ 44 ]} comúnmente utilizado como símbolo de odio
1489 = número triangular centrado ^{[ 111 ]}
1490 = número de tetranacci ^{[ 300 ]}
1491 = número nonagonal, ^{[ 164 ]} cero de la función de Mertens
1492 = discriminante de un campo cúbico totalmente real, ^{[ 278 ]} cero de la función de Mertens
1493 = primo de Stern ^{[ 146 ]}
1494 = suma de la función totiente para los primeros 70 enteros
1495 = 9### ^{[ 301 ]}
1496 = número piramidal cuadrado ^{[ 16 ]}
1497 = número skiponacci ^{[ 107 ]}
1498 = número de particiones planas de 41 ^{[ 302 ]}
1499 = Sophie Germain prima, ^{[ 12 ]} superprima

1500 a 1599

1500 = hipotenusa en tres triángulos pitagóricos diferentes ^{[ 303 ]}
1501 = número pentagonal centrado ^{[ 42 ]}
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 ^{[ 304 ]}
1503 = menor número de triángulos de la Espiral de Teodoro para completar 12 revoluciones ^{[ 197 ]}
1504 = número abundante primitivo ( número abundante cuyos divisores propios son todos números deficientes ) ^{[ 250 ]}
1505 = número de particiones enteras de 41 con diferencias distintas entre partes sucesivas ^{[ 305 ]}
1506 = número de particiones de Golomb de 28 ^{[ 306 ]}
1507 = número de particiones de 32 que no contienen 1 como parte ^{[ 31 ]}
1508 = número piramidal heptagonal ^{[ 135 ]}
1509 = número de molinillo ^{[ 85 ]}
1510 = número deficiente , número odioso
1511 = primo de Sophie Germain, ^{[ 12 ]} primo equilibrado ^{[ 86 ]}
1512 = k tal que la media geométrica de phi(k) y sigma(k) es un número entero ^{[ 284 ]}
1513 = número cuadrado centrado ^{[ 13 ]}
1514 = suma de los primeros 44 números compuestos ^{[ 163 ]}
1515 = dimensión máxima de los espacios euclidianos que son suficientes para que toda variedad riemanniana compacta y lisa de 30 dimensiones sea realizable como una subvariedad ^{[ 271 ]}
1516 = $\left\lfloor 9^{\frac {10}{3}}\right\rfloor$ ^{[ 307 ]}
1517 = número de puntos de la red dentro de un círculo de radio 22 ^{[ 106 ]}
1518 = suma de los primeros 32 semiprimos, ^{[ 308 ]} cero de la función de Mertens
1519 = número de polihexaedros con 8 celdas, ^{[ 309 ]} cero de la función de Mertens
1520 = número pentagonal, ^{[ 67 ]} 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, ^{[ 169 ]} forma un par Ruth-Aaron con 1520 bajo la segunda definición
1522 = k tal que 5 × 2 ^k - 1 es primo ^{[ 230 ]}
1523 = superprimo , cero de la función de Mertens, primo seguro, ^{[ 21 ]} miembro de la secuencia de Mian-Chowla ^{[ 17 ]}
1524 = cero de la función de Mertens, k tal que la media geométrica de phi(k) y sigma(k) es un número entero ^{[ 284 ]}
1525 = número heptagonal, ^{[ 63 ]} cero de la función de Mertens
1526 = número de clases de conjugación en el grupo alternante A ₂₇^{[ 310 ]}
1527 = número de particiones bidimensionales de 11, ^{[ 311 ]} función de Mertens cero
1528 = cero de la función de Mertens, área superficial total redondeada de un octaedro regular con longitud de arista 21 ^{[ 312 ]}
1529 = número compuesto de Polignac ^{[ 159 ]}
1530 = número de vampiro ^{[ 192 ]}
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, ^{[ 313 ]} función de Mertens cero
1533 = 21 × 73 = 21 × 21.º primo ^{[ 200 ]}
1534 = número de particiones enteras aquirales de 50 ^{[ 244 ]}
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 ^{[ 314 ]}
1537 = Número de Keith, ^{[ 87 ]} Cero de la función de Mertens
1538 = número de puntos de superficie en un cubo con longitud de arista 17 ^{[ 18 ]}
1539 = número máximo de piezas que se pueden obtener cortando un anillo con 54 cortes ^{[ 104 ]}
1540 = 55º número triangular , ^{[ 26 ]} número hexagonal, ^{[ 25 ]} número decagonal, ^{[ 180 ]} número tetraédrico ^{[ 115 ]}
1541 = número octogonal ^{[ 132 ]}
1542 = k tal que 2^k comienza con k ^{[ 315 ]}
1543 = primo que divide todas las secuencias de Fibonacci, ^{[ 316 ]} función de Mertens cero
1544 = cero de la función de Mertens, número de particiones de particiones enteras de 17 donde todas las partes tienen la misma longitud ^{[ 317 ]}
1545 = número de estructuras de cuerda reversibles con 9 cuentas que utilizan exactamente tres colores diferentes ^{[ 318 ]}
1546 = número de matrices binarias de 5 x 5 con como máximo un 1 en cada fila y columna, ^{[ 319 ]} cero de la función de Mertens
1547 = número piramidal hexagonal
1548 = número perfecto central ^{[ 296 ]}
1549 = prima de Polignac ^{[ 320 ]}
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 ^{[ 321 ]}
1551 = 6920 - 5369 = A169952(24) - A169952(23) = A169942(24) = número de reglas de Golomb de longitud 24 ^{[ 322 ]}^{[ 323 ]}
1552 = Número de particiones de 57 en partes primas.
1553 = 509 + 521 + 523 = un primo que es la suma de tres primos consecutivos ^{[ 324 ]}
1554 = 2 × 3 × 7 × 37 = producto de cuatro primos distintos ^{[ 325 ]}
1555 ² divide 6 ¹⁵⁵⁴^{[ 326 ]}
1556 = suma de los cuadrados de los primeros nueve números primos
1557 = número de grafos con 8 nodos y 13 aristas ^{[ 327 ]}
1558 = número k tal que k ⁶⁴ + 1 es primo
1559 = Sophie Germain prima ^{[ 12 ]}
1560 = número prónico ^{[ 47 ]}
1561 = un número octaédrico centrado , ^{[ 131 ]} número de árboles reducidos en serie con 19 nodos ^{[ 328 ]}
1562 = número máximo de regiones en las que se divide el plano dibujando 40 círculos ^{[ 193 ]}
1563 = $\sum _{k=1}^{50}{\frac {50}{\gcd(50,k)}}$ ^{[ 329 ]}
1564 = suma de la función totiente para los primeros 71 enteros
1565 = ${\sqrt {1036^{2}+1173^{2}}}$ y $1036+1173=47^{2}$ ^{[ 330 ]}
1566 = número k tal que k ⁶⁴ + 1 es primo
1567 = número de particiones de 24 con al menos una parte distinta ^{[ 187 ]}
1568 = Número de Aquiles ^{[ 331 ]}
1569 = 2 × 28 ² + 1 = número de determinantes diferentes de 2 × 2 con entradas enteras de 0 a 28 ^{[ 186 ]}
1570 = 2 × 28 ² + 2 = número de puntos en la superficie del tetraedro con longitud de arista 28 ^{[ 126 ]}
1571 = Honaker primo ^{[ 213 ]}
1572 = miembro de la secuencia Mian–Chowla ^{[ 17 ]}
1573 = discriminante de un campo cúbico totalmente real ^{[ 278 ]}
1574 ²⁵⁶ + 1 es primo ^{[ 332 ]}
1575 = número impar abundante , ^{[ 333 ]} suma de los números no triangulares entre números triangulares sucesivos , número de particiones de 24 ^{[ 189 ]}
1576 ¹⁴ == 1 (mod 15^2) ^{[ 334 ]}
1577 = suma de los residuos cuadráticos de 83 ^{[ 335 ]}
1578 = suma de los primeros 45 números compuestos ^{[ 163 ]}
1579 = número de particiones de 54 tales que la parte más pequeña es mayor o igual que el número de partes ^{[ 212 ]}
1580 = número de particiones enteras aquirales de 51 ^{[ 244 ]}
1581 = número de aristas en el triángulo hexagonal T(31) ^{[ 108 ]}
1582 = un número tal que el triángulo entero [A070080(1582), A070081(1582), A070082(1582)] tiene un área entera ^{[ 336 ]}
1583 = Sophie Germain primo
1584 = número de cerilla triangular ^{[ 44 ]}
1585 = número de Riordan , número triangular centrado ^{[ 111 ]}
1586 = área del trapecio 23 unido ^{[ 153 ]}
1587 = 3 × 23 ² = número de aristas de un grafo tripartito completo de orden 69, K _23,23,23^{[ 337 ]}
1588 = suma de la función totiente para los primeros 72 enteros
1589 = número compuesto de Polignac ^{[ 159 ]}
1590 = volumen redondeado de un icosaedro regular con longitud de arista 9 ^{[ 338 ]}
1591 = volumen redondeado de un octaedro regular con longitud de arista 15 ^{[ 211 ]}
1592 = suma de todos los divisores de los primeros 36 números impares ^{[ 339 ]}
1593 = suma de los primeros 30 números primos
1594 = costo mínimo de altura máxima del árbol Huffman de tamaño 17 ^{[ 340 ]}
1595 = número de sistemas de conjuntos no isomorfos de peso 10
1596 = 56º número triangular ^{[ 26 ]}
1597 = primo de Fibonacci , ^{[ 341 ]} primo de Markov , ^{[ 225 ]} superprimo , emirp
1598 = número de matrices unimodulares de 2 × 2 que tienen todos los términos en {0,1,...,25} ^{[ 99 ]}
1599 = número de aristas en la unión de dos grafos cíclicos, ambos de orden 39 ^{[ 166 ]}

1600 a 1699

1600 = 40 ² , gran número rombicosidodecaédrico estructurado, ^{[ 342 ]} dígito repetitivo en base 7 (4444 ₇ ), número de calle en la Avenida Pennsylvania de la Casa Blanca , longitud en metros de un evento común de atletismo de la escuela secundaria, puntuación perfecta en el SAT (excepto de 2005 a 2015)
1601 = Sophie Germain prime, Proth prime, ^{[ 125 ]} la novela 1601 (Mark Twain)
1602 = número de puntos en la superficie de un octaedro con longitud de arista 20 ^{[ 130 ]}
1603 = número de particiones de 27 con rango no negativo ^{[ 343 ]}
1604 = número de composiciones de 22 en partes primas ^{[ 344 ]}
1605 = número de poliominós que constan de 7 octágonos regulares ^{[ 345 ]}
1606 = número piramidal eneagonal ^{[ 346 ]}
1607 = miembro de la terna prima con 1609 y 1613 ^{[ 347 ]}
1608 = $\sum _{k=1}^{44}\sigma (k)$ ^{[ 152 ]}
1609 = número hexagonal recortado ^{[ 231 ]}
1610 = número de particiones estrictas de 43 ^{[ 95 ]}
1611 = número de números racionales que se pueden construir a partir del conjunto de enteros entre 1 y 51 ^{[ 136 ]}
1612 = dimensión máxima de los espacios euclidianos que son suficientes para que toda variedad riemanniana compacta y lisa de 31 dimensiones sea realizable como una subvariedad ^{[ 271 ]}
1613 , 1607 y 1619 son todos primos ^{[ 348 ]}
1614 = número de maneras de refinar la partición 8^1 para obtener 1^8 ^{[ 349 ]}
1615 = número compuesto tal que la media cuadrática de sus factores primos es un entero no primo ^{[ 350 ]}
1616 = ${\frac {16(16^{2}+3\times 16-1)}{3}}$ = número de ternas monótonas (x,y,z) en {1,2,...,16} ³^{[ 351 ]}
1617 = número pentagonal ^{[ 67 ]}
1618 = número heptagonal centrado ^{[ 64 ]}
1619 = primo palíndromo en binario , primo seguro ^{[ 21 ]}
1620 = 809 + 811: suma de un par de primos gemelos ^{[ 177 ]}
1621 = superprimo , número de molinillo ^{[ 85 ]}
1622 = semiprimo de la forma primo + 1 ^{[ 352 ]}
1623 no es la suma de dos números triangulares y una cuarta potencia ^{[ 353 ]}
1624 = número de cuadrados en el diamante azteca de orden 28 ^{[ 354 ]}
1625 = número cuadrado centrado ^{[ 13 ]}
1626 = número pentagonal centrado ^{[ 42 ]}
1627 = primo y 2 × 1627 - 1 = 3253 también es primo ^{[ 355 ]}
1628 = número pentagonal centrado ^{[ 42 ]}
1629 = volumen redondeado de un tetraedro regular con longitud de arista 24 ^{[ 277 ]}
1630 = número k tal que k^64 + 1 es primo
1631 = $\sum _{k=0}^{5}(k+1)!{\binom {5}{k}}$ ^{[ 356 ]}
1632 = número de triángulos agudos formados a partir de los vértices de un polígono regular de 18 lados ^{[ 357 ]}
1633 = número de estrella ^{[ 80 ]}
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 entero ^{[ 358 ]}
1636 = número de soluciones no negativas para ^x² + ^y² ≤ ^45²^{[ 242 ]}
1637 = isla prima: el primo más pequeño cuyos primos adyacentes están separados exactamente 30 ^{[ 359 ]}
1638 = divisor armónico , ^{[ 360 ]} 5 × 2 ¹⁶³⁸ - 1 es primo ^{[ 230 ]}
1639 = número nonagonal ^{[ 164 ]}
1640 = número prónico ^{[ 47 ]}
1641 = 41 ² - 41 + 1 = H ₄₁ (el 41.º número de Hogben) ^{[ 149 ]}
1642 = número máximo de regiones en las que se divide el plano dibujando 41 círculos ^{[ 193 ]}
1643 = suma de los primeros 46 números compuestos ^{[ 163 ]}
1644 = 821 + 823: suma de un par de primos gemelos ^{[ 177 ]}
1645 = número de pseudo bodegones de 16 celdas en El juego de la vida de Conway, hasta rotación y reflexión ^{[ 361 ]}
1646 = número de grafos con 8 nodos y 14 aristas ^{[ 327 ]}
1647 y 1648 son ambos divisibles por cubos ^{[ 362 ].}
1648 = número de particiones de 34 ³ en cubos distintos ^{[ 363 ]}
1649 = número altamente cototiente, ^{[ 40 ]} número de Leyland ^{[ 102 ]} usando 4 y 5 (4 ⁵ + 5 ⁴ )
1650 = número de cartas para construir un castillo de naipes de 33 niveles ^{[ 148 ]}
1651 = número heptagonal ^{[ 63 ]}
1652 = número de particiones de 29 en un número primo de partes ^{[ 97 ]}
1653 = 57º número triangular , ^{[ 26 ]} número hexagonal, ^{[ 25 ]} número de puntos de la red dentro de un círculo de radio 23 ^{[ 106 ]}
1654 = número de particiones de 42 en divisores de 42 ^{[ 364 ]}
1655 = volumen redondeado de un dodecaedro regular con longitud de arista 6 ^{[ 365 ]}
1656 = 827 + 829: suma de un par de primos gemelos ^{[ 177 ]}
1657 = primo cubano , ^{[ 366 ]} primo de la forma 2p-1
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 ^{[ 268 ]}
1659 = número de números racionales que se pueden construir a partir del conjunto de enteros entre 1 y 52 ^{[ 136 ]}
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 ^{[ 93 ]}
1662 = número de particiones de 49 en partes relativamente primas por pares ^{[ 145 ]}
1663 = un número primo y 5 ¹⁶⁶³ - 4 ¹⁶⁶³ es un número primo de 1163 dígitos ^{[ 367 ]}
1664 = k tal que k, k+1 y k+2 son sumas de 2 cuadrados ^{[ 368 ]}
1665 = número tetraédrico centrado ^{[ 226 ]}
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 ^{[ 273 ]}
1668 = número de particiones de 33 en partes todas relativamente primas a 33 ^{[ 369 ]}
1669 = superprimo , primo más pequeño con una diferencia de exactamente 24 con respecto al siguiente primo ^{[ 370 ].}
1670 = número de composiciones de 12 tales que al menos dos partes adyacentes son iguales ^{[ 371 ]}
1671 divide la suma de los primeros 1671 números compuestos ^{[ 372 ]}
1672 = 41 ² - 3 ² , la única forma de expresar 1672 como una diferencia de cuadrados primos ^{[ 232 ]}
1673 = Número RMS ^{[ 373 ]}
1674 = k tal que la media geométrica de phi(k) y sigma(k) es un número entero ^{[ 284 ]}
1675 = Número de parentesco ^{[ 374 ]}
1676 = número de particiones de 34 en partes, cada una de las cuales se utiliza un número diferente de veces ^{[ 295 ]}
1677 = 41 ² - 2 ² , la única forma de expresar 1677 como una diferencia de cuadrados primos ^{[ 232 ]}
1678 = n tal que n ³² + 1 es primo ^{[ 117 ]}
1679 = número altamente cototiente, ^{[ 40 ]} semiprimo (23 × 73, véase también el mensaje de Arecibo ), número de partes en todas las particiones de 32 en partes distintas ^{[ 41 ]}
1680 = el 17º número altamente compuesto , ^{[ 191 ]} número de aristas en la unión de dos grafos cíclicos, ambos de orden 40 ^{[ 166 ]}
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 ^{[ 169 ]}
1682 = y 1683 es un miembro de un par Ruth-Aarón (primera definición)
1683 = número de cerilla triangular ^{[ 44 ]}
1684 = número triangular centrado ^{[ 111 ]}
1685 = 5- Número de Knödel ^{[ 119 ]}
1686 = $\sum _{k=1}^{45}\sigma (k)$ ^{[ 152 ]}
1687 = número de 7 Knödel ^{[ 116 ]}
1688 = número de conjuntos conexos finitos de enteros positivos mayores que uno con mínimo común múltiplo 72 ^{[ 375 ]}
1689 = $9!!\sum _{k=0}^{4}{\frac {1}{2k+1}}$ ^{[ 376 ]}
1690 = número de composiciones de 14 en potencias de 2 ^{[ 377 ]}
1691 = lo mismo al revés, lo que lo convierte en un número estrobogramático ^{[ 378 ]}
1692 = número perfecto central ^{[ 296 ]}
1693 = primo más pequeño > 41 ² . ^{[ 133 ]}
1694 = número de matrices unimodulares de 2 × 2 que tienen todos los términos en {0,1,...,26} ^{[ 99 ]}
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
1697 = primo de Friedlander-Iwaniec ^{[ 90 ]}
1698 = número de árboles enraizados con 47 vértices en los que los vértices del mismo nivel tienen el mismo grado ^{[ 195 ]}
1699 = número de árboles enraizados con 48 vértices en los que los vértices del mismo nivel tienen el mismo grado ^{[ 195 ]}

1700 a 1799

1700 = σ ₂ (39): suma de los cuadrados de los divisores de 39 ^{[ 249 ]}
1701 = $\left\{{8 \atop 4}\right\}$ , número decagonal, número de casco del USS Enterprise en Star Trek
1702 = palíndromo en 3 bases consecutivas: 898 ₁₄ , 787 ₁₅ , 6A6 ₁₆
1703 = 1703131131 / 1000077 y los divisores de 1703 son 1703, 131, 13 y 1 ^{[ 379 ]}
1704 = suma de los cuadrados de las partes en las particiones de 18 en dos partes distintas ^{[ 380 ]}
1705 = número de tribonacci ^{[ 381 ]}
1706 = 1 + 4 + 16 + 64 + 256 + 1024 + 256 + 64 + 16 + 4 + 1 suma de la quinta fila del triángulo de potencias de 4 ^{[ 382 ]}
1707 = número de particiones de 30 en las que el número de partes divide a 30 ^{[ 269 ]}
1708 = 2 ² × 7 × 61 un número cuyo producto de índices primos 1 × 1 × 4 × 18 es divisible por la suma de sus factores primos 2 + 2 + 7 + 61 ^{[ 383 ]}
1709 = primero de una secuencia de ocho primos formados al agregar 57 en el medio. 1709, 175709, 17575709, 1757575709, 175757575709, 17575757575709, 1757575757575709 y 175757575757575709 son todos primos, pero 17575757575757575709 = 232433 × 75616446785773
1710 = número máximo de piezas que se pueden obtener cortando un anillo con 57 cortes ^{[ 104 ]}
1711 = 58.º número triangular , ^{[ 26 ]} número decagonal centrado
1712 = número de conjuntos irredundantes en el grafo de la fiesta de 29 cócteles ^{[ 201 ]}
1713 = número de árboles enraizados aperiódicos con 12 nodos ^{[ 384 ]}
1714 = número de regiones formadas al trazar los segmentos de línea que conectan cualesquiera dos de los 18 puntos del perímetro de una cuadrícula de cuadrados de 3 × 6 ^{[ 385 ]}
1715 = k tal que la media geométrica de phi(k) y sigma(k) es un número entero ^{[ 284 ]}
1716 = 857 + 859: suma de un par de primos gemelos, ^{[ 177 ]} un coeficiente binomial , igual a ${\tbinom {13}{6}}$ .
1717 = número pentagonal ^{[ 67 ]}
1718 = $\sum _{d|12}{\binom {12}{d}}$ ^{[ 386 ]}
1719 = número compuesto de Polignac ^{[ 159 ]}
1720 = suma de los primeros 31 números primos
1721 = primo gemelo; número de cuadrados entre ^42² y ^42⁴ . ^{[ 101 ]}
1722 = número de Giuga , ^{[ 387 ]} número pronico ^{[ 47 ]}
1723 = superprimo
1724 = número máximo de regiones en las que se divide el plano dibujando 42 círculos ^{[ 193 ]}
1725 = 47² ^- 22² ⁼ (primo(15)) ^² - (no primo(15)) ^²^{[ 388 ]}
1726 = número de particiones de 44 en partes distintas y relativamente primas ^{[ 389 ]}
1727 = área del trapecio 24 unido ^{[ 153 ]}
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 ^{[ 283 ]}
1731 = k tal que la media geométrica de phi(k) y sigma(k) es un número entero ^{[ 284 ]}
1732 = $\sum _{k=0}^{5}{\binom {5}{k}}^{k}$ ^{[ 390 ]}
1733 = Sophie Germain primo , palíndromo en bases 3, 18, 19.
1734 = área de superficie de un cubo de longitud de arista 17 ^{[ 391 ]}
1735 = número de particiones de 55 tales que la parte más pequeña es mayor o igual que el número de partes ^{[ 212 ]}
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 ^{[ 18 ]}
1737 = número de molinillo ^{[ 85 ]}
1738 = número de particiones enteras aquirales de 52 ^{[ 244 ]}
1739 = número de 1s en todas las particiones de 30 en partes impares ^{[ 392 ]}
1740 = número de cuadrados en el diamante azteca de orden 29 ^{[ 354 ]}
1741 = superprimo , número cuadrado centrado ^{[ 13 ]}
1742 = número de regiones en las que se divide el plano mediante 30 elipses ^{[ 88 ]}
1743 = índice de Wiener del grafo del molino de viento D(3,21) ^{[ 114 ]}
1744 = k tal que k, k+1 y k+2 son sumas de 2 cuadrados ^{[ 368 ]}
1745 = 5- Número de Knödel ^{[ 119 ]}
1746 = número de grafos de distancia unitaria en 8 nodos ^{[ 393 ]}
1747 = primo equilibrado ^{[ 86 ]}
1748 = número de particiones de 55 en partes distintas en las que el número de partes divide a 55 ^{[ 394 ]}
1749 = número de particiones enteras de 33 sin que ninguna parte divida a todas las demás ^{[ 217 ]}
1750 = hipotenusa en tres triángulos pitagóricos diferentes ^{[ 303 ]}
1751 = hexágono recortado ^{[ 231 ]}
1752 = 79² ^- 67² ^, la única forma de expresar 1752 como una diferencia de cuadrados primos ^{[ 232 ]}
1753 = primo equilibrado ^{[ 86 ]}
1754 = k tal que 5*2 ^k - 1 es primo ^{[ 230 ]}
1755 = número de particiones enteras de 50 cuyas diferencias aumentadas son distintas ^{[ 262 ]}
1756 = número pentagonal centrado ^{[ 42 ]}
1757 = menor número de triángulos de la Espiral de Teodoro para completar 13 revoluciones ^{[ 197 ]}
1758 = $\sum _{k=1}^{46}\sigma (k)$ ^{[ 152 ]}
1759 = prima de Polignac ^{[ 320 ]}
1760 = el número de yardas en una milla
1761 = k tal que k, k+1 y k+2 son productos de dos primos ^{[ 233 ]}
1762 = número de secuencias binarias de longitud 12 y número de rizado 2 ^{[ 395 ]}
1763 = número de aristas en la unión de dos grafos cíclicos, ambos de orden 41 ^{[ 166 ]}
1764 = 42 ²
1765 = número de pilas o particiones planas de 15 ^{[ 396 ]}
1766 = número de puntos en la superficie de un octaedro con longitud de arista 21 ^{[ 130 ]}
1767 = σ(28 ² ) = σ(35 ² ) ^{[ 397 ]}
1768 = número de disecciones no equivalentes de un hendecágono en 8 polígonos mediante diagonales que no se intersecan hasta la rotación ^{[ 398 ]}
1769 = número máximo de piezas que se pueden obtener cortando un anillo con 58 cortes ^{[ 104 ]}
1770 = 59.º número triangular , ^{[ 26 ]} número hexagonal, ^{[ 25 ]} Diecisiete Setenta , ciudad en Australia
1771 = número tetraédrico ^{[ 115 ]}
1772 = número heptagonal centrado, ^{[ 64 ]} suma de la función totiente para los primeros 76 enteros
1773 = number of words of length 5 over the alphabet {1,2,3,4,5} such that no two even numbers appear consecutively^[399]
1774 = number of rooted identity trees with 15 nodes and 5 leaves^[400]
1775 = $\sum _{1\leq i\leq 10}prime(i)\cdot (2\cdot i-1)$ : sum of piles of first 10 primes^[401]
1776 = 24th square star number.^[402] The number of pieces that could be seen in a 7 × 7 × 7× 7 Rubik's Tesseract.
1777 = smallest prime > 42².^[133]
1778 = least k >= 1 such that the remainder when 6^k is divided by k is 22^[403]
1779 = number of achiral integer partitions of 53^[244]
1780 = number of lattice paths from (0, 0) to (7, 7) using E (1, 0) and N (0, 1) as steps that horizontally cross the diagonal y = x with even many times^[404]
1781 = the first 1781 digits of e form a prime^[405]
1782 = heptagonal number^[63]
1783 = de Polignac prime^[320]
1784 = number of subsets of {1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12} such that every pair of distinct elements has a different quotient^[406]
1785 = square pyramidal number,^[16] triangular matchstick number^[44]
1786 = centered triangular number^[111]
1787 = super-prime, sum of eleven consecutive primes (137 + 139 + 149 + 151 + 157 + 163 + 167 + 173 + 179 + 181 + 191)
1788 = Euler transform of -1, -2, ..., -34^[407]
1789 = number of wiggly sums adding to 17 (terms alternately increase and decrease or vice versa)^[408]
1790 = number of partitions of 50 into pairwise relatively prime parts^[145]
1791 = largest natural number that cannot be expressed as a sum of at most four hexagonal numbers.
1792 = Granville number
1793 = number of lattice points inside a circle of radius 24^[106]
1794 = nonagonal number,^[164] number of partitions of 33 that do not contain 1 as a part^[31]
1795 = number of heptagons with perimeter 38^[409]
1796 = k such that geometric mean of phi(k) and sigma(k) is an integer^[284]
1797 = number k such that phi(prime(k)) is a square^[281]
1798 = 2 × 29 × 31 = 10₂ × 11101₂ × 11111₂, which yield zero when the prime factors are xored together^[410]
1799 = 2 × 30² − 1 = a twin square^[286]

1800 to 1899

1800 = pentagonal pyramidal number,^[292]Achilles number, also, in da Ponte's Don Giovanni, the number of women Don Giovanni had slept with so far when confronted by Donna Elvira, according to Leporello's tally
1801 = cuban prime, sum of five and nine consecutive primes (349 + 353 + 359 + 367 + 373 and 179 + 181 + 191 + 193 + 197 + 199 + 211 + 223 + 227)^[366]
1802 = 2 × 30² + 2 = number of points on surface of tetrahedron with edge length 30,^[126] number of partitions of 30 such that the number of odd parts is a part^[157]
1803 = number of decahexes that tile the plane isohedrally but not by translation or by 180-degree rotation (Conway criterion)^[411]
1804 = number k such that k^64 + 1 is prime
1805 = number of squares between 43² and 43⁴.^[101]
1806 = pronic number,^[47] product of first four terms of Sylvester's sequence, primary pseudoperfect number,^[412] only number for which n equals the denominator of the nth Bernoulli number,^[413]Schröder number^[414]
1807 = fifth term of Sylvester's sequence^[415]
1808 = maximal number of regions the plane is divided into by drawing 43 circles^[193]
1809 = sum of first 17 super-primes^[416]
1810 = $\sum _{k=0}^{4}{\binom {4}{k}}^{4}$ ^[417]
1811 = Sophie Germain prime
1812 = n such that n³² + 1 is prime^[117]
1813 = number of polyominoes with 26 cells, symmetric about two orthogonal axes^[418]
1814 = 1 + 6 + 36 + 216 + 1296 + 216 + 36 + 6 + 1 = sum of 4th row of triangle of powers of six^[419]
1815 = polygonal chain number $\#(P_{2,1}^{3})$ ^[420]
1816 = number of strict partions of 44^[95]
1817 = total number of prime parts in all partitions of 20^[421]
1818 = n such that n³² + 1 is prime^[117]
1819 = sum of the first 32 primes, minus 32^[422]
1820 = pentagonal number,^[67] pentatope number,^[247] number of compositions of 13 whose run-lengths are either weakly increasing or weakly decreasing^[423]
1821 = member of the Mian–Chowla sequence^[17]
1822 = number of integer partitions of 43 whose distinct parts are connected^[219]
1823 = super-prime, safe prime^[21]
1824 = 43² - 5², the only way to express 1824 as a difference of prime squares^[232]
1825 = octagonal number^[132]
1826 = decagonal pyramidal number^[4]
1827 = vampire number^[192]
1828 = meandric number, open meandric number, appears twice in the first 10 decimal digits of e
1829 = composite de Polignac number^[159]
1830 = 60th triangular number^[26]
1831 = smallest prime with a gap of exactly 16 to next prime (1847)^[424]
1832 = sum of totient function for first 77 integers
1833 = number of atoms in a decahedron with 13 shells^[425]
1834 = octahedral number,^[127] sum of the cubes of the first five primes
1835 = absolute value of numerator of $D_{6}^{(5)}$ ^[426]
1836 = factor by which a proton is more massive than an electron
1837 = star number^[80]
1838 = number of unimodular 2 × 2 matrices having all terms in {0,1,...,27}^[99]
1839 = $\lfloor {\sqrt[{3}]{13!}}\rfloor$ ^[427]
1840 = 43² - 3², the only way to express 1840 as a difference of prime squares^[232]
1841 = solution to the postage stamp problem with 3 denominations and 29 stamps,^[428] Mertens function zero
1842 = number of unlabeled rooted trees with 11 nodes^[429]
1843 = k such that phi(k) is a perfect cube,^[430] Mertens function zero
1844 = 3⁷ - 7³,^[431] Mertens function zero
1845 = number of partitions of 25 containing at least one prime,^[432] Mertens function zero
1846 = sum of first 49 composite numbers^[163]
1847 = super-prime
1848 = number of edges in the join of two cycle graphs, both of order 42^[166]
1849 = 43², palindromic in base 6 (= 12321₆), centered octagonal number^[169]
1850 = Number of partitions of 59 into prime parts
1851 = sum of the first 32 primes
1852 = number of quantales on 5 elements, up to isomorphism^[433]
1853 = sum of primitive roots of 27-th prime,^[434] Mertens function zero
1854 = number of permutations of 7 elements with no fixed points,^[435] Mertens function zero
1855 = rencontres number: number of permutations of [7] with exactly one fixed point^[436]
1856 = sum of totient function for first 78 integers
1857 = Mertens function zero, pinwheel number^[85]
1858 = number of 14-carbon alkanes C₁₄H₃₀ ignoring stereoisomers^[437]
1859 = composite de Polignac number^[159]
1860 = number of squares in the Aztec diamond of order 30^[438]
1861 = centered square number,^[13] Mertens function zero
1862 = Mertens function zero, forms a Ruth–Aaron pair with 1863 under second definition
1863 = Mertens function zero, forms a Ruth–Aaron pair with 1862 under second definition
1864 = Mertens function zero, ${\frac {1864!-2}{2}}$ is a prime^[439]
1865 = 12345₆: Largest senary metadrome (number with digits in strict ascending order in base 6)^[440]
1866 = Mertens function zero, number of plane partitions of 16 with at most two rows^[441]
1867 = prime de Polignac number^[320]
1868 = smallest number of complexity 21: smallest number requiring 21 1's to build using +, * and ^^[279]
1869 = Hultman number: S_H(7, 4)^[442]
1870 = decagonal number^[180]
1871 = the first prime of the 2 consecutive twin prime pairs: (1871, 1873) and (1877, 1879)^[443]
1872 = first Zagreb index of the complete graph K₁₃^[282]
1873 = number of Narayana's cows and calves after 21 years^[202]
1874 = area of the 25th conjoined trapezoid^[153]
1875 = 50² - 25²
1876 = number k such that k^64 + 1 is prime
1877 = number of partitions of 39 where 39 divides the product of the parts^[444]
1878 = n such that n³² + 1 is prime^[117]
1879 = a prime with square index^[445]
1880 = the 10th element of the self convolution of Lucas numbers^[446]
1881 = tricapped prism number^[447]
1882 = number of linearly separable Boolean functions in 4 variables^[448]
1883 = number of conjugacy classes in the alternating group A₂₈^[310]
1884 = k such that 5*2^k - 1 is prime^[230]
1885 = Zeisel number^[270]
1886 = number of partitions of 6⁴ into fourth powers^[449]
1887 = number of edges in the hexagonal triangle T(34)^[108]
1888 = primitive abundant number (abundant number all of whose proper divisors are deficient numbers)^[250]
1889 = Sophie Germain prime, highly cototient number^[40]
1890 = triangular matchstick number^[44]
1891 = 61st triangular number,^[26] sum of 5 consecutive primes ( $367 + 373 + 379 + 383 + 389$ ) hexagonal number,^[25] centered pentagonal number,^[42]centered triangular number^[111]
1892 = pronic number^[47]
1893 = 44² - 44 + 1 = H₄₄ (the 44th Hogben number)^[149]
1894 = maximal number of regions the plane is divided into by drawing 44 circles^[193]
1895 = Stern-Jacobsthal number^[237]
1896 = member of the Mian-Chowla sequence^[17]
1897 = member of Padovan sequence,^[69] number of triangle-free graphs on 9 vertices^[450]
1898 = smallest multiple of n whose digits sum to 26^[451]
1899 = cropped hexagone^[231]

1900 to 1999

1900 = number of primes <= 2¹⁴^[22]
1901 = Sophie Germain prime, centered decagonal number
1902 = number of symmetric plane partitions of 27^[452]
1903 = generalized Catalan number^[453]
1904 = number of flat partitions of 43^[302]
1905 = Fermat pseudoprime^[454]
1906 = number n such that 3ⁿ - 8 is prime^[455]
1907 = safe prime,^[21] balanced prime^[86]
1908 = coreful perfect number^[296]
1909 = hyperperfect number^[456]
1910 = number of compositions of 13 having exactly one fixed point^[457]
1911 = heptagonal pyramidal number^[135]
1912 = size of 6th maximum raising after one blind in pot-limit poker^[458]
1913 = super-prime, Honaker prime^[213]
1914 = number of bipartite partitions of 12 white objects and 3 black ones^[459]
1915 = number of nonisomorphic semigroups of order 5^[460]
1916 = sum of first 50 composite numbers^[163]
1917 = number of partitions of 51 into pairwise relatively prime parts^[145]
1918 = heptagonal number^[63]
1919 = smallest number with reciprocal of period length 36 in base 10^[461]
1920 = sum of the nontriangular numbers between successive triangular numbers 120 and 136,
1921 = 4-dimensional centered cube number^[462]
1922 = Area of a square with diagonal 62^[185]
1923 = 2 × 31² + 1 = number of different 2 X 2 determinants with integer entries from 0 to 31^[186]
1924 = 2 × 31² + 2 = number of points on surface of tetrahedron with edge length 31,^[126] sum of the first 36 semiprimes^[463]
1925 = number of ways to write 24 as an orderless product of orderless sums^[96]
1926 = pentagonal number^[67]
1927 = 2¹¹ - 11²^[464]
1928 = number of distinct values taken by 2^2^...^2 (with 13 2's and parentheses inserted in all possible ways)^[465]
1929 = Mertens function zero, number of integer partitions of 42 whose distinct parts are connected^[219]
1930 = number of pairs of consecutive integers x, x+1 such that all prime factors of both x and x+1 are at most 53^[304]
1931 = Sophie Germain prime
1932 = number of partitions of 40 into prime power parts^[196]
1933 = centered heptagonal number,^[64] Honaker prime^[213]
1934 = sum of totient function for first 79 integers
1935 = number of edges in the join of two cycle graphs, both of order 43^[166]
1936 = 44², 18-gonal number,^[466] 324-gonal number.
1937 = number of chiral n-ominoes in 12-space, one cell labeled^[467]
1938 = Mertens function zero, number of points on surface of octahedron with edge length 22^[130]
1939 = 7-Knödel number^[116]
1940 = the Mahonian number: T(8, 9)^[174]
1941 = maximal number of regions obtained by joining 16 points around a circle by straight lines^[468]
1942 = number k for which 10k + 1, 10k + 3, 10k + 7, 10k + 9 and 10k + 13 are primes^[469]
1943 = largest number not the sum of distinct tetradecagonal numbers^[470]
1944 = 3-smooth number (2³×3⁵), Achilles number^[331]
1945 = number of partitions of 25 into relatively prime parts such that multiplicities of parts are also relatively prime^[471]
1946 = number of surface points on a cube with edge-length 19^[18]
1947 = k such that 5·2^k + 1 is a prime factor of a Fermat number 2^{2^m} + 1 for some m^[472]
1948 = number of strict solid partitions of 20^[83]
1949 = smallest prime > 44².^[133]
1950 = $1\cdot 2\cdot 3+4\cdot 5\cdot 6+7\cdot 8\cdot 9+10\cdot 11\cdot 12$ ,^[473] largest number not the sum of distinct pentadecagonal numbers^[470]
1951 = cuban prime^[366]
1952 = number of covers of {1, 2, 3, 4}^[474]
1953 = hexagonal prism number,^[475] 62nd triangular number^[26]
1954 = number of sum-free subsets of {1, ..., 16}^[261]
1955 = number of partitions of 25 with at least one distinct part^[187]
1956 = nonagonal number^[164]
1957 = $\sum _{k=0}^{6}{\frac {6!}{k!}}$ = total number of ordered k-tuples (k=0,1,2,3,4,5,6) of distinct elements from an 6-element set^[476]
1958 = number of partitions of 25^[189]
1959 = Heptanacci-Lucas number^[477]
1960 = number of parts in all partitions of 33 into distinct parts^[41]
1961 = number of lattice points inside a circle of radius 25^[106]
1962 = number of edges in the join of the complete graph K₃₆ and the cycle graph C₃₆^[478]
1963! - 1 is prime^[479]
1964 = number of linear forests of planted planar trees with 8 nodes^[480]
1965 = total number of parts in all partitions of 17^[60]
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^[481]
σ(1968) = σ(1967) + σ(1966)^[482]
1969 = Only value less than four million for which a "mod-ification" of the standard Ackermann Function does not stabilize^[483]
1970 = number of compositions of two types of 9 having no even parts^[484]
1971 = $3^{7}-6^{3}$ ^[485]
1972 = n such that ${\frac {n^{37}-1}{n-1}}$ is prime^[486]
1973 = Sophie Germain prime, Leonardo prime
1974 = number of binary vectors of length 17 containing no singletons^[165]
1975 = number of partitions of 28 with nonnegative rank^[343]
1976 = octagonal number^[132]
1977 = number of non-isomorphic multiset partitions of weight 9 with no singletons^[487]
1978 = n such that n | (3ⁿ + 5)^[488]
1979 = number of squares between 45² and 45⁴,^[101] smallest number that is the sum of 4 positive cubes in at least 4 ways^[489]
1980 = pronic number,^[47] highly abundant number with a greater sum of proper divisors than all smaller numbers^[490]
1981 = pinwheel number,^[85] central polygonal number^[27]
1982 = maximal number of regions the plane is divided into by drawing 45 circles,^[193] a number with the property that 3¹⁹⁸² - 1982 is prime^[491]
1983 = skiponacci number^[107]
1984 = 11111000000 in binary, nonunitary perfect number,^[492] see also: 1984 (disambiguation)
1985 = centered square number^[13]
1986 = number of ways to write 25 as an orderless product of orderless sums^[96]
1987 = 300th prime number
1988 = sum of the first 33 primes,^[493] sum of the first 51 composite numbers^[494]
1989 = number of balanced primes less than 100,000,^[495] number of 9-step mappings with 4 inputs^[251]
1990 = Stella octangula number
1991 = 11 × 181, the 46th Gullwing number,^[496] palindromic composite number with only palindromic prime factors^[497]
1992 = number of nonisomorphic sets of nonempty subsets of a 4-set^[498]
1993 = a number with the property that 4¹⁹⁹³ - 3¹⁹⁹³ is prime,^[499] number of partitions of 30 into a prime number of parts^[97]
1994 = Glaisher's function W(37)^[500]
1995 = number of unlabeled graphs on 9 vertices with independence number 6^[501]
1996 = a number with the property that (1996! + 3)/3 is prime^[502]
1997 = $\sum _{k=1}^{21}{k\cdot \phi (k)}$ ^[503]
1998 = triangular matchstick number^[44]
1999 = centered triangular number,^[111] number of regular forms in a myriagram.

Prime numbers

There are 135 prime numbers between 1000 and 2000:^[504]^[505]

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.
1 2 3Sloane, N. J. A. (ed.). "SequenceA007585(10-gonal (or decagonal) pyramidal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2Sloane, N. J. A. (ed.). "SequenceA003352(Numbers that are the sum of 7 positive 5th powers)". 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.
↑Sloane, N. J. A. (ed.). "SequenceA061341(A061341 Numbers not ending in 0 whose cubes are concatenations of other cubes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA003353(Numbers that are the sum of 8 positive 5th powers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA034262(a(n) = n^3 + n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
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.
↑Sloane, N. J. A. (ed.). "SequenceA000325(a(n) = 2^n - n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA006002(a(n) = n*(n+1)^2/2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2 3 4Sloane, N. J. A. (ed.). "SequenceA000330(Square pyramidal 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 3 4 5 6Sloane, N. J. A. (ed.). "SequenceA005897(6*n^2 + 2 for n > 0)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA316729(Generalized 30-gonal (or triacontagonal) numbers: m*(14*m - 13) with m = 0, +1, -1, +2, -2, +3, -3)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA006313(Numbers n such that n^16 + 1 is prime)". 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.
↑Sloane, N. J. A. (ed.). "SequenceA004801(Sum of 12 positive 9th powers)". 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.
1 2 3Sloane, 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.). "SequenceA161328(E-toothpick sequence (see Comments lines for definition))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA023036(Smallest positive even integer that is an unordered sum of two primes in exactly n ways)". 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 3 4Sloane, 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.
1 2Sloane, N. J. A. (ed.). "SequenceA000695(Moser-de Bruijn sequence: sums of distinct powers of 4)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA003356(Numbers that are the sum of 11 positive 5th powers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2Sloane, N. J. A. (ed.). "SequenceA003357(Numbers that are the sum of 12 positive 5th powers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA036301(Numbers whose sum of even digits and sum of odd digits are equal)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, 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.). "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.
↑Sloane, N. J. A. (ed.). "SequenceA073576(Number of partitions of n into squarefree parts)". 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 5Sloane, 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 7 8 9Sloane, N. J. A. (ed.). "SequenceA005891(Centered pentagonal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA003365(Numbers that are the sum of 9 positive 6th powers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2 3 4 5 6 7 8 9 10 11Sloane, 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.). "SequenceA005448(Centered triangular numbers: a(n) = 3*n*(n-1)/2 + 1)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA003368(Numbers that are the sum of 12 positive 6th powers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2 3 4 5 6 7 8 9 10 11 12 13Sloane, 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.). "SequenceA002061(Central polygonal numbers: a(n) = n^2 - n + 1)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA003349(Numbers that are the sum of 4 positive 5th powers)". 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.
1 2 3Sloane, N. J. A. (ed.). "SequenceA035137(Numbers that are not the sum of 2 palindromes (where 0 is considered a palindrome))". 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.
↑Sloane, N. J. A. (ed.). "SequenceA003325(Numbers that are the sum of 2 positive cubes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA195162(Generalized 12-gonal numbers: k*(5*k-4) for k = 0, +-1, +-2, ...)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA006532(Numbers whose sum of divisors is a square)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA341450(Number of strict integer partitions of n that are empty or have smallest part not dividing all the others)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2 3Sloane, 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.
1 2Sloane, N. J. A. (ed.). "SequenceA006567(Emirps (primes whose reversal is a different prime))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2Sloane, N. J. A. (ed.). "SequenceA003354(Numbers that are the sum of 9 positive 5th powers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2 3 4 5 6 7 8Sloane, 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.
1 2 3 4 5 6 7Sloane, N. J. A. (ed.). "SequenceA069099(Centered heptagonal numbers)". 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.). "SequenceA077043("Three-quarter squares": a(n) = n^2 - A002620(n))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA000607(Number of partitions of n into prime parts)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA056107(Third spoke of a hexagonal spiral)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA025147(Number of partitions of n into distinct parts >= 2)". 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.
↑Sloane, N. J. A. (ed.). "SequenceA033996(8 times triangular numbers: a(n) = 4*n*(n+1))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA018900(Sums of two distinct powers of 2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA003350(Numbers that are the sum of 5 positive 5th powers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Wells, D. The Penguin Dictionary of Curious and Interesting Numbers London: Penguin Group. (1987): 163
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.
↑Sloane, N. J. A. (ed.). "SequenceA003355(Numbers that are the sum of 10 positive 5th powers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA051682(11-gonal (or hendecagonal) numbers: a(n) = n*(9*n-7)/2)". 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.
↑Sloane, N. J. A. (ed.). "SequenceA087188(number of partitions of n into distinct squarefree parts)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2 3 4 5 6 7 8 9Sloane, N. J. A. (ed.). "SequenceA059993(Pinwheel numbers: 2*n^2 + 6*n + 1)". 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.
1 2 3Sloane, N. J. A. (ed.). "SequenceA051890(2*(n^2 - n + 1))". 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.
1 2 3Sloane, N. J. A. (ed.). "SequenceA028916(Friedlander-Iwaniec primes: Primes of form a^2 + b^4)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA057732(Numbers k such that 2^k + 3 is prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑"A002275 - OEIS". oeis.org. Retrieved 8 March 2024.
1 2Sloane, 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.
↑Sloane, N. J. A. (ed.). "SequenceA128455(Numbers k such that 9^k - 2 is a prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2 3 4 5Sloane, 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 2 3 4Sloane, 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.
1 2Sloane, N. J. A. (ed.). "SequenceA006748(Number of diagonally symmetric polyominoes with n cells)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2 3 4 5Sloane, 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 2 3 4 5Sloane, N. J. A. (ed.). "SequenceA028387(n + (n+1)^2)". 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.
1 2 3Sloane, N. J. A. (ed.). "SequenceA001608(Perrin sequence)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2 3 4 5 6Sloane, 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.
1 2 3 4 5Sloane, 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.
↑Sloane, N. J. A. (ed.). "SequenceA006094(Products of 2 successive primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA046368(Products of two palindromic primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑"1150 (number)". The encyclopedia of numbers.
1 2"Sloane's A000101 : Increasing gaps between primes (upper end)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 10 July 2016.
1 2"Sloane's A097942 : Highly totient numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.
1 2 3 4"Sloane's A080076 : Proth primes". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.
1 2 3 4 5 6Sloane, 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 3 4 5Sloane, 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.
1 2 3 4Sloane, N. J. A. (ed.). "SequenceA007491(Smallest prime > n^2)". 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.
1 2 3Sloane, N. J. A. (ed.). "SequenceA002413(Heptagonal (or 7-gonal) pyramidal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2 3 4Sloane, N. J. A. (ed.). "SequenceA018805". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA024816(Antisigma(n): Sum of the numbers less than n that do not divide n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑"A063776 - OEIS". oeis.org.
↑"A000256 - OEIS". oeis.org.
↑"1179 (number)". The encyclopedia of numbers.
↑"A000339 - OEIS". oeis.org.
↑"A271269 - OEIS". oeis.org.
↑"A000031 - OEIS". oeis.org.
↑Higgins, Peter (2008). Number Story: From Counting to Cryptography. New York: Copernicus. p. 61. ISBN 978-1-84800-000-1.
1 2 3 4 5Sloane, N. J. A. (ed.). "SequenceA051424(Number of partitions of n into pairwise relatively prime parts)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2"Sloane's A042978 : Stern primes". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.
↑"A121038 - OEIS". oeis.org.
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 2 3 4 5 6Sloane, 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.
↑oeis.org/A062092
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 5Sloane, 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
↑"A265070 - OEIS". oeis.org.
↑"1204 (number)". The encyclopedia of numbers.
1 2Sloane, 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.
↑"A303815 - OEIS". oeis.org.
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 2 3 4 5 6 7 8 9Sloane, 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 8 9Sloane, 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 5"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.
↑"A061262 - OEIS". oeis.org.
1 2 3Sloane, 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.
↑"A000045 - OEIS". oeis.org.
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.
↑"Sloane's A005898 : Centered cube numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.
1 2 3 4"Sloane's A001107 : 10-gonal (or decagonal) 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
↑"A007690 - OEIS". oeis.org.
↑"Sloane's A033819 : Trimorphic numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.
1 2Sloane, N. J. A. (ed.). "SequenceA001105(a(n) = 2*n^2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
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.). "SequenceA144300(Number of partitions of n minus number of divisors of n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA000837(Number of partitions of n into relatively prime parts. Also aperiodic partitions.)". 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 2Sloane, N. J. A. (ed.). "SequenceA193757(Numbers which can be written with their digits in order and using only a plus and a squaring operator)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2"Sloane's A002182 : Highly composite numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.
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 3 4 5 6 7 8 9 10Sloane, N. J. A. (ed.). "SequenceA014206(n^2 + n + 2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2Sloane, N. J. A. (ed.). "SequenceA070169(Rounded total surface area of a regular tetrahedron with edge length n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
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.). "SequenceA023894(Number of partitions of n into prime power parts)". 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.
↑Sloane, N. J. A. (ed.). "SequenceA100040(2*n^2 + n - 5)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2Sloane, N. J. A. (ed.). "SequenceA051349(Sum of first n nonprimes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2Sloane, N. J. A. (ed.). "SequenceA033286(n * prime(n))". 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.). "SequenceA006958(Number of parallelogram polyominoes with n cells (also called staircase polyominoes, although that term is overused))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "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.
↑Sloane, N. J. A. (ed.). "SequenceA014574(Average of twin prime pairs)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA173831(Largest prime < n^4)". 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.
↑Sloane, N. J. A. (ed.). "SequenceA014285(Sum_{1..n} j*prime(j))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2Sloane, N. J. A. (ed.). "SequenceA071400(Rounded volume of a regular octahedron with edge length n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2 3 4Sloane, N. J. A. (ed.). "SequenceA003114(Number of partitions of n into parts 5k+1 or 5k+4)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2 3 4 5 6Sloane, 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.
↑Sloane, N. J. A. (ed.). "SequenceA000055(Number of trees with n unlabeled nodes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑"A124826 - OEIS". oeis.org.
↑"A142005 - OEIS". oeis.org.
1 2Sloane, 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.
↑"A066186 - OEIS". oeis.org.
1 2 3 4Sloane, 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.
↑"A115073 - OEIS". oeis.org.
↑"A061256 - OEIS". oeis.org.
↑"A061954 - OEIS". oeis.org.
↑Sloane, N. J. A. (ed.). "SequenceA057465(Numbers k such that k^512 + 1 is prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑"A030299 - 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.
↑Sloane, N. J. A. (ed.). "SequenceA018806(Sum of gcd(x, y))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA018227(Magic numbers: atoms with full shells containing any of these numbers of electrons are considered electronically stable)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑"A005064 - OEIS". oeis.org.
1 2 3 4 5 6Sloane, N. J. A. (ed.). "SequenceA001770(Numbers k such that 5*2^k - 1 is prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2 3 4 5Sloane, N. J. A. (ed.). "SequenceA144391(3*n^2 + n - 1)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2 3 4 5 6 7Sloane, 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.
1 2Sloane, N. J. A. (ed.). "SequenceA056809(Numbers k such that k, k+1 and k+2 are products of two primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑"A316473 - OEIS". oeis.org.
↑"A000032 - OEIS". oeis.org.
↑"1348 (number)". The encyclopedia of numbers.
1 2Sloane, N. J. A. (ed.). "SequenceA101624(Stern-Jacobsthal number)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA064228(From Recamán's sequence (A005132): values of n achieving records in A057167)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA057167(Term in Recamán's sequence A005132 where n appears for first time, or -1 if n never appears)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA064227(From Recamán's sequence (A005132): record values in A057167)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA007534(Even numbers that are not the sum of a pair of twin primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2 3Sloane, N. J. A. (ed.). "SequenceA000603". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA000960(Flavius Josephus's sieve: Start with the natural numbers; at the k-th sieving step, remove every (k+1)-st term of the sequence remaining after the (k-1)-st sieving step; iterate)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2 3 4 5Sloane, N. J. A. (ed.). "SequenceA330224(Number of achiral integer partitions of n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑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.
↑Sloane, N. J. A. (ed.). "SequenceA005578(Arima sequence)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2 3Sloane, N. J. A. (ed.). "SequenceA001157(sigma_2(n): sum of squares of divisors of n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2 3Sloane, 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.). "SequenceA005945(Number of n-step mappings with 4 inputs)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑"A001631 - OEIS". oeis.org. Retrieved 25 June 2023.
↑Sloane, N. J. A. (ed.). "SequenceA088274(Numbers k such that 10^k + 7 is prime)". 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, N. J. A. (ed.). "SequenceA002414(Octagonal pyramidal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑"Sloane's A001567 : Fermat pseudoprimes to base 2". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.
↑"Sloane's A050217 : Super-Poulet numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.
↑Sloane, N. J. A. (ed.). "SequenceA054552(4*n^2 - 3*n + 1)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA017919(Powers of sqrt(5) rounded down)". 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.). "SequenceA007865(Number of sum-free subsets of {1, ..., n})". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2Sloane, 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.). "SequenceA000060(Number of signed trees with n nodes)". 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.
1 2 3 4Sloane, N. J. A. (ed.). "SequenceA045918(Describe n. Also called the "Say What You See" or "Look and Say" sequence LS(n))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2Sloane, 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.
1 2Sloane, N. J. A. (ed.). "SequenceA067538(Number of partitions of n in which the number of parts divides n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2"Sloane's A051015 : Zeisel numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.
1 2 3Sloane, N. J. A. (ed.). "SequenceA059845(n*(3*n + 11)/2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA000097(Number of partitions of n if there are two kinds of 1's and two kinds of 2's)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2Sloane, 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.). "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 2Sloane, N. J. A. (ed.). "SequenceA071399(Rounded volume of a regular tetrahedron with edge length n)". 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.
↑Sloane, N. J. A. (ed.). "SequenceA005259(Apery (Apéry) numbers: Sum_0^n (binomial(n,k)*binomial(n+k,k))^2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2Sloane, N. J. A. (ed.). "SequenceA062325(Numbers k for which phi(prime(k)) is a square)". 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.
1 2Sloane, 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.
1 2 3 4 5 6 7Sloane, N. J. A. (ed.). "SequenceA011257(Geometric mean of phi(n) and sigma(n) is an integer)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA007678(Number of regions in regular n-gon with all diagonals drawn)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2Sloane, N. J. A. (ed.). "SequenceA056220(2*n^2 - 1)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA028569(n*(n + 9))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA071398(Rounded total surface area of a regular icosahedron with edge length n)". 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, N. J. A. (ed.). "SequenceA075207(Number of polyhexes with n cells that tile the plane by translation)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2"Sloane's A002411 : Pentagonal pyramidal numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.
↑Sloane, N. J. A. (ed.). "SequenceA015128(Number of overpartitions of n: an overpartition of n is an ordered sequence of nonincreasing integers that sum to n, where the first occurrence of each integer may be overlined)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA006578(Triangular numbers plus quarter squares: n*(n+1)/2 + floor(n^2/4) (i.e., A000217(n) + A002620(n)))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2Sloane, 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 2 3 4Sloane, N. J. A. (ed.). "SequenceA307958(Coreful perfect numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA097979(Total number of largest parts in all compositions of n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA000219(Number of planar partitions (or plane partitions) of n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA006330(Number of corners, or planar partitions of n with only one row and one column)". 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.
↑Sloane, N. J. A. (ed.). "SequenceA114411(Triple primorial n###)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2Sloane, N. J. A. (ed.). "SequenceA034296(Number of flat partitions of n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
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.). "SequenceA325325(Number of integer partitions of n with distinct differences between successive parts)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA325858(Number of Golomb partitions of n)". 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.). "SequenceA062198(Sum of first n semiprimes)". 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.). "SequenceA071396(Rounded total surface area of a regular octahedron with edge length n)". 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.). "SequenceA100129(Numbers k such that 2^k starts with k)". 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.). "SequenceA319066(Number of partitions of integer partitions of n where all parts have the same length)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA056327(Number of reversible string structures with n beads using exactly three different colors)". 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.
↑Sloane, N. J. A. (ed.). "SequenceA169942(Number of Golomb rulers of length n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA169952(Second entry in row n of triangle in A169950)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA034962(Primes that are the sum of three consecutive primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA046386(Products of four distinct primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA127106(Numbers n such that n^2 divides 6^n-1)". 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.). "SequenceA052486(Achilles numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA056995(Numbers k such that k^256 + 1 is prime)". 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.). "SequenceA056026(Numbers k such that k^14 is congruent with 1 (mod 15^2))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA076409(Sum of the quadratic residues of prime(n))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA070142(Numbers n such that [A070080(n), A070081(n), A070082(n)] is an integer triangle with integer area)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA033428(3*n^2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA071402(Rounded volume of a regular icosahedron with edge length n)". 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.
↑Sloane, N. J. A. (ed.). "SequenceA100145(Structured great rhombicosidodecahedral numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
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.). "SequenceA007584(9-gonal (or enneagonal) pyramidal numbers)". 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.
↑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.). "SequenceA005382(Primes p such that 2p-1 is also prime)". 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.). "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.
↑Sloane, N. J. A. (ed.). "SequenceA018818(Number of partitions of n into divisors of n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA071401(Rounded volume of a regular dodecahedron with edge length 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.). "SequenceA059802(Numbers k such that 5^k - 4^k is prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2Sloane, 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.). "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.
↑Sloane, N. J. A. (ed.). "SequenceA140480(RMS numbers: numbers n such that root mean square of divisors of n is an integer)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA023108(Positive integers which apparently never result in a palindrome under repeated applications of the function A056964(x))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑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.). "SequenceA224930(Numbers n such that n divides the concatenation of all divisors in descending order)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA294286(Sum of the squares of the parts in the partitions of n into two distinct parts)". 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.). "SequenceA331378(Numbers whose product of prime indices is divisible by their sum of prime factors)". 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.). "SequenceA331452(number of regions (or cells) formed by drawing the line segments connecting any two of the 2*(m+n) perimeter points of an m X n grid of squares)". 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.
↑"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.). "SequenceA167008(Sum_{0..n} C(n,k)^k)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA033581(6*n^2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA036469(Partial sums of A000009 (partitions into distinct parts))". 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.). "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.). "SequenceA065764(Sum of divisors of square numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA220881(Number of nonequivalent dissections of an n-gon into n-3 polygons by nonintersecting diagonals up to rotation)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA154964(3*a(n-1) + 6*a(n-2))". 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.). "SequenceA316322(Sum of piles of first n primes)". 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.). "SequenceA127816(least k such that the remainder when 6^k is divided by k is n)". 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.). "SequenceA025047(Alternating compositions, i.e., compositions with alternating increases and decreases, starting with either an increase or a decrease)". 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.). "SequenceA235488(Squarefree numbers which yield zero when their prime factors are xored together)". 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.). "SequenceA152927(Number of sets (in the Hausdorff metric geometry) at each location between two sets defining a polygonal configuration consisting of k 4-gonal polygonal components chained with string components of length 1 as k varies)". 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.). "SequenceA101301(The sum of the first n primes, minus 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.
↑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.). "SequenceA214083(floor(n!^(1/3)))". 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.). "SequenceA354493(Number of quantales on n elements, up to isomorphism)". 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.). "SequenceA082671(Numbers n such that (n!-2)/2 is a prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑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.). "SequenceA164652(Hultman numbers)". 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.). "SequenceA057568(Number of partitions of n where n divides the product of the parts)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA011757(prime(n^2))". 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.). "SequenceA002998(Smallest multiple of n whose digits sum to n)". 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, N. J. A. (ed.). "SequenceA217135(Numbers n such that 3^n - 8 is prime)". 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.). "SequenceA000412(Number of bipartite partitions of n white objects and 3 black ones)". 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.). "SequenceA008514(4-dimensional centered cube numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA062198(Sum of the first n semiprimes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA024012(2^n - n^2)". 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's A051870 : 18-gonal numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.
↑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.). "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.). "SequenceA104621(Heptanacci-Lucas numbers)". 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.). "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.). "SequenceA024069(6^n - n^7)". 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.). "SequenceA277288(Positive integers n such that n divides (3^n + 5))". 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.). "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.). "SequenceA187220(Gullwing sequence)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA046351(Palindromic composite numbers with only palindromic prime factors)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA000612(Number of P-equivalence classes of switching functions of n or fewer variables, divided by 2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑(sequence A059801 in the OEIS)
↑ Sloane, N. J. A. (ed.). "Secuencia A002470 (función W(n) de Glaisher)" . La enciclopedia en línea de secuencias de enteros . Fundación 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 A089085 (Números k tales que (k! + 3)/3 es primo)" . La enciclopedia en línea de secuencias de enteros . 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.

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

[auto9-5] 1 2Sloane, N. J. A. (ed.). "SequenceA003352(Numbers that are the sum of 7 positive 5th powers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

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

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

[8] Sloane, N. J. A. (ed.). "SequenceA061341(A061341 Numbers not ending in 0 whose cubes are concatenations of other cubes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[9] Sloane, N. J. A. (ed.). "SequenceA003353(Numbers that are the sum of 8 positive 5th powers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[10] Sloane, N. J. A. (ed.). "SequenceA034262(a(n) = n^3 + n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[A020473-11] 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-12] 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-13] 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.

[14] Sloane, N. J. A. (ed.). "SequenceA000325(a(n) = 2^n - n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

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

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

[Mian-Chowla-17] 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-18] 1 2 3 4 5 6Sloane, N. J. A. (ed.). "SequenceA005897(6*n^2 + 2 for n > 0)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[19] Sloane, N. J. A. (ed.). "SequenceA316729(Generalized 30-gonal (or triacontagonal) numbers: m*(14*m - 13) with m = 0, +1, -1, +2, -2, +3, -3)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

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

[Safe_primes-21] 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-22] 1 2Sloane, N. J. A. (ed.). "SequenceA007053(Number of primes <= 2^n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

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

[24] Sloane, N. J. A. (ed.). "SequenceA004801(Sum of 12 positive 9th powers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[Hexagonal_number-25] 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-26] 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.

[auto11-27] 1 2 3Sloane, 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.

[28] Sloane, N. J. A. (ed.). "SequenceA161328(E-toothpick sequence (see Comments lines for definition))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[29] Sloane, N. J. A. (ed.). "SequenceA023036(Smallest positive even integer that is an unordered sum of two primes in exactly n ways)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[30] 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-31] 1 2 3 4Sloane, 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.

[auto6-32] 1 2Sloane, N. J. A. (ed.). "SequenceA000695(Moser-de Bruijn sequence: sums of distinct powers of 4)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[33] Sloane, N. J. A. (ed.). "SequenceA003356(Numbers that are the sum of 11 positive 5th powers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[auto-34] 1 2Sloane, N. J. A. (ed.). "SequenceA003357(Numbers that are the sum of 12 positive 5th powers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[35] Sloane, N. J. A. (ed.). "SequenceA036301(Numbers whose sum of even digits and sum of odd digits are equal)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

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

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

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

[39] Sloane, N. J. A. (ed.). "SequenceA073576(Number of partitions of n into squarefree parts)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[highly_cototient-40] 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.

[auto46-41] 1 2 3 4 5Sloane, 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.

[Centered_pentagonal-42] 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.

[43] Sloane, N. J. A. (ed.). "SequenceA003365(Numbers that are the sum of 9 positive 6th powers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[auto5-44] 1 2 3 4 5 6 7 8 9 10 11Sloane, 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.

[45] Sloane, N. J. A. (ed.). "SequenceA005448(Centered triangular numbers: a(n) = 3*n*(n-1)/2 + 1)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[46] Sloane, N. J. A. (ed.). "SequenceA003368(Numbers that are the sum of 12 positive 6th powers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

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

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

[49] Sloane, N. J. A. (ed.). "SequenceA003349(Numbers that are the sum of 4 positive 5th powers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

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

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

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

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

[auto10-54] 1 2 3Sloane, N. J. A. (ed.). "SequenceA035137(Numbers that are not the sum of 2 palindromes (where 0 is considered a palindrome))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

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

[56] Sloane, N. J. A. (ed.). "SequenceA003325(Numbers that are the sum of 2 positive cubes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[57] Sloane, N. J. A. (ed.). "SequenceA195162(Generalized 12-gonal numbers: k*(5*k-4) for k = 0, +-1, +-2, ...)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[58] Sloane, N. J. A. (ed.). "SequenceA006532(Numbers whose sum of divisors is a square)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[59] Sloane, N. J. A. (ed.). "SequenceA341450(Number of strict integer partitions of n that are empty or have smallest part not dividing all the others)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[auto16-60] 1 2 3Sloane, 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.

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

[auto2-62] 1 2Sloane, N. J. A. (ed.). "SequenceA003354(Numbers that are the sum of 9 positive 5th powers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[heptagonal_number-63] 1 2 3 4 5 6 7 8Sloane, 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.

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

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

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

[Pentagonal_number-67] 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-68] 1 2Sloane, N. J. A. (ed.). "SequenceA067128(Ramanujan's largely composite numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

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

[70] Sloane, N. J. A. (ed.). "SequenceA077043("Three-quarter squares": a(n) = n^2 - A002620(n))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

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

[72] Sloane, N. J. A. (ed.). "SequenceA056107(Third spoke of a hexagonal spiral)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[73] Sloane, N. J. A. (ed.). "SequenceA025147(Number of partitions of n into distinct parts >= 2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

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

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

[76] Sloane, N. J. A. (ed.). "SequenceA033996(8 times triangular numbers: a(n) = 4*n*(n+1))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[77] Sloane, N. J. A. (ed.). "SequenceA018900(Sums of two distinct powers of 2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[78] Sloane, N. J. A. (ed.). "SequenceA003350(Numbers that are the sum of 5 positive 5th powers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[79] Wells, D. The Penguin Dictionary of Curious and Interesting Numbers London: Penguin Group. (1987): 163

[Centered_12-gonal_numbers-80] 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.

[81] Sloane, N. J. A. (ed.). "SequenceA003355(Numbers that are the sum of 10 positive 5th powers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[82] Sloane, N. J. A. (ed.). "SequenceA051682(11-gonal (or hendecagonal) numbers: a(n) = n*(9*n-7)/2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

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

[84] Sloane, N. J. A. (ed.). "SequenceA087188(number of partitions of n into distinct squarefree parts)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

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

[Balanced_prime-86] 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-87] 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.

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

[89] 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-90] 1 2 3Sloane, N. J. A. (ed.). "SequenceA028916(Friedlander-Iwaniec primes: Primes of form a^2 + b^4)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

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

[92] "A002275 - OEIS". oeis.org. Retrieved 8 March 2024.

[auto29-93] 1 2Sloane, 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.

[94] Sloane, N. J. A. (ed.). "SequenceA128455(Numbers k such that 9^k - 2 is a prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[auto20-95] 1 2 3 4 5Sloane, 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-96] 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.

[auto70-97] 1 2 3 4Sloane, 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.

[auto23-98] 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-99] 1 2 3 4 5Sloane, 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.

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

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

[A076980-102] 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.

[103] 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-104] 1 2 3 4 5 6Sloane, N. J. A. (ed.). "SequenceA000096(n*(n+3)/2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[105] 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-106] 1 2 3 4 5 6 7Sloane, N. J. A. (ed.). "SequenceA000328". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

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

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

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

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

[auto52-111] 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.

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

[113] 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-114] 1 2Sloane, N. J. A. (ed.). "SequenceA033991(n*(4*n-1))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

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

[auto21-116] 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-117] 1 2 3 4 5Sloane, N. J. A. (ed.). "SequenceA006315(Numbers n such that n^32 + 1 is prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[118] 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-119] 1 2 3 4 5Sloane, N. J. A. (ed.). "SequenceA050993(5-Knödel numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[120] Sloane, N. J. A. (ed.). "SequenceA006094(Products of 2 successive primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[121] Sloane, N. J. A. (ed.). "SequenceA046368(Products of two palindromic primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

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

[Prime_gap-123] 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-124] 1 2"Sloane's A097942 : Highly totient numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.

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

[auto59-126] 1 2 3 4 5 6Sloane, 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-127] 1 2 3"Sloane's A005900 : Octahedral numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.

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

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

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

[auto7-131] 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-132] 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.

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

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

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

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

[137] Sloane, N. J. A. (ed.). "SequenceA024816(Antisigma(n): Sum of the numbers less than n that do not divide n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[138] "A063776 - OEIS". oeis.org.

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

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

[141] "A000339 - OEIS". oeis.org.

[142] "A271269 - OEIS". oeis.org.

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

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

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

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

[147] "A121038 - OEIS". oeis.org.

[auto45-148] 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-149] 1 2 3 4 5 6Sloane, N. J. A. (ed.). "SequenceA002061(Central polygonal numbers: n^2 - n + 1)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

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

[151] s.org/A062092

[auto38-152] 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.

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

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

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

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

[auto72-157] 1 2Sloane, 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.

[158] "A303815 - OEIS". oeis.org.

[auto53-159] 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.

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

[161] Higgins, ibid.

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

[auto94-163] 1 2 3 4 5 6 7 8 9Sloane, N. J. A. (ed.). "SequenceA053767(Sum of first n composite numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[Nonagonal_number-164] 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-165] 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-166] 1 2 3 4 5 6 7 8 9Sloane, N. J. A. (ed.). "Sequencen*(n+2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

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

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

[Centered_octagonal_number-169] 1 2 3 4 5"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.

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

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

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

[173] "A061262 - OEIS". oeis.org.

[A008302-174] 1 2 3Sloane, 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.

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

[176] "A000045 - OEIS". oeis.org.

[auto48-177] 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.

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

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

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

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

[182] s.org/A305843

[183] "A007690 - OEIS". oeis.org.

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

[area_of_a_square_with_diagonal_2n-185] 1 2Sloane, N. J. A. (ed.). "SequenceA001105(a(n) = 2*n^2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

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

[auto66-187] 1 2 3Sloane, 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.

[188] Sloane, N. J. A. (ed.). "SequenceA000837(Number of partitions of n into relatively prime parts. Also aperiodic partitions.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[auto35-189] 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.

[ReferenceA-190] 1 2Sloane, N. J. A. (ed.). "SequenceA193757(Numbers which can be written with their digits in order and using only a plus and a squaring operator)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

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

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

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

[auto74-194] 1 2Sloane, N. J. A. (ed.). "SequenceA070169(Rounded total surface area of a regular tetrahedron with edge length n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[auto28-195] 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.

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

[auto85-197] 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.

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

[ReferenceB-199] 1 2Sloane, N. J. A. (ed.). "SequenceA051349(Sum of first n nonprimes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[cite_OEIS|A033286|n_*_primen-200] 1 2Sloane, N. J. A. (ed.). "SequenceA033286(n * prime(n))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

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

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

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

[204] Sloane, N. J. A. (ed.). "SequenceA006958(Number of parallelogram polyominoes with n cells (also called staircase polyominoes, although that term is overused))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

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

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

[207] Sloane, N. J. A. (ed.). "SequenceA014574(Average of twin prime pairs)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[208] Sloane, N. J. A. (ed.). "SequenceA173831(Largest prime < n^4)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

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

[210] Sloane, N. J. A. (ed.). "SequenceA014285(Sum_{1..n} j*prime(j))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[auto84-211] 1 2Sloane, N. J. A. (ed.). "SequenceA071400(Rounded volume of a regular octahedron with edge length n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[auto75-212] 1 2 3 4Sloane, N. J. A. (ed.). "SequenceA003114(Number of partitions of n into parts 5k+1 or 5k+4)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[auto39-213] 1 2 3 4 5 6Sloane, 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.

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

[215] "A124826 - OEIS". oeis.org.

[216] "A142005 - OEIS". oeis.org.

[auto30-217] 1 2Sloane, 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.

[218] "A066186 - OEIS". oeis.org.

[auto86-219] 1 2 3 4Sloane, 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.

[220] "A115073 - OEIS". oeis.org.

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

[222] "A061954 - OEIS". oeis.org.

[223] Sloane, N. J. A. (ed.). "SequenceA057465(Numbers k such that k^512 + 1 is prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[224] "A030299 - OEIS". oeis.org.

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

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

[227] Sloane, N. J. A. (ed.). "SequenceA018806(Sum of gcd(x, y))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[228] Sloane, N. J. A. (ed.). "SequenceA018227(Magic numbers: atoms with full shells containing any of these numbers of electrons are considered electronically stable)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[229] "A005064 - OEIS". oeis.org.

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

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

[auto96-232] 1 2 3 4 5 6 7Sloane, 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.

[auto81-233] 1 2Sloane, N. J. A. (ed.). "SequenceA056809(Numbers k such that k, k+1 and k+2 are products of two primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

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

[235] "A000032 - OEIS". oeis.org.

[236] "1348 (number)". The encyclopedia of numbers.

[auto15-237] 1 2Sloane, N. J. A. (ed.). "SequenceA101624(Stern-Jacobsthal number)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[238] Sloane, N. J. A. (ed.). "SequenceA064228(From Recamán's sequence (A005132): values of n achieving records in A057167)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[239] Sloane, N. J. A. (ed.). "SequenceA057167(Term in Recamán's sequence A005132 where n appears for first time, or -1 if n never appears)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[240] Sloane, N. J. A. (ed.). "SequenceA064227(From Recamán's sequence (A005132): record values in A057167)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[auto99-241] Sloane, N. J. A. (ed.). "SequenceA007534(Even numbers that are not the sum of a pair of twin primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[auto65-242] 1 2 3Sloane, N. J. A. (ed.). "SequenceA000603". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[243] Sloane, N. J. A. (ed.). "SequenceA000960(Flavius Josephus's sieve: Start with the natural numbers; at the k-th sieving step, remove every (k+1)-st term of the sequence remaining after the (k-1)-st sieving step; iterate)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[auto64-244] 1 2 3 4 5Sloane, N. J. A. (ed.). "SequenceA330224(Number of achiral integer partitions of n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

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

[246] 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-247] 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.

[248] Sloane, N. J. A. (ed.). "SequenceA005578(Arima sequence)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

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

[auto92-250] 1 2 3Sloane, 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.

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

[252] "A001631 - OEIS". oeis.org. Retrieved 25 June 2023.

[253] Sloane, N. J. A. (ed.). "SequenceA088274(Numbers k such that 10^k + 7 is prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

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

[255] Sloane, N. J. A. (ed.). "SequenceA002414(Octagonal pyramidal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

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

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

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

[259] Sloane, N. J. A. (ed.). "SequenceA017919(Powers of sqrt(5) rounded down)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

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

[auto41-261] 1 2Sloane, N. J. A. (ed.). "SequenceA007865(Number of sum-free subsets of {1, ..., n})". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[auto19-262] 1 2Sloane, 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.

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

[ReferenceC-264] 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.

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

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

[ReferenceD-267] 1 2 3 4Sloane, N. J. A. (ed.). "SequenceA045918(Describe n. Also called the "Say What You See" or "Look and Say" sequence LS(n))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[auto37-268] 1 2Sloane, 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.

[auto63-269] 1 2Sloane, N. J. A. (ed.). "SequenceA067538(Number of partitions of n in which the number of parts divides n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[Zeisel_number-270] 1 2"Sloane's A051015 : Zeisel numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.

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

[272] Sloane, N. J. A. (ed.). "SequenceA000097(Number of partitions of n if there are two kinds of 1's and two kinds of 2's)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[auto47-273] 1 2Sloane, 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.

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

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

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

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

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

[auto49-279] 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.

[280] Sloane, N. J. A. (ed.). "SequenceA005259(Apery (Apéry) numbers: Sum_0^n (binomial(n,k)*binomial(n+k,k))^2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[auto55-281] 1 2Sloane, N. J. A. (ed.). "SequenceA062325(Numbers k for which phi(prime(k)) is a square)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

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

[auto58-283] 1 2Sloane, 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.

[auto68-284] 1 2 3 4 5 6 7Sloane, N. J. A. (ed.). "SequenceA011257(Geometric mean of phi(n) and sigma(n) is an integer)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[285] Sloane, N. J. A. (ed.). "SequenceA007678(Number of regions in regular n-gon with all diagonals drawn)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

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

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

[288] Sloane, N. J. A. (ed.). "SequenceA071398(Rounded total surface area of a regular icosahedron with edge length n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

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

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

[291] Sloane, N. J. A. (ed.). "SequenceA075207(Number of polyhexes with n cells that tile the plane by translation)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

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

[293] Sloane, N. J. A. (ed.). "SequenceA015128(Number of overpartitions of n: an overpartition of n is an ordered sequence of nonincreasing integers that sum to n, where the first occurrence of each integer may be overlined)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[294] Sloane, N. J. A. (ed.). "SequenceA006578(Triangular numbers plus quarter squares: n*(n+1)/2 + floor(n^2/4) (i.e., A000217(n) + A002620(n)))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[ReferenceG-295] 1 2Sloane, 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.

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

[297] Sloane, N. J. A. (ed.). "SequenceA097979(Total number of largest parts in all compositions of n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[298] Sloane, N. J. A. (ed.). "SequenceA000219(Number of planar partitions (or plane partitions) of n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[299] Sloane, N. J. A. (ed.). "SequenceA006330(Number of corners, or planar partitions of n with only one row and one column)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

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

[301] Sloane, N. J. A. (ed.). "SequenceA114411(Triple primorial n###)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[auto26-302] 1 2Sloane, N. J. A. (ed.). "SequenceA034296(Number of flat partitions of n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[auto101-303] 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-304] 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.

[305] Sloane, N. J. A. (ed.). "SequenceA325325(Number of integer partitions of n with distinct differences between successive parts)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

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

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

[308] Sloane, N. J. A. (ed.). "SequenceA062198(Sum of first n semiprimes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

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

[auto33-310] 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.

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

[312] Sloane, N. J. A. (ed.). "SequenceA071396(Rounded total surface area of a regular octahedron with edge length n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

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

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

[315] Sloane, N. J. A. (ed.). "SequenceA100129(Numbers k such that 2^k starts with k)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

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

[317] Sloane, N. J. A. (ed.). "SequenceA319066(Number of partitions of integer partitions of n where all parts have the same length)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[318] Sloane, N. J. A. (ed.). "SequenceA056327(Number of reversible string structures with n beads using exactly three different colors)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

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

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

[322] Sloane, N. J. A. (ed.). "SequenceA169942(Number of Golomb rulers of length n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[323] Sloane, N. J. A. (ed.). "SequenceA169952(Second entry in row n of triangle in A169950)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[324] Sloane, N. J. A. (ed.). "SequenceA034962(Primes that are the sum of three consecutive primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[325] Sloane, N. J. A. (ed.). "SequenceA046386(Products of four distinct primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[326] Sloane, N. J. A. (ed.). "SequenceA127106(Numbers n such that n^2 divides 6^n-1)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[auto78-327] 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.

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

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

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

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

[332] Sloane, N. J. A. (ed.). "SequenceA056995(Numbers k such that k^256 + 1 is prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

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

[334] Sloane, N. J. A. (ed.). "SequenceA056026(Numbers k such that k^14 is congruent with 1 (mod 15^2))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[335] Sloane, N. J. A. (ed.). "SequenceA076409(Sum of the quadratic residues of prime(n))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[336] Sloane, N. J. A. (ed.). "SequenceA070142(Numbers n such that [A070080(n), A070081(n), A070082(n)] is an integer triangle with integer area)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

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

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

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

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

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

[342] Sloane, N. J. A. (ed.). "SequenceA100145(Structured great rhombicosidodecahedral numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

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

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

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

[346] Sloane, N. J. A. (ed.). "SequenceA007584(9-gonal (or enneagonal) pyramidal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

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

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

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

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

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

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

[353] 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-354] 1 2Sloane, N. J. A. (ed.). "SequenceA046092(4 times triangular numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[355] Sloane, N. J. A. (ed.). "SequenceA005382(Primes p such that 2p-1 is also prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

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

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

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

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

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

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

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

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

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

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

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

[367] 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-368] 1 2Sloane, 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.

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

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

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

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

[373] Sloane, N. J. A. (ed.). "SequenceA140480(RMS numbers: numbers n such that root mean square of divisors of n is an integer)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[374] Sloane, N. J. A. (ed.). "SequenceA023108(Positive integers which apparently never result in a palindrome under repeated applications of the function A056964(x))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

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

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

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

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

[379] Sloane, N. J. A. (ed.). "SequenceA224930(Numbers n such that n divides the concatenation of all divisors in descending order)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[380] Sloane, N. J. A. (ed.). "SequenceA294286(Sum of the squares of the parts in the partitions of n into two distinct parts)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

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

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

[383] Sloane, N. J. A. (ed.). "SequenceA331378(Numbers whose product of prime indices is divisible by their sum of prime factors)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

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

[385] Sloane, N. J. A. (ed.). "SequenceA331452(number of regions (or cells) formed by drawing the line segments connecting any two of the 2*(m+n) perimeter points of an m X n grid of squares)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

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

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

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

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

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

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

[392] Sloane, N. J. A. (ed.). "SequenceA036469(Partial sums of A000009 (partitions into distinct parts))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

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

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

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

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

[397] Sloane, N. J. A. (ed.). "SequenceA065764(Sum of divisors of square numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[398] Sloane, N. J. A. (ed.). "SequenceA220881(Number of nonequivalent dissections of an n-gon into n-3 polygons by nonintersecting diagonals up to rotation)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

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

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

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

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

[403] Sloane, N. J. A. (ed.). "SequenceA127816(least k such that the remainder when 6^k is divided by k is n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

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

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

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

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

[408] Sloane, N. J. A. (ed.). "SequenceA025047(Alternating compositions, i.e., compositions with alternating increases and decreases, starting with either an increase or a decrease)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

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

[410] Sloane, N. J. A. (ed.). "SequenceA235488(Squarefree numbers which yield zero when their prime factors are xored together)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

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

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

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

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

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

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

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

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

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

[420] Sloane, N. J. A. (ed.). "SequenceA152927(Number of sets (in the Hausdorff metric geometry) at each location between two sets defining a polygonal configuration consisting of k 4-gonal polygonal components chained with string components of length 1 as k varies)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

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

[422] Sloane, N. J. A. (ed.). "SequenceA101301(The sum of the first n primes, minus n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[auto1-423] 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.

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

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

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

[427] Sloane, N. J. A. (ed.). "SequenceA214083(floor(n!^(1/3)))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

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

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

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

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

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

[433] Sloane, N. J. A. (ed.). "SequenceA354493(Number of quantales on n elements, up to isomorphism)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

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

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

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

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

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

[439] Sloane, N. J. A. (ed.). "SequenceA082671(Numbers n such that (n!-2)/2 is a prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

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

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

[442] Sloane, N. J. A. (ed.). "SequenceA164652(Hultman numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

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

[444] Sloane, N. J. A. (ed.). "SequenceA057568(Number of partitions of n where n divides the product of the parts)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

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

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

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

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

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

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

[451] Sloane, N. J. A. (ed.). "SequenceA002998(Smallest multiple of n whose digits sum to n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

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

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

[auto93-454] 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.

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

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

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

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

[459] Sloane, N. J. A. (ed.). "SequenceA000412(Number of bipartite partitions of n white objects and 3 black ones)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

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

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

[462] Sloane, N. J. A. (ed.). "SequenceA008514(4-dimensional centered cube numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

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

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

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

[466] "Sloane's A051870 : 18-gonal numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.

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

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

[469] 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-470] 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.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

[485] Sloane, N. J. A. (ed.). "SequenceA024069(6^n - n^7)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

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

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

[488] Sloane, N. J. A. (ed.). "SequenceA277288(Positive integers n such that n divides (3^n + 5))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

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

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

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

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

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

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

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

[496] Sloane, N. J. A. (ed.). "SequenceA187220(Gullwing sequence)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[497] Sloane, N. J. A. (ed.). "SequenceA046351(Palindromic composite numbers with only palindromic prime factors)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[498] Sloane, N. J. A. (ed.). "SequenceA000612(Number of P-equivalence classes of switching functions of n or fewer variables, divided by 2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[499] (sequence A059801 in the OEIS)

[500] Sloane, N. J. A. (ed.). "Secuencia A002470 (función W(n) de Glaisher)" . La enciclopedia en línea de secuencias de enteros . Fundación OEIS.

[ 1 ]

[ 2 ]

[ 3 ]

[ 4 ]

[ 5 ]

[ 6 ]

de

[ 8 ]

[ 9 ]

[ 10 ]

[ 11 ]

[ 12 ]

[ 13 ]

[ 14 ]

[ 15 ]

[ 16 ]

[ 17 ]

[ 18 ]

[ 19 ]

[ 20 ]

[ 21 ]

[ 22 ]

[ 23 ]

[ 24 ]

[ 25 ]

[ 26 ]

[ 27 ]

[ 28 ]

[ 29 ]

[ 30 ]

[ 31 ]

[ 32 ]

[ 33 ]

[ 34 ]

[ 35 ]

[ 36 ]

[ 37 ]

[ 38 ]

[ 39 ]

[ 40 ]

[ 41 ]

[ 42 ]

[ 43 ]

[ 44 ]

[ 45 ]

[ 46 ]

[ 47 ]

[ 48 ]

[ 49 ]

[ 50 ]

[ 51 ]

el

[ 53 ]

[ 54 ]

[ 55 ]

[ 56 ]

[ 57 ]

[ 58 ]

[

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