1000（数字）

1000、または千は、 999の次の自然数で、1001の前の自然数です。ほとんどの英語圏の国では、千の位の数字をコンマまたはピリオドで区切って表記することができます。例: 1,000。

1000 単位のグループは、古代ギリシャ語から、チリアドと呼ばれることがあります。^{[ 1 ]} 1000 年という期間は、チリアド、またはラテン語から、より一般的にはミレニアムと呼ばれることがあります。また、中世の文脈では、ゲルマン語の 1200 を長い千として区別する必要があるため、1000 という数字は短い千として表現されることもあります。これは最初の 4 桁の整数です。

表記法

千の十進数表現は
- 1000 —一般的な表記では、1の後に3つのゼロが続く。
- 1 × 10 ³ —工学表記では、この数値は以下と一致する。
- 正確には1 × 10 ³です（科学的な正規化指数表記）。
- 正確には1 E+3です。科学的 E 表記では 1 E+3 です。
千単位を表すSI接頭辞は「キロ-」で、「k」と略されます。例えば、キログラム（ kg）は千グラムです。これはSI以外の文脈にも拡張されることがあり、例えば「ka」（キロアヌム）は1000年の期間を表す略記法として使われます。しかし、コンピュータサイエンスでは、「キロ-」は2の10乗（1024または2 ¹⁰）を意味するのに、より緩やかに使われます。
SI単位系の表記では、改行なしスペースを千の位の区切り文字として使用できます。つまり、1000のべき乗ごとに数字の桁を区切るために使用できます。
千の倍数は、最後の 3 つのゼロを文字「K」または「k」に置き換えることで表されることがあります。たとえば、$30,000 を「$30k」と書いたり、2000 年問題を表すのに「Y2K」を使用したりします。
通貨の千単位、特にドルやポンドは、口語的に「グランド」と呼ばれる。アメリカ合衆国では、この単位を「G」という接尾辞で略すこともある。

数学において

千角形は1000辺の多角形である。^{[ 2 ]}

1001～1999の範囲の数字

1001年から1099年

1001

1002

1002 = 2 × 3 × 167。これは球面数であり、過剰数であり、メルテンス関数の零点です。22 の分割は1002 通りあります。

1004

1004 = 2 ² × 251。これは七数列です。^{[ 3 ]}

1006

1006 = 2 × 503。これは珍しい数であり、等桁数であり、平方フリー数です。これは双子素数間の記録的なギャップです。^{[ 4 ]} 22 を正方形に分割する構成(順序付き分割)は 1006 通りあります。4 × 5 の正方形グリッドグラフには、 1006 個の無向ハミルトン経路があります。^[⁵^]

1009

1009は最小の 4 桁の素数であり、ラッキー素数であり、チェン素数です。11、15、19、24、28の基数で回文になっています: (838 ₁₁、474 ₁₅、2F2 ₁₉、1I1 ₂₄、181 ₂₈ )。

1011

1011 = 3 × 337。これは、基数 5、10、15、20、25、30、35、40、45、50、55、60、65、70、75 (および他の 202 基数) におけるハーシャッド数です。これは、2 ^{n が101 を含み、11011 を含まない最大の自然数}nです。1 を正の整数の逆数で分割する方法は 1011 通りあります (エジプト分数<= 16) 。^[⁶^]

1012

1012 = 2 ² × 11 × 23。1 を正の整数の逆数で分割する方法は 1012 通りあります。<= 17エジプト分数。^{[ 6 ]}

1013

1013は素数であり、ソフィー・ジェルマン素数であり、^{[ 7 ]}中心平方数であり、^{[ 8 ]}

1016

1016 = 2 ³ × 127。これはステラ八角形数であり、ミアン・チョウラ数列のメンバーです。^{[ 9 ]}辺の長さが14の立方体には1016の表面点があります。^{[ 10 ]}

1019

1019は素数であり、ソフィー・ジェルマン素数^{[ 7 ]}、セーフ素数^{[ 11 ]}、チェン素数です。

1021

1021は素数であり、ラッキー素数であり、1019と双子素数です。

1023

1024

1025

1025 = 5 ² × 41。これはヤコブスタール・ルーカス数であり、原始ピタゴラス三角形の斜辺です。1025 = 2 ¹⁰ + 1なので、プロス数です。4 進数表現 (100001 _{4 ) には数字 0 と 1 しか含まれていないため、または同等に、4 の異なるべき乗の和 (4}⁵ + 4 ⁰ ) であるため、モーザー・デ・ブルイン数列のメンバーです。

1028

1028 = 2 ² × 257。これは最初の 58 個の整数のトーシェント関数の合計です。2 ¹³未満の素数は 1029 個あります。^{[ 12 ]}

1031

1031は素数であり、ソフィー・ジェルマン素数であり、^{[ 7 ]}スーパー素数であり、チェン素数です。これは、5 番目の 10 進数レピュニット素数の指数と 1 の数です。^{[ 13 ]}

1033

1033は素数であり、エミールプです。1031とは双子素数ペアを形成します。

1035

1035 = 3 ² × 5 × 23。これは六角数^{[ 14 ]}であり、45番目の三角数です^[¹⁵^]。

1039

1039は8n+7 の形の素数であり、 ^{[ 16 ]}チェン素数であり、ラッキー素数です。1 を構成要素として含まない 30 の分割は 1039 個あります。^{[ 17 ]}

1040

1040 = 2 ⁴ × 5 × 13。6 × 6 × 6 × 6 のルービックテセラクトには 1040 個のピースが見られます。

1046

1046 = 2 × 523。これは、3次モックシータ関数f(q)の係数です。^{[ 18 ]}

1047

1047 = 3 × 349。18 の厳密な合成を、同じ合計を持つ連続した部分列に分割する方法は 1047 通りあります。^{[ 19 ]}

1049

1049は素数であり、ソフィー・ジェルマン素数^{[ 7 ]}、非常にコトーシェント数[ ^{20 ] 、}そしてチェン素数です。

1051

1051は素数であり、中心五角数であり、^{[ 21 ]}中心十角数です。

1056

1056 = 2 ⁵ × 3 × 11。これはプロニック数です。^{[ 22 ]}

1059

1059 = 3 × 353。これは、n ⁴が 4 つの正の 4 乗の和の形で表されるような数nです。 ^[²³^]

1060

1060 = 2 ^{2 × 5 × 53。これは、}2から97までの最初の25個の素数（ 100未満の素数の数）^{[ 24 ]}と、 23から131までの10個の連続する素数の6番目の和です。^{[ 25 ]}

1061

1061は素数であり、emirpであり、1063と双子の素数です。1000 から 10000までの素数は 1061 個あります(または、10進数で表した 4 桁の素数の数)。^[²⁶^]

1063

1063は素数であり、スーパー素数であり、1061と双子素数であり、ニアウォールサンサン素数です。^[²⁷^]また、7 つの連続する素数 (137 + 139 + 149 + 151 + 157 + 163 + 167) の合計です。

1069

1069は素数であり、emirpである。^{[ 28 ]}

1076

1076 = 2 ² × 269。重み11の厳密な木は1076個あります。^{[ 29 ]}

1078

1078 = 2 × 7 ² × 11。これは負の整数のオイラー変換です。^[³⁰^]

1080

1080 = 2 ³ × 3 ³ × 5。これは五角数^{[ 31 ]}であり、大部分が合成数である^[³²^]。

1081

1081 = 23 × 47。これは46番目の三角数^{[ 15 ]}であり、パドバン数列のメンバーです。^{[ 33 ]}

1086

1086 = 2 × 3 × 181。これはスミス数^{[ 34 ]}であり、最初の59個の整数のトーシェント関数の合計です。

1087

1087は素数であり、スーパー素数であり、いとこ素数であり、幸運な素数である。^{[ 35 ]}

1089

1091

1091は素数であり、 1093とはいとこ素数であり、双子素数である。

1093

1093は1091と双子素数です。1091 と1097とともに素数トリプレットを形成します。ハッピー素数であり、スター素数^[³⁶^]でもあります。また、最小のヴィーフェリッヒ素数でもあります。1093は3進数でレピュニット素数です。理由は以下のとおりです。

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

1096

1096 = 2 ³ × 137。18 の厳密なソリッド分割は 1096 通りあります。^{[ 37 ]}

1097

1097は素数であり、emirpであり、^{[ 28 ]}チェン素数です。

1100年から1199年

1102

1102 = 2 × 19 × 29。これは最初の60個の整数のトーシェント関数の合計です。

1103

1103は素数であり、ソフィー・ジェルマン素数であり^{[ 7 ]}、バランス素数である^[³⁸^]。

1104

1104 = 2 ⁴ × 3 × 23。これはキース数です^{[ 39 ]}

1105

1107

1107 = 3 ³ × 41。重み 8 の非同型な厳密 T _{0多重集合分割は 1107 個あります。}^{[ 40 ]}

1109

1109はフリードレンダー・イワニエツ素数^{[ 41 ]}であり、チェン素数でもある。

1113

1113 = 3 × 7 × 53。40 の厳密な分割は 1113 通りあります。^{[ 42 ]}

1114

1114 = 2 × 557。22を順序のない和の順序のない積として表す方法は1114通りあります。^{[ 43 ]}

1117

1117はチェン素数である。16個のセルを持つ対角対称ポリオミノは1117個存在する。^{[ 44 ]}

1118

1118 = 2 × 13 × 43。すべての項が {0,1,...,21} であるユニモジュラー 2 × 2 行列は 1118 個あります。^{[ 45 ]}

1119

1119 = 3 × 373。9ノードの二部グラフは 1119 個あります。 ^{[ 46 ]}

1122

1122 = 2 × 3 × 11 × 17。これはプロニック数です。^{[ 22 ]}

1123

1123はバランスのとれた素数である。^{[ 38 ]}

1124

1124 = 2 ^{2 × 281。これは 2 と 10 を使用した}レイランド数^{[ 47 ]}です。1124 = 2 ¹⁰ + 10 ²。これはスパイ数です。

1126

1126 = 2 × 563。{0, 1, 2, 3, 4, 5} の要素を持つ 2 × 2 の非特異整数行列は 1126 個あります。^{[ 48 ]}

1127

1127 = 7 ² × 23。これは、46 回の切断で環状部を切り出すことによって得られる最大ピース数です。^{[ 49 ]}

1128

1128 = 2 ³ × 3 × 47。これは 47 番目の三角数^{[ 15 ]}であり、24 番目の六角数です。^{[ 14 ]} 1128 は、中心電荷が24 の最大の頂点演算子代数D ₂₄の次元表現です。^[⁵⁰^]

1129

1129は素数です。半径19の円の中には1129個の格子点があります。^{[ 51 ]}

1130

1130 = 2 × 5 × 113。スキポナッチ数です。^{[ 52 ]}

1131

1131 = 3 × 13 × 29。六角形の三角形T(26)には1131本の辺があります。^{[ 53 ]}

1132

1132 = 2 ² × 283。9つのノードと2つの色を持つ、成分が完全グラフである単純なラベルなしグラフは1132個あります。^{[ 54 ]}

1133

1133 = 11 × 103。{1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15} の原始部分列は 1133 個あります。^{[ 55 ]}

1135

1135 = 5 × 227。これは中心三角数です。^{[ 56 ]}

1136

1136 = 2 ⁴ × 71。7-サンレットグラフには1136個の独立した頂点集合と頂点被覆が存在する。^[⁵⁷^]

1137

1137 = 3 × 379。これは双曲パスカルピラミッドのレベル 5 の頂点の値の合計です。^{[ 58 ]}

1139

1139 = 17 × 67。これは風車グラフD(3,17)のウィーナー指数です。 ^[⁵⁹^]

1140

1140 = 2 ² × 3 × 5 × 19。これは正四面体数です。^{[ 60 ]}

1141

1141 = 7 × 163。これは7-クネーデル数である。^{[ 61 ]}

1142

1142 = 2 × 571。これはスパイ数であり、n ³² + 1 が素数となるような数 n である。^{[ 62 ]}

1143

1143 = 3 ² × 127。2つのコネクタを持つ8つの要素の集合分割は1143通りあります。^{[ 63 ]}

1145

1145 = 5 × 229。これは5-クネーデル数です。^{[ 64 ]}

1150

1150 = 2 × 5 ² × 23。左右対称でない11-ダイヤモンドは1150個あります。^{[ 65 ]}

1151

1151は、素数ギャップが22の後に続く最初の素数です。^{[ 66 ]}また、チェン素数でもあります。

1152

1152 = 2 ⁷ × 3 ²。これは非常にトーシェント数であり、^{[ 67 ]} 3-滑らかな数であり、アキレス数です。

1153

1153はスーパープライムであり、プロスプライムである。^{[ 68 ]}

1154

1154 = 2 × 577。1154 = 2 × 24 ² + 2 なので、辺の長さが 24 の正四面体の表面には 1154 個の点があります。^{[ 69 ]}

1155

1155 = 3 × 5 × 7 × 11。これは最初の4つの奇素数の積です。次数33の2つのサイクルグラフの結合には1155本の辺があります。

1156

1156 = 2 ² × 17 ² = 34 ²。これは正八面体数、^{[ 70 ]}中心五角形数、^{[ 21 ]}および中心十一角形数です。^{[ 71 ]}

1157

1157 = 13 × 89。これは、a^2+1 の形の素因数を含まずに n^2+1 と書ける最小の数です。^{[ 72 ]}

1158

1158 = 2 × 3 × 193。辺の長さが 17 の正八面体の表面には 1158 個の点があります。^{[ 73 ]}

1159

1159 = 19 × 61。これは中心八面体数^{[ 74 ]}であり、ミアン-チョウラ数列のメンバーである^{[ 9 ] 。}

1160

1160 = 2 ³ × 5 × 29。これは八角数です。^{[ 75 ]}

1161

1161 = 3 ³ × 43。これは最初の26個の素数の和です。

1162

1162 = 2 × 7 × 83。これは最初の 61 個の整数と五角数のトーシェント関数の和です。^{[ 31 ]}

1163

1163はチェン素数である。

1164

1164 = 2 ² × 3 × 97。重み 8 の通常のマルチセットを分割するマルチセットの連鎖は 1164 個あります。ここで、マルチセットは、正の整数の初期区間を張る場合に正常です^{[ 76 ]。}

1165

1165 = 5 × 233。これは5-クネーデル数です。^{[ 64 ]}

1169

1169 = 7 × 167。これは非常にコトーシェント数です^{[ 20 ]}

1171

1171は超素数です。

1173

1173 = 3 × 17 × 23。9 つのノードを持つ平面上には 1173 個の単純な三角形分割があります。^{[ 77 ]}

1174

1174 = 2 × 587。16の広く完全に強い正規組成は1174個あります。（OEISの配列A332337）。

1175

1175 = 5 ² × 47。これは、47 回の切断で環状部を切り出すことによって得られる最大ピース数です。^{[ 49 ]}

1176

1176 = 2 ³ × 3 × 7 ²。これは 48 番目の三角数です。^{[ 15 ]}

1178

1178 = 2 × 19 × 31。辺の長さが 15 の立方体には 1178 個の表面点があります。^{[ 10 ]}

1179

1179 = 3 ² × 131。バイナリ 7 x 7 マトリックスの異なるパーマネントは 1179 個あります。^{[ 78 ]}

1182

1182 = 2 × 3 × 197。2色のビーズ14個（裏返すことができない）で可能なネックレスは1182通りあります。^{[ 79 ]}

1184

1184 = 2 ⁵ × 37。1210と相性の良い数です。^{[ 80 ]}

1186

1186 = 2 × 593。15個のセルを持つ対角対称ポリオミノは1186個あります。^{[ 44 ]}

1187

1187は安全素数^{[ 11 ]} 、スターン素数[ ^{81 ] 、}バランス素数^{[ 38 ]}、チェン素数です。

1190

1190 = 2 × 5 × 7 × 17。これはプロニック数です。^{[ 22 ]} 28段のトランプの家を作るには1190枚のカードが必要です。^{[ 82 ]}

1191

1191 = 3 × 397 = 35 ² - 35 + 1 = H _35、35番目のホグベン数。^{[ 83 ]}

1192

1192 = 2³ ^× 149。これは最初の62個の整数のトーシェント関数の合計です。

1193

1193はチェン素数である。

4 ¹¹⁹³ - 3 ¹¹⁹³は素数です。

1194

1194 = 2 × 3 × 199。3 × 3 のチェス盤上で、2 つのビショップと 1 つのルークを 8 回動かすことで到達できる順列は 1194 通りあります。^{[ 84 ]}

1196

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

1198

1198 = 2 × 599。これは中心七角数です。^{[ 86 ]}

1199

1199 = 11 × 109。これは20番目の連結台形の面積です。^{[ 87 ]}

1200年から1299年

1200

1200 = 2 ⁴ × 3 × 5 ^{2 。}ニールセンの視聴率サンプルには1200世帯が含まれています。^{[ 88 ]}

1200は「長い千」または「長い百」として知られ、それぞれが120である。これはゲルマン語派の言語における大きな数の伝統的な数え方である。

1201

1201は超素数であり、中心平方数であり、 ^{[ 8 ]}中心十角数です。

1202

1202 = 2 × 601。平面を25個の楕円で分割すると、最大1202個の領域が存在する。^{[ 89 ]}

1203

1203 = 3 × 401。これは双曲平面の(2,6,∞)タイリングの座標系列の中で1000より大きい最小の数である。^{[ 90 ]}

1204

1204 = 2 ² × 7 × 43。これは 7 × 7 × 7 マジックキューブの魔法定数です。^{[ 91 ]}

1205

1205 = 5 × 241。奇数部分の数が1205となるような28の分割は1205通りあります^{[ 92 ]}

1207

1207 = 17 × 71。これは合成ド・ポリニャック数である。^{[ 93 ]}

1208

1208 = 2 ³ × 151。超原始数 A006939(3) から始まる厳密な約数の連鎖は 1208 個あります。^{[ 94 ]}

1210

1210 = 2 × 5 × 11 ^{2 。これは 1184}^{[ 95 ]}と友好的な数であり、自己記述的な数です。

1211

1211 = 7 × 173。これは合成ド・ポリニャック数です^{[ 93 ]}

1212

1212 = 2 ² × 3 × 101 = $\sum _{k=0}^{17}p(k)$ 、どこ $p(k)$ は、 $k$ [ ⁹⁶^]

1213

1213は素数であり、emirpです。

1214

1214 = 2 × 607。これはスパイ数であり、最初の 39 個の合成数の合計です。^{[ 97 ]}

1215

1215 = 3 ^{5 × 5。}六角形の三角形T(27) ^[⁵³^]には 1215 本の辺があります。

1216

1216 = 2 ⁶ × 19。これは九角数です^{[ 98 ]}

1217

1217はスーパープライムであり、プロスプライムである。^{[ 68 ]}

1219

1219 = 23 × 53。これは中心三角数^{[ 56 ]}であり、メルテンス関数の零点です。

1220

1220 = 2 ² × 5 × 61。これはメルテンス関数の零点です。長さ16のバイナリベクトルは1220個あり、シングルトンは含まれていません。^{[ 99 ]}

1222

1222 = 2 × 13 × 47。これは六角錐数です。

1223

1223は200番目の素数です。^{[ 38 ]}また、ソフィー・ジェルマン素数^{[ 7 ]}であり、バランス素数でもあります。

1224

1224 = 2 ³ × 3 ² × 17。次数がどちらも34の2つのサイクルグラフの結合には1224のエッジがあります。^{[ 100 ]}

1225

1225 = 5 ² × 7 ² = 35 ²。これは、1 より大きい最小の数で、三角数、^{[ 15 ]}平方数、六角数です。^{[ 14 ]}^{[ 101 ]} これは、1 より大きい2 番目の平方三角数です。 ^{[ 102 ]} これは、49 番目の三角数、35 番目の平方数、25 番目の六角数、中心八角数、^{[ 103 ]} 29 角数、^{[ 104 ]} 60 角数、^{[ 105 ]}および 124 角数です。これは、5 つの連続する奇数の立方数の和です。

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

1226

1226 = 2 × 613。15個のノードを持つ根付きアイデンティティツリーは1226個あります。^{[ 106 ]}

1228

1228 = 2 ² × 307。これは最初の63個の整数のトーシェント関数の合計です。

1229

1229はソフィー・ジェルマン素数^{[ 7 ]}であり、 emirpでもある。10,000未満の素数は1229個ある。

1230

1230 = 2 × 3 × 5 × 41 = T(9, 6)、マホニアン数。^{[ 107 ]}

1231

1231は素数であり、エリムです。

1232

1232 = 2 ⁴ × 7 × 11。7つの集合を奇数個の部分に分割したラベル付きの順序付き集合は1232個あります。^{[ 108 ]}

1234

1234 = 2 × 617。2つの異なる素因数を持つため、平方因子を持たない半素数です。1から4までのすべての数を含む最小の整数です。30を異なる部分に分割すると、1234個の部分があります。^{[ 109 ]} 4×4の正方形グリッドには、1234個の独立した頂点セットがあります。同様に、隣接する2つの要素が両方とも1にならない、 1234個の異なる4×4バイナリ行列があります。

2012年に行われた、よく使われる個人識別番号（PIN）に関する調査によると、4桁のPINコードの中で、1234が最も頻繁に選ばれていることがわかった。

1236

1236 = 2 ² × 3 × 103 = 617 + 619、双子素数ペアの和。^{[ 110 ]}

1238

1238 = 2 × 619。31の分割のうち、1を部分として含まないものは1238個あります。^{[ 17 ]}

1239

1239 = 3 × 7 × 59。これは3次元のつまようじ数です。^{[ 111 ]}

1240

1240 = 2 ³ × 5 × 31。これは正四角錐数です。^{[ 112 ]}

1241

1241 = 17 × 73。これは中心立方数^{[ 113 ]}であり、スパイ数です。

1243

1243 = 11 × 113。これは合成ド・ポリニャック数です。^{[ 93 ]}

1244

1244 = 2 ² × 311。25 の完全な分割は 1244 通りあります。^{[ 114 ]}

1245

1245 = 3 × 5 × 83。5つの頂点上に1245個のラベル付きスパンニング交差集合システムが存在する。^{[ 115 ]}

1247

1247 = 29 × 43。これは五角数です。^{[ 31 ]}

1249

1249は素数であり、エミールプであり、三相数である。^{[ 116 ]}

1251

1251 = 3 ² × 139。1251 = 2 × 25 ² + 1 なので、0 から 25 までの整数要素を持つ 2 × 2 行列の異なる行列式は 1251 通りあります。^{[ 117 ]}

1252

1252 = 2 ² × 313。1252 = 2 × 25 ² + 2 なので、辺の長さが 25 の正四面体の表面には 1252 個の点があります。^{[ 69 ]}

1255

1255 = 5 × 251。これはメルテンス関数の零点です。23 の分割は 1255 通りあります。^{[ 118 ]} 23 を順序のない和の順序のない積として書く方法は 1255 通りあります。^{[ 43 ]}

1257

1257 = 3 × 419。半径20の円の中には1257個の格子点があります。^{[ 51 ]}

1259

1259は素数であり、非常にコトーシェント数である。^{[ 20 ]}

1260

1260 = 2 ² × 3 ² × 5 × 7。これはプロニック数であり、^{[ 22 ]}最小の吸血鬼数であり、^{[ 119 ]} 16 番目の高度合成数であり、^{[ 120 ]}最初の 64 個の整数のトーシェント関数の合計です。41 の厳密な分割は 1260 個あります。^{[ 42 ]}

1261

1261 = 13 × 97。これはスター数^{[ 36 ]}であり、メルテンス関数の零点です。

1264

1264 = 2 ⁴ × 79。これは最初の27個の素数の和です。

1265

1265 = 5 × 11 × 23。同じレベルの頂点が同じ次数を持つ、43個の頂点を持つ根付き木は1265個あります。^{[ 121 ]}

1266

1266 = 2 × 3 × 211。これは中心五角数^{[ 21 ]}であり、メルテンス関数の零点です。

1267

1267 = 7 × 181。これは7-クネーデル数である。^{[ 61 ]}

1269

1269 = 3 ³ × 47。テオドロスの螺旋を11回転させるには、1269個の三角形が必要です。^{[ 122 ]}

1275

1275 = 3 × 5 ² × 17。これは50番目の三角数です。^{[ 15 ]}

1276

1276 = 2 ^{2 × 11 × 29。25-}カクテルパーティーグラフには1276個の非冗長セットがあります。^{[ 123 ]}

1277

1277は素数です。これは長さ9の素数集合（「素数9つ組」）の始まりです。

1278

1278 = 2 × 3 ² × 71。20年後にはナラヤナの牛と子牛は1278頭になります。^{[ 124 ]}

1279

1279は素数であり、メルセンヌ素数の指数である。

1280

1280 = 2 ⁸ × 5。9 のすべての構成には 1280 個の部分があります。^{[ 125 ]}

1281

1281 = 3 × 7 × 61。これは八角数です。^{[ 75 ]}

1283

1283は安全な素数です。^{[ 11 ]}

1284

1284 = 2 ² × 3 × 107 = 641 + 643、双子素数ペアの和。^{[ 110 ]}

1285

1285 = 5 × 257。1285 個のフリーノノミノがあります。

1286

1286 = 2 × 643。5つの1×2の長方形（またはドミノ）から形成できる、互いに等価でない連結平面図形は1286個あり、各接する長方形のペアは長さ1の辺をちょうど1つ共有し、長方形の隣接グラフは木になります。^{[ 126 ]}

1287

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

1288

1288 = 2 ³ × 7 × 23。これは七角数です。^{[ 128 ]}

1289

1289はソフィー・ジェルマン素数^{[ 7 ]}であり、1291 と双子素数です。1289 は、その正の約数 (自身を除く) の合計が 1289 未満であるため、不足数です。1289 は、その二進展開に偶数個の 1 が含まれているため、邪悪な数です。

1291

1291は1289と双子素数である。

1292

1292 = 2 ² × 17 × 19。ファイ(1292) = ファイ(シグマ(1292))。^{[ 129 ]}

1295

1295 = 5 × 7 × 37。2つのサイクルグラフの結合には1295のエッジがあり、どちらも次数は35です。^{[ 100 ]}

1296

1296 = 2⁴ ^× 3⁴ ⁼ 6⁴ ⁼ 36² ^。これは最初の8つの正の整数の立方和です。

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

通常の8×8のチェス盤には1296個の長方形があります。2つの英数字の組み合わせは1296通りあります。

1297

1297は超素数であり、ピンホイール数であり、^{[ 130 ]}メルテンス関数の零点である。

1300年から1399年

1300

1300 = 2² ^× 5² ^× 13。これはメルテンス関数の零点であり、最小の偶奇因子超完全数です。これは最初の4つの5乗の和です。

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

1301

1301は素数であり、中心が平方数です。^{[ 8 ]}ラベルのないノードが 13 個ある木は 1301 個あります。^{[ 131 ]}

1306

1306 = 2 × 653。これは中心三角数です。^{[ 56 ]}

1307

1307は安全な素数です。^{[ 11 ]}

1308

1308 = 2 ² × 3 × 109。これは最初の65個の整数のトーシェント関数の合計です。

1312

1312 = 2 ^{5 × 41。これは}ミアン・チョウラ数列のメンバーである。^{[ 9 ]}

1316

1316 = 2 ² × 7 × 47。これは sigma(11) のオイラー変換です。^{[ 132 ]}

1319

1319は安全な素数です。^{[ 11 ]}

1320

1320 = 2 ^{3 × 3 × 5 × 11 = 659 + 661、}双子素数ペアの和。^{[ 110 ]}

1325

1325 = 5 ² × 53。これはマルコフ数^{[ 133 ]}であり、中心四面体数です。^{[ 134 ]}

1326

1326 = 2 × 3 × 13 × 17。これは 51 番目の三角数^{[ 15 ]}であり、六角数です。^{[ 14 ]}

1327

1327は、素数ギャップが34となる前の最小の素数である。

1328

1328 = 2 ⁴ × 83。これは最初の66個の整数のトーシェント関数の合計です。

1330

1330 = 2 × 5 × 7 × 19。これは正四面体数です。^{[ 60 ]} 2番目の定義では、1331とルツ-アーロンのペアを形成します。

1331

1331 = 11 ³。これは中心七角数です。^{[ 86 ]} 2番目の定義では、1330 とルツ-アーロンのペアを形成します。

1334

1334 = 2 × 23 × 29。37個の円を描くことで平面を分割できる領域の最大数は1334です。^{[ 135 ]}

1335

1335 = 3 × 5 × 89。これは五角数です。^{[ 31 ]}

1342

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

1346

1346 = 2 × 673。10個のノードを持つ局所的に分離した根付き木は1346個あります。^{[ 136 ]}

1350

1350 = 2 × 3 ³ × 5 ²。これは九角数です。^{[ 98 ]}

1353

1353 = 3 × 11 × 41。1353 = 2 × 26 ² + 1 なので、 0 から 26 までの整数成分を持つ2 × 2行列式は 1353 通りあります。^{[ 117 ]}

1361

1361は、素数ギャップ34 ^{[ 66 ]}と 3 番目のミルズ素数に続く最初の素数です。これは中心十角数です。

1363

1363 = 29 × 47。14個の物体の円形配置を、隣接するペアを1つ以上入れ替えることで変更する方法は1363通りあります。^{[ 137 ]}

1364

1364 = 2 ² × 11 × 31。これはルーカス数です。^{[ 138 ]}

1365

1365 = 3 × 5 × 7 × 13。これは五面体数です。^{[ 139 ]}

1367

1367 は安全な素数^{[ 11 ]}であり、バランスの取れた素数です。これは、3 つ、9 つ、および 11 個の連続する素数 (449 + 457 + 461、131 + 137 + 139 + 149 + 151 + 157 + 163 + 167 + 173、および 101 + 103 + 107 + 109 + 113 + 127 + 131 + 137 + 139 + 149 + 151) の合計です^{[ 38 ] 。}

1368

1368 = 2 ³ × 3 ² × 19。次数がどちらも36である2つのサイクルグラフの結合には1368のエッジがあります。^{[ 100 ]}

1371

1371 = 3 × 457。これは最初の28個の素数の和です。

1373

1373は素数です。半径21の円の内部には1373個の格子点があります^{[ 51 ]}

1377

1377 = 3 ⁴ × 17。これは、 51 回の切断で環状部を切り出すことによって得られる最大ピース数です^{[ 49 ]}

1378

1378 = 2 × 13 × 53。これは52番目の三角数です^{[ 15 ]}

1379

1379 = 7 × 197。これは、n × nの通常の魔方陣とn = 14の場合のn クイーン問題の魔方陣定数です。

1380

1380 = 2 ² × 3 × 5 × 23。4つの入力を持つ8ステップのマッピングは1380通りあります。^{[ 140 ]}

1381

1381は素数であり、中心五角数である。^{[ 21 ]}

1384

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

1385

1385 = 5 × 277。これはアップダウン数です。^{[ 141 ]}

1387

1387 = 19 × 73。これは、基数 2 の 5 番目のフェルマー擬素数、^{[ 142 ]} 22 番目の中心六角数、19 番目の十角数、^{[ 143 ]}および 2 番目のスーパープーレ数です。^{[ 144 ]}

1388

1388 = 2 ² × 347。1388 = 4 × 19 ^{2 - 3 × 19 + 1 は、}ウラムの螺旋の x 軸上にある。^{[ 145 ]}

1393

1393 = 7 × 199。これは7-クネーデル数である。^{[ 61 ]}

1394

1394 = 2 × 17 × 41。これは最初の67個の整数のトーシェント関数の合計です。

1395

1395 = 3 ² × 5 × 19。これは吸血鬼数^{[ 119 ]}であり、ミアン-チョウラ数列^[⁹^]のメンバーです。

1369

1396 = 2 ² × 349。これは中心三角数です。^{[ 56 ]}

1399

1399は素数であり、エミールプです。^{[ 146 ]}

1400年から1499年

1403

1403 = 23 × 61。これは、M(x) = 11となる最小の数xであり、M()はメルテンス関数である^{[ 147 ]。}

1404

1404 = 2 ² × 3 ² × 13。これは七角数です。^{[ 128 ]}

1405

1405 = 5 × 281 = 26 ² + 27 ² = 7 ² + 8 ² + ... + 16 ²。これは中心平方数です^{[ 8 ]}

1406

1406 = 2 × 19 × 37。これは半正比例数である。^{[ 148 ]}

1409

1409はスーパー素数であり、ソフィー・ジェルマン素数^{[ 7 ]}であり、プロス素数^{[ 68 ]である。}

1410

1410 = 2 × 3 × 5 × 47。これは46番目のベルヌーイ数の分母です^{[ 149 ]}

1418

1418 = 2 × 709。これは、M(x) = 13 となる最小の数 x であり、M() はメルテンス関数である^{[ 147 ]}

1425

1425 = 3 × 5² ^× 19。これは5進数で表した、それ自体で意味がわかる数です。

1426

1426 = 最初の 68 個の整数のトーシェント関数の合計、五角数、^{[ 31 ]} 42 の厳密な分割の数^{[ 42 ]}

1427

1427 = 1429 と同数の素数^{[ 150 ]}

1428

1428 = 内部ノードが 6 つ、またはエッジが 18 つある完全な三分木の数。^{[ 151 ]}

1429

1429 = 1427 と同数の素数^{[ 150 ]}

1430

1430 =カタルーニャ数^{[ 152 ]}

1431

1431 = 53 番目の三角数、^{[ 15 ]}六角数^{[ 14 ]}

1432

1432 = パドバンシーケンスのメンバー^{[ 33 ]}

1433

1433 =超素数、^{[ 153 ]}

1435

1435 =吸血鬼の番号; ^{[ 119 ]}

1436

1436 = 完全実数立方体の判別式^{[ 154 ]}

1437

1437 = 複雑さ20の最小数: +、*、^を使用して構築するために20個の1を必要とする最小数^{[ 155 ]}

1439

1439 = ソフィー・ジェルマン素数、^{[ 7 ]}安全な素数^{[ 11 ]}

1440

1440 =非常にトーシェント数、^{[ 67 ]}ほぼ合成数^{[ 32 ]}

1441

1441 = 星番号^{[ 36 ]}

1447

1447 =超素数、幸運な数

1451

1451 = ソフィー・ジェルマン全盛期^{[ 7 ]}

1452

1452 = 完全グラフ K ₁₂^{[ 156 ]の最初のザグレブ指数}

1453

1453 = 1459 とセクシーな素数

1458

1458 = 2 × 3 ⁶。これは、ゼロとイチからなる 11 × 11 行列の最大行列式であり^{[ 157 ]}、3 平滑数です。

1458は、10進数の各桁の数字を足し合わせると、その数字を逆にしたものと掛け合わせると元の数字になる、という性質を持つ3つの数字のうちの1つです。

1 + 4 + 5 + 8 = 18

18 × 81 = 1458

この性質を持つ他の非自明な数は、81と1729、および自明な解である1と0のみです。これは藤原正彦によって証明されました。^{[ 158 ]}

1459

1459 = 1453 とのセクシー素数、9 つの連続素数 (139 + 149 + 151 + 157 + 163 + 167 + 173 + 179 + 181) の合計、ピアポント素数

1462

1462 = (35 - 1) × (35 + 8) = 35 頂点を持つホイールグラフの最初のザグレブ指数^{[ 159 ]}

1465

1465 = 5-クネーデル数^{[ 64 ]}

1466

1466 = $\sum _{k=1}^{256}d(k)$ 、どこ $d(k)$ = の約数 $k$ ^{[ 160 ]}

1467

1467 = クランクがゼロの 39 の分割数^{[ 161 ]}

1469 = 八面体数、^{[ 70 ]}非常にコトーシェント数^{[ 20 ]}
1470 =五角錐数、^{[ 162 ]}最初の69個の整数のトーシェント関数の合計
1471 =超素数、中心七角数^{[ 86 ]}
1476 = 完全な数^{[ 163 ]}
1477 = 7-クネーデル数^{[ 61 ]}
1480 = 最初の29個の素数の合計
1481 = ソフィー・ジェルマン全盛期^{[ 7 ]}
1485 = 54 番目の三角数^{[ 15 ]}
1486 = 19 の厳密な固体分割の数^{[ 37 ]}
1487 = 安全な素数^{[ 11 ]}
1489 =中心三角数^{[ 56 ]}
1490 =テトラナッチ数^{[ 164 ]}
1491 = 九角数、^{[ 98 ]}
1492 = 完全実数立方体の判別式、^{[ 154 ]}
1493 = スターン素数^{[ 81 ]}
1494 = 最初の70個の整数のトーシェント関数の合計
1496 = 正四角錐数^{[ 112 ]}
1499 = ソフィー・ジェルマン素数、^{[ 7 ]}超素数

1500年から1599年

1500 = 3つの異なるピタゴラス三角形の斜辺^{[ 165 ]}
1501 = 中心五角数^{[ 21 ]}
1502 = xとx+1の素因数がすべて47以下であるような連続する整数x、x+1のペアの数^{[ 166 ]}
1503 =テオドロスの螺旋の12回転を完了するために必要な最小の三角形の数^{[ 122 ]}
1504 = 原始過剰数 (すべての真の約数が不足数である過剰数) ^{[ 167 ]}
1508 = 七角錐数^{[ 168 ]}
1509 = 風車番号^{[ 130 ]}
1510 =不足数、忌まわしい数
1511 = ソフィー・ジェルマン素数、^{[ 7 ]}バランス素数^{[ 38 ]}
1513 = 中央の平方数^{[ 8 ]}
1516 = $\left\lfloor 9^{\frac {10}{3}}\right\rfloor$ ^{[ 169 ]}
1517 = 半径22の円の内側の格子点の数^{[ 51 ]}
1519 = 8 個のセルを持つ多角形の数、^{[ 170 ]}メルテンス関数ゼロ
1520 = 五角数、^{[ 31 ]}メルテンス関数ゼロは、第2の定義の下で1521とルース-アーロンペアを形成する
1521 = 39 ²、メルテンス関数ゼロ、中心八角数、^{[ 103 ]}は、第2の定義の下で1520とルース-アーロンペアを形成する
1523 =スーパー素数、メルテンス関数ゼロ、安全素数、^{[ 11 ]}ミアン-チョウラ数列のメンバー^{[ 9 ]}
1525 = 七角数、^{[ 128 ]}
1526 = 交替群 A ₂₇^{[ 171 ]の共役クラスの数}
1527 = 11 の 2 次元分割の数、^{[ 172 ]}
1529 = 合成ド・ポリニャック数^{[ 93 ]}
1530 =吸血鬼の数字^{[ 119 ]}
1531 = 素数、中心十角数、メルテンス関数ゼロ
1532 = ラベルなしエッジが 9 個ある直並列ネットワークの数、^{[ 173 ]}メルテンス関数ゼロ
1535 =習慣番号
1536 = 一般的なマイクロプレートのサイズ、3 平滑数 (2 ⁹ ×3)、ちょうど 4 つの変数の閾値関数の数^{[ 174 ]}
1537 = キース番号、^{[ 39 ]}
1539 = 54 回の切断で環状部を切り出すことで得られる最大ピース数^{[ 49 ]}
1540 = 55 番目の三角数、^{[ 15 ]}六角数、^{[ 14 ]}十角数、^{[ 143 ]}四面体数^{[ 60 ]}
1541 =八角数^{[ 75 ]}
1543 = すべてのフィボナッチ数列を割り切る素数、^{[ 175 ]}
1546 = 各行と各列に最大で 1 が 1 つしかない 5 × 5 バイナリ行列の数、^{[ 176 ]}メルテンス関数ゼロ
1547 =六角錐数
1548 = 完全な数^{[ 163 ]}
1549 =ド・ポリニャック素数^{[ 177 ]}
1550 = ${\frac {31\times (3\times 31+7)}{2}}$ = 平らなカード1枚分の幅の屋根を持つ31段のトランプの家を建てるのに必要なカードの枚数^{[ 178 ]}
1552 = 57を素数に分割する数
1556 = 最初の9つの素数の平方和
1557 = 8 ノードと 13 エッジを持つグラフの数^{[ 179 ]}
1559 = ソフィー・ジェルマン全盛期^{[ 7 ]}
1561 =中心八面体数、^{[ 74 ]} 19 ノードを持つシリーズ縮小木の数^{[ 180 ]}
1562 = 40個の円を描くことで平面を分割できる領域の最大数^{[ 135 ]}
1563 = $\sum _{k=1}^{50}{\frac {50}{\gcd(50,k)}}$ ^{[ 181 ]}
1564 = 最初の71個の整数のトーシェント関数の合計
1565 = ${\sqrt {1036^{2}+1173^{2}}}$ そして $1036+1173=47^{2}$ ^{[ 182 ]}
1566 = k ⁶⁴ + 1 が素数となるような数 k
1567 = 少なくとも 1 つの異なる部分を持つ 24 の分割の数^{[ 183 ]}
1568 =アキレス番号^{[ 184 ]}
1569 = 2 × 28 ² + 1 = 0 から 28 までの整数エントリを持つ異なる 2 × 2 行列式の数^{[ 117 ]}
1570 = 2 × 28 ² + 2 = 辺の長さが 28 の正四面体の表面上の点の数^{[ 69 ]}
1571 = ホナカー素数^{[ 153 ]}
1572 = ミアン-チョウラ系列のメンバー^{[ 9 ]}
1573 = 完全実数立方体の判別式^{[ 154 ]}
1575 = 奇数の過剰数、^{[ 185 ]}連続する三角数の間の非三角数の合計、24 の分割数^{[ 118 ]}
1583年＝ソフィー・ジェルマンが誕生
1585 =リオルダン数、中心三角数^{[ 56 ]}
1587 = 3 × 23 ² = 次数 69 の完全三部グラフのエッジの数、K _23,23,23^{[ 186 ]}
1588 = 最初の72個の整数のトーシェント関数の合計
1589 = 合成ド・ポリニャック数^{[ 93 ]}
1592 = 最初の 36 個の奇数のすべての約数の合計^{[ 187 ]}
1593 = 最初の30個の素数の合計
1594 = サイズ17の最大高さのハフマン木の最小コスト^{[ 188 ]}
1595 =重み10の非同型集合システムの数
1596 = 56番目の三角数^{[ 15 ]}
1597 =フィボナッチ素数、^{[ 189 ]}マルコフ素数、^{[ 133 ]}超素数、emirp
1599 = 2 つのサイクルグラフの結合におけるエッジの数、両方とも次数は 39 ^{[ 100 ]}

1600年から1699年

1600 = 40 ²、7進数での反復桁 (4444 ₇ )、
1601 = ソフィージェルマン素数、プロス素数、^{[ 68 ]}
1602 = 辺の長さが 20 の正八面体の表面上の点の数^{[ 73 ]}
1603 = 非負ランクの 27 の分割の数^{[ 190 ]}
1604 = 22を素数に分解する数^{[ 191 ]}
1605 = 7 個の正八角形からなるポリオミノの数^{[ 192 ]}
1607 = 1609 および 1613 との素数トリプルのメンバー^{[ 193 ]}
1608 = $\sum _{k=1}^{44}\sigma (k)$ ^{[ 85 ]}
1610 = 43 ^[⁴²^]の厳密な分割の数
1611 = 1から51までの整数の集合から構成できる有理数の数^{[ 194 ]}
1612 = すべての滑らかなコンパクトリーマン31多様体が部分多様体として実現可能であるために十分なユークリッド空間の最大次元^{[ 195 ]}
1613、1607、1619はすべて素数です^{[ 196 ]}
1614 = 8^1 の分割を細分化して 1^8 を得る方法の数^{[ 197 ]}
1615 = 素因数の二乗平均が素数でない整数となる合成数^{[ 198 ]}
1616 = ${\frac {16(16^{2}+3\times 16-1)}{3}}$ = {1,2,...,16} 内の単調な三つ組 (x,y,z) の数³^{[ 199 ]}
1617 = 五角数^{[ 31 ]}
1618 = 中心七角数^{[ 86 ]}
1619 =バイナリの回文素数、安全な素数^[¹¹^]
1620 = 809 + 811: 双子素数ペア^{[ 110 ]の和}
1621 =超素数、風車数^{[ 130 ]}
1622 = 素数 + 1 の形の半素数^{[ 200 ]}
1623は 2 つの三角数と 4 乗の和ではありません^{[ 201 ]}
1624 = 28次のアステカダイヤモンドの正方形の数^{[ 202 ]}
1625 = 中央の平方数^{[ 8 ]}
1626 = 中心五角数^{[ 21 ]}
1628 = 中心五角数^{[ 21 ]}
1629 = 辺の長さが 24 の正四面体の丸められた体積^{[ 203 ]}
1631 = $\sum _{k=0}^{5}(k+1)!{\binom {5}{k}}$ ^{[ 204 ]}
1632 = 正 18 多角形の頂点から作られる鋭角三角形の数^{[ 205 ]}
1633 = 星番号^{[ 36 ]}
1634 = 10進数で表した最小の4桁のナルシシズム的数
1635 = 逆数の和が整数となる 56 の分割の数^{[ 206 ]}
1637 = 素数島: 隣接する素数がちょうど 30 離れている最小の素数^{[ 207 ]}
1638 =調和約数、^{[ 208 ]} 5 × 2 ¹⁶³⁸ - 1 は素数です^{[ 209 ]}
1639 = ^{98の九角数}
1640 = プロニック数^{[ 22 ]}
1641 = 41 ² - 41 + 1 = H ₄₁ (41 番目のホグベン数) ^{[ 83 ]}
1642 = 41個の円を描くことで平面を分割できる領域の最大数^{[ 135 ]}
1643 = 最初の 46 個の合成数の合計^{[ 97 ]}
1644 = 821 + 823: 双子素数ペアの和^{[ 110 ]}
1645 = コンウェイのライフゲームにおける16セルの擬似静物画の数（回転と反射を除く）^{[ 210 ]}
1646 = 8つのノードと14のエッジを持つグラフの数^{[ 179 ]}
1647と1648はどちらも立方数で割り切れる^{[ 211 ]}
1648 = 34 ³を異なる立方体に分割する数^{[ 212 ]}
1649 = 非常にコトーシェント数、^{[ 20 ]} 4と5を使用したレイランド数^{[ 47 ]}^{(4 5} + 5 ⁴ )
1650 = 33段のトランプの家を作るのに必要なカードの枚数^{[ 82 ]}
1651 = 七角数^{[ 128 ]}
1652 = 29を素数個の部分に分割する数^{[ 213 ]}
1653 = 57 番目の三角数、^{[ 15 ]}六角数、^{[ 14 ]}半径 23 の円の内側の格子点の数^{[ 51 ]}
1654 = 42を42の約数に分割する数^{[ 214 ]}
1656 = 827 + 829: 双子素数ペアの和^{[ 110 ]}
1657 =キューバ素数、^{[ 215 ]}
1658 = 素因数の合計に加えると25回の反復後に素数になる最小の合成数^{[ 216 ]}
1659 = 1から52までの整数の集合から構成できる有理数の数^{[ 194 ]}
1660 = 最初の73個の整数のトーシェント関数の合計
1661 = 11 × 151、2 つの回文素数の積である回文数^{[ 217 ]}
1662 = 49 を互いに素な部分に分割する数^{[ 218 ]}
1663 = 素数であり、5 ¹⁶⁶³ - 4 ¹⁶⁶³は 1163 桁の素数です^{[ 219 ]}
1664 = k であり、k、k+1、k+2 は 2 つの平方数の和である^{[ 220 ]}
1665 = 中心四面体数^{[ 134 ]}
1666 =ローマ数字で表した最大の効率的な全桁数（各記号がちょうど1回ずつ出現する）
1667 = 228 + 1439 であり、228 番目の素数は 1439 ^{[ 221 ]です。}
1668 = 33 を 33 と互いに素な部分に分割する数^{[ 222 ]}
1669 =スーパー素数、次の素数^[²²³^]とのギャップがちょうど 24 である最小の素数
1670 = 少なくとも 2 つの隣接する部分が等しい 12 の構成の数^{[ 224 ]}
1671 は最初の 1671 個の合成数の合計を割り切る^{[ 225 ]}
1672 = 41 ² - 3 ²、1672 を素数の平方の差として表現する唯一の方法^{[ 226 ]}
1676 = 34を分割した数で、それぞれの分割された部分が異なる回数使用される^{[ 227 ]}
1679 = 非常にコトーシェント数、^{[ 20 ]}半素数 (23 × 73、アレシボメッセージも参照)、32 を異なる部分に分割したすべての部分の数^{[ 109 ]}
1680 = 17 番目の高度合成数、^{[ 120 ]} 2 つのサイクルグラフの結合におけるエッジの数、両方とも次数 40 ^{[ 100 ]}
1681 = 41 ²、n ² + n + 41 の式で得られる素数ではない最小の数。中心八角数^{[ 103 ]}
1682年と1683年は、ルツとアロンのペアの一員である（最初の定義）。
1683 = 三角マッチ棒の数字^{[ 228 ]}
1684 =中心三角数^{[ 56 ]}
1685 = 5-クネーデル数^{[ 64 ]}
1686 = $\sum _{k=1}^{45}\sigma (k)$ ^{[ 85 ]}
1687 = 7-クネーデル数^{[ 61 ]}
1688 = 1より大きい正の整数の有限連結集合の数で、最小公倍数は72 ^{[ 229 ]}
1689 = $9!!\sum _{k=0}^{4}{\frac {1}{2k+1}}$ ^{[ 230 ]}
1690 = 14を2のべき乗に合成した数^{[ 231 ]}
1691 = 上下逆と同じで、ストロボグラム数になります^{[ 232 ]}
1692 = 完全な数^{[ 163 ]}
1695 = n × nの通常の魔方陣の魔方定数、およびn = 15の場合のn クイーン問題。58 を素数に分割する数
1696 = 最初の74個の整数のトーシェント関数の合計
1698 = 同じレベルの頂点が同じ次数を持つ 47 個の頂点を持つ根付き木の数^{[ 121 ]}
1699 = 同じレベルの頂点が同じ次数を持つ 48 個の頂点を持つ根付き木の数^{[ 121 ]}

1700年から1799年

1700 = σ ₂ (39): 39の約数の平方和^{[ 233 ]}
1702 = 3つの連続する塩基で回文構造になっ_ている: 898 _14、787_15、6A6 16
1705 =トリボナッチ数^{[ 234 ]}
1706 = 1 + 4 + 16 + 64 + 256 + 1024 + 256 + 64 + 16 + 4 + 1 4のべき乗の三角形の5行目の合計^{[ 235 ]}
1710 = 57 回の切断で環状部を切り出すことで得られる最大ピース数^{[ 49 ]}
1711 = 58番目の三角数、^{[ 15 ]}中心十角数
1712 = 29カクテルパーティーグラフの冗長でないセットの数^{[ 123 ]}
1713 = 12個のノードを持つ非周期的な根付き木の数^{[ 236 ]}
1716 = 857 + 859: 双子素数ペアの和、^{[ 110 ]}
1717 = 五角数^{[ 31 ]}
1718 = $\sum _{d|12}{\binom {12}{d}}$ ^{[ 237 ]}
1719 = 合成ド・ポリニャック数^{[ 93 ]}
1720 = 最初の31個の素数の合計
1721 = 双子素数。42 ²と 42 ⁴の間の平方数。^{[ 238 ]}
1722 =ジウガ数、^{[ 239 ]}プロニック数^{[ 22 ]}
1723 =超素数
1724 = 42個の円を描くことで平面を分割できる領域の最大数^{[ 135 ]}
1725 = 47 ² - 22 ² = (prime(15)) ² - (nonprime(15)) ²^{[ 240 ]}
1726 = 44を互いに素な部分に分割する数^{[ 241 ]}
1727 = 24番目の連結台形の面積^{[ 87 ]}
1728 = 1000 を 12進数で表した値、つまり12の立方(グレートグロスと呼ばれる)、したがって、1 立方フィートの立方インチ数であり、11 進数 (1331₁₁ ) と 23 進数 (363₂₃ )
1729 =タクシー番号、カーマイケル数、ツァイゼル数、中心立方数、ハーディ・ラマヌジャン数。e の十進展開では、 10桁すべてが連続して現れるのは、1729 桁目 (または 1728 桁目) からが最初です。1979 年、ロックミュージカル「ヘアー」は、ニューヨーク市のブロードウェイで 1729 回上演された後、閉幕しました。基数 12、32、36 で回文です。
1730 = 3 × 24 ² + 2 = 辺の長さが 24 の正四角錐の表面上の点の数^{[ 242 ]}
1732 = $\sum _{k=0}^{5}{\binom {5}{k}}^{k}$ ^{[ 243 ]}
1733 =ソフィー・ジェルマン素数、基数3、18、19で回文構造。
1736 = 最初の 75 個の整数のトーシェント関数の合計、辺の長さが 18 の立方体の表面点の数^{[ 10 ]}
1737 = 風車番号^{[ 130 ]}
1740 = 29次のアステカダイヤモンドの正方形の数^{[ 202 ]}
1741 =超素数、中心平方数^{[ 8 ]}
1742 =平面が30個の楕円によって分割される領域の数^{[ 89 ]}
1743 =風車グラフD(3,21)のウィーナー指数^[⁵⁹^]
1745 = 5-クネーデル数^{[ 64 ]}
1746 = 8ノード上の単位距離グラフの数^{[ 244 ]}
1747 = バランスの取れた素数^{[ 38 ]}
1748 = 55を異なる部分に分割する数で、その部分の数が55 ^{[ 245 ]を割り切るもの}
1749 = 33 の整数分割の数で、どの部分も他のすべての部分を分割しないもの^{[ 246 ]}
1750 = 3つの異なるピタゴラス三角形の斜辺^{[ 165 ]}
1751 =トリミングされた六角形^{[ 247 ]}
1753 =バランスの取れた素数^{[ 38 ]}
1755 = 拡大差が異なる 50 の整数分割の数^{[ 248 ]}
1756 = 中心五角数^{[ 21 ]}
1757 =テオドロスの螺旋の三角形の最小数で13回転を完了する^{[ 122 ]}
1758年= $\sum _{k=1}^{46}\sigma (k)$ ^{[ 85 ]}
1759 =ド・ポリニャック素数^{[ 177 ]}
1762 = 長さ12でカーリング数2のバイナリシーケンスの数^{[ 249 ]}
1763 = 次数が 41 の 2 つのサイクルグラフの結合におけるエッジの数^{[ 100 ]}
1765 = スタックの数、または 15 ^{[ 250 ]の平面パーティションの数}
1769 = 58 回の切断で環状部を切り出すことで得られる最大ピース数^{[ 49 ]}
1770 = 59 番目の三角数、^{[ 15 ]}六角数、^{[ 14 ]}セブンティーンセブンティ、オーストラリアの町
1771 = 正四面体数^{[ 60 ]}
1772 = 中心七角数、^{[ 86 ]}最初の 76 個の整数のトーシェント関数の合計
1774 = 15個のノードと5個の葉を持つ根付きアイデンティティツリーの数^{[ 251 ]}
1776 = 24 番目の正方形の星の数。^{[ 252 ]} 7 × 7 × 7 × 7 のルービックテセラクトで見ることができるピースの数。
1780 = E (1, 0) と N (0, 1) をステップとして使用し、対角線 y = x を偶数回水平に横切る (0, 0) から (7, 7) への格子経路の数^{[ 253 ]}
1781 = e の最初の 1781 桁は素数を形成する^{[ 254 ]}
1782 = 七角数^{[ 128 ]}
1783 =ド・ポリニャック素数^{[ 177 ]}
1784 = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12} の部分集合の数で、異なる要素の任意のペアが異なる商を持つもの^{[ 255 ]}
1785 = 正四角錐数、^{[ 112 ]}三角マッチ棒数^{[ 228 ]}
1786 =中心三角数^{[ 56 ]}
1787 =超素数、11個の連続する素数の合計 (137 + 139 + 149 + 151 + 157 + 163 + 167 + 173 + 179 + 181 + 191)
1788 = -1, -2, ..., -34 のオイラー変換^{[ 256 ]}
1790 = 50を互いに素な部分に分割する数^{[ 218 ]}
1791 = 最大で 4 つの六角数の和として表すことができない最大の自然数。
1792 =グランビル番号
1793 = 半径24の円の内側の格子点の数^{[ 51 ]}
1794 = 9角数、^{[ 98 ]} 1 を部分として含まない 33 の分割の数^{[ 17 ]}
1795 = 周囲長が 38 の七角形の数^{[ 257 ]}
1799 = 2 × 30 ² − 1 =双子の正方形^{[ 258 ]}

1800年から1899年

1801 =キューバ素数、5 個と 9 個の連続素数 (349 + 353 + 359 + 367 + 373 および 179 + 181 + 191 + 193 + 197 + 199 + 211 + 223 + 227) の合計^{[ 215 ]}
1803 =平行移動や 180 度回転では平面を等面体でタイル張りできない10 六角形の数(コンウェイ基準) ^{[ 259 ]}
1806 = プロニック数、^{[ 22 ]}シルベスター数列の最初の 4 項の積、一次擬完全数、^{[ 260 ]} nがn番目のベルヌーイ数の分母に等しい唯一の数、^{[ 261 ]}シュレーダー数^{[ 262 ]}
1807 = シルベスター数列の第 5 項^{[ 263 ]}
1808 = 43個の円を描くことで平面を分割できる最大領域数^{[ 135 ]}
1809 = 最初の 17 個のスーパー素数の合計^{[ 264 ]}
1810年= $\sum _{k=0}^{4}{\binom {4}{k}}^{4}$ ^{[ 265 ]}
1811年＝ソフィー・ジェルマンが誕生
1813 = 26個のセルを持つポリオミノの数、2つの直交軸に関して対称^{[ 266 ]}
1814 = 1 + 6 + 36 + 216 + 1296 + 216 + 36 + 6 + 1 = 6のべき乗の三角形の4行目の合計^{[ 267 ]}
1817 = 20のすべての分割における素数部分の総数^{[ 268 ]}
1820 = 五角数、^{[ 31 ]}五面体数、^{[ 139 ]}ラン長が弱増加または弱減少する 13 の構成の数^{[ 269 ]}
1821 = ミアン-チョウラ系列のメンバー^{[ 9 ]}
1822 = 異なる部分が接続されている 43 の整数分割の数^{[ 270 ]}
1823 =超素数、安全な素数^{[ 11 ]}
1824 = 43 ² - 5 ²、1824 を素数の平方の差として表現する唯一の方法^{[ 226 ]}
1825 =八角数^{[ 75 ]}
1826 = 十角錐数^{[ 271 ]}
1827 =吸血鬼の番号^{[ 119 ]}
1828 =メアンドリック数、オープンメアンドリック数、eの最初の 10 桁に2 回出現
1829 = 複合ド・ポリニャック数^{[ 93 ]}
1830 = 60 番目の三角数^{[ 15 ]}
1831 = 次の素数 (1847) とのギャップがちょうど 16 の最小の素数^{[ 272 ]}
1832 = 最初の77個の整数のトーシェント関数の合計
1833 = 13個の殻を持つ十面体の原子の数^{[ 273 ]}
1834 = 正八面体数、^{[ 70 ]}最初の5つの素数の立方和
1835 = 分子の絶対値 $D_{6}^{(5)}$ ^{[ 274 ]}
1836 =陽子が電子よりも質量が大きい係数
1837 = 星番号^{[ 36 ]}
1841年= 3種類の額面と29種類の切手による切手問題の解決策、^{[ 275 ]}
1842 = 11個のノードを持つラベルなしの根付き木の数^{[ 276 ]}
1843 = k は、phi(k) が完全立方数であるような値であり、^{[ 277 ]}メルテンス関数はゼロである。
1844 = 3 ⁷ - 7 ³ , ^{[ 278 ]}メルテンス関数ゼロ
1845 = 少なくとも 1 つの素数を含む 25 の分割の数、^{[ 279 ]}メルテンス関数ゼロ
1847 =超素数
1848 = 次数が 42 の 2 つのサイクルグラフの結合におけるエッジの数^{[ 100 ]}
1849 = 43 ^2、6進数で回文数 (= 12321 ₆ )、中心八角数^{[ 103 ]}
1850 = 59を素数に分割する数
1851 = 最初の32個の素数の合計
1853 = 27番目の素数の原始根の合計、^{[ 280 ]}メルテンス関数ゼロ
1854 = 固定点を持たない 7 つの要素の順列の数、^{[ 281 ]}メルテンス関数ゼロ
1855 = rencontres number: [7] の順列のうち、ちょうど 1 つの固定点を持つものの数^{[ 282 ]}
1856 = 最初の78個の整数のトーシェント関数の合計
1857 = メルテンス関数ゼロ、風車番号^{[ 130 ]}
1858 =立体異性体を無視した炭素数 C ₁₄ H ₃₀^{[ 283 ]}
1859 = 複合ド・ポリニャック数^{[ 93 ]}
1860 = 30次のアステカダイヤモンドの正方形の数^{[ 284 ]}
1861 = 中心化された平方数、^{[ 8 ]}メルテンス関数ゼロ
1862年は、2番目の定義において1863年とルツとアーロンのペアを形成する。
1863年＝2番目の定義では1862年とルツとアーロンのペアを形成する
1865 = 12345 ₆ : 最大の6進メタドローム (6進数で数字が厳密に昇順になっている数) ^{[ 285 ]}
1866 = 行数が最大 2 行の 16 の平面分割の数^{[ 286 ]}
1867 =ポリニャック素数^{[ 177 ]}
1868 = 複雑さ21の最小数: +、*、^を使用して構築するために21個の1を必要とする最小数^{[ 155 ]}
1870 = 十角数^{[ 143 ]}
1871 = 2 つの連続する双子素数ペア (1871, 1873) と (1877, 1879) の最初の素数^{[ 287 ]}
1872 = 完全グラフの最初のザグレブ指数 K ₁₃^{[ 156 ]}
1873 = 21年後のナラヤナの牛と子牛の数^{[ 124 ]}
1880 = ルーカス数の自己畳み込みの 10 番目の要素^{[ 288 ]}
1881 =三頂角柱番号^{[ 289 ]}
1882 = 4 変数の線形分離可能なブール関数の数^{[ 290 ]}
1883 = 交替群 A _{28の共役クラスの数}^{[ 171 ]}
1886 = 6 ⁴を4 乗に分割する数^{[ 291 ]}
1887 =六角三角形T(34)の辺の数^{[ 53 ]}
1889 = ソフィー・ジェルマン素数、非常にコトーシェント数^{[ 20 ]}
1891 = 61 番目の三角数、^{[ 15 ]} 5 つの連続する素数 ( $367 + 373 + 379 + 383 + 389$ ) の和六角数、^{[ 14 ]}中心五角数、^{[ 21 ]}中心三角数^{[ 56 ]}
1892 = プロニック数^{[ 22 ]}
1894 = 44個の円を描くことで平面を分割できる領域の最大数^{[ 135 ]}
1896 = ミアン・チョウラ系列のメンバー^{[ 9 ]}
1897 = パドバン数列のメンバー、^{[ 33 ]} 9 頂点の三角形を含まないグラフの数^{[ 292 ]}

1900年から1999年

1900 = 素数の数 <= 2 ¹⁴^{[ 12 ]}
1901 = ソフィー・ジェルマン素数、中心十角数
1902 = 27 ^[²⁹³^]の対称平面分割の数
1903 = 一般化カタルーニャ数^{[ 294 ]}
1905 =フェルマー擬素数^{[ 295 ]}
1907 = 安全な素数、^{[ 11 ]}バランスの取れた素数^{[ 38 ]}
1908 = 完全な数^{[ 163 ]}
1909 =超完全数^{[ 296 ]}
1910 = ちょうど 1 つの固定点を持つ 13 の構成の数^{[ 297 ]}
1911 = 七角錐数^{[ 168 ]}
1912 = ポットリミットポーカーでブラインド1つ後の最大6回目のレイズのサイズ^{[ 298 ]}
1913 =超素数、ホナカー素数^{[ 153 ]}
1915 = 位数 5 の非同型半群の数^{[ 299 ]}
1917 = 51 を互いに素な部分に分割する数^{[ 218 ]}
1918 = 七角数^{[ 128 ]}
1919 = 10進数で周期の長さ36の逆数を持つ最小の数^{[ 300 ]}
1920 =連続する三角数 120 と 136 の間の非三角数の合計、
1923 = 2 × 31 ² + 1 = 0 から 31 までの整数エントリを持つ異なる 2 X 2 行列式の数^{[ 117 ]}
1925 = 24 を順序のない和の順序のない積として表す方法の数^{[ 43 ]}
1926 = 五角数^{[ 31 ]}
1928 = 2^2^...^2 (13 個の 2 と括弧をすべての可能な方法で挿入) が取る異なる値の数^{[ 301 ]}
1929 = メルテンス関数ゼロ、異なる部分が接続されている42の整数分割の数^{[ 270 ]}
1930 = xとx+1の素因数がすべて53以下であるような連続する整数x、x+1のペアの数^{[ 166 ]}
1931年＝ソフィー・ジェルマン全盛期
1932 = 40を素数のべき乗に分割する数^{[ 302 ]}
1933 = 中心七角数、^{[ 86 ]}ホナカー素数^{[ 153 ]}
1934 = 最初の79個の整数のトーシェント関数の合計
1935 = 次数が 43 の 2 つのサイクルグラフの結合におけるエッジの数^{[ 100 ]}
1937 = 12空間内のキラルn-オミノの数、1つのセルは^{[ 303 ]とラベル付けされている。}
1938 = メルテンス関数ゼロ、辺の長さが22の正八面体の表面上の点の数^{[ 73 ]}
1939 = 7-クネーデル数^{[ 61 ]}
1940 = マホニアン数: T(8, 9) ^{[ 107 ]}
1941 = 円周上の 16 点を直線で結んで得られる領域の最大数^{[ 304 ]}
1942 = 10k + 1、10k + 3、10k + 7、10k + 9、10k + 13 が素数となる数 k ^{[ 305 ]}
1943 = 異なる十四角数の合計ではない最大の数^{[ 306 ]}
1944 = 3-滑らかな数 (2 ³ ×3 ⁵ )、アキレス数^{[ 184 ]}
1945 = 25を互いに素な部分に分割し、その部分の重複度も互いに素であるような分割の数^{[ 307 ]}
1947 = k であり、5·2 ^k + 1 はある m に対してFermat 数 2 ^{2 ^m} + 1の素因数である^{[ 308 ]}
1948 = 20 の厳密な固体分割の数^{[ 37 ]}
1949 = 44 ²より大きい最小の素数。^{[ 309 ]}
1950年= $1\cdot 2\cdot 3+4\cdot 5\cdot 6+7\cdot 8\cdot 9+10\cdot 11\cdot 12$ [ ³¹⁰^{]異なる十五角数}^の合計ではない最大の数^{[ 306 ]}
1951 = キューバの素数^{[ 215 ]}
1952 = {1, 2, 3, 4} のカバーの数^{[ 311 ]}
1953 = 六角柱数、^{[ 312 ]} 62 番目の三角数^{[ 15 ]}
1955 = 少なくとも 1 つの異なる部分を持つ 25 の分割の数^{[ 183 ]}
1956 = ^{98の九角数}
1957年= $\sum _{k=0}^{6}{\frac {6!}{k!}}$ = 6 要素セットからの異なる要素の順序付き k タプル (k=0,1,2,3,4,5,6) の総数^{[ 313 ]}
1958 = 25 の分割数^{[ 118 ]}
1960 = 33を異なる部分に分割したすべての部分の数^{[ 109 ]}
1961 = 半径25の円の内側の格子点の数^{[ 51 ]}
1962 = number of edges in the join of the complete graph K₃₆ and the cycle graph C₃₆^[314]
1963! - 1 is prime^[315]
1964 = number of linear forests of planted planar trees with 8 nodes^[316]
1965 = total number of parts in all partitions of 17^[317]
1966 = sum of totient function for first 80 integers
1967 = least edge-length of a square dissectable into at least 30 squares in the Mrs. Perkins's quilt problem^[318]
σ(1968) = σ(1967) + σ(1966)^[319]
1969 = Only value less than four million for which a "mod-ification" of the standard Ackermann Function does not stabilize^[320]
1970 = number of compositions of two types of 9 having no even parts^[321]
1972 = n such that ${\frac {n^{37}-1}{n-1}}$ is prime^[322]
1973 = Sophie Germain prime, Leonardo prime
1974 = number of binary vectors of length 17 containing no singletons^[99]
1975 = number of partitions of 28 with nonnegative rank^[190]
1976 = octagonal number^[75]
1977 = number of non-isomorphic multiset partitions of weight 9 with no singletons^[323]
1979 = number of squares between 45² and 45⁴,^[238] smallest number that is the sum of 4 positive cubes in at least 4 ways^[324]
1980 = pronic number,^[22] highly abundant number with a greater sum of proper divisors than all smaller numbers^[325]
1981 = pinwheel number,^[130] central polygonal number^[326]
1982 = maximal number of regions the plane is divided into by drawing 45 circles,^[135] a number with the property that 3¹⁹⁸² - 1982 is prime^[327]
1984 = 11111000000 in binary, nonunitary perfect number,^[328] see also: 1984 (disambiguation)
1985 = centered square number^[8]
1986 = number of ways to write 25 as an orderless product of orderless sums^[43]
1987 = 300th prime number
1988 = sum of the first 33 primes,^[329] sum of the first 51 composite numbers^[330]
1989 = number of balanced primes less than 100,000,^[331] number of 9-step mappings with 4 inputs^[140]
1990 = Stella octangula number
1991 = 11 × 181, the 46th Gullwing number,^[332] palindromic composite number with only palindromic prime factors^[333]
1992 = number of nonisomorphic sets of nonempty subsets of a 4-set^[334]
1993 = a number with the property that 4¹⁹⁹³ - 3¹⁹⁹³ is prime,^[335] number of partitions of 30 into a prime number of parts^[213]
1995 = number of unlabeled graphs on 9 vertices with independence number 6^[336]
1997 = $\sum _{k=1}^{21}{k\cdot \phi (k)}$ ^[337]
1999 = centered triangular number,^[56] number of regular forms in a myriagram.

Prime numbers

There are 135 prime numbers between 1000 and 2000:^[338]^[339]

1009, 1013, 1019, 1021, 1031, 1033, 1039, 1049, 1051, 1061, 1063, 1069, 1087, 1091, 1093, 1097, 1103, 1109, 1117, 1123, 1129, 1151, 1153, 1163, 1171, 1181, 1187, 1193, 1201, 1213, 1217, 1223, 1229, 1231, 1237, 1249, 1259, 1277, 1279, 1283, 1289, 1291, 1297, 1301, 1303, 1307, 1319, 1321, 1327, 1361, 1367, 1373, 1381, 1399, 1409, 1423, 1427, 1429, 1433, 1439, 1447, 1451, 1453, 1459, 1471, 1481, 1483, 1487, 1489, 1493, 1499, 1511, 1523, 1531, 1543, 1549, 1553, 1559, 1567, 1571, 1579, 1583, 1597, 1601, 1607, 1609, 1613, 1619, 1621, 1627, 1637, 1657, 1663, 1667, 1669, 1693, 1697, 1699, 1709, 1721, 1723, 1733, 1741, 1747, 1753, 1759, 1777, 1783, 1787, 1789, 1801, 1811, 1823, 1831, 1847, 1861, 1867, 1871, 1873, 1877, 1879, 1889, 1901, 1907, 1913, 1931, 1933, 1949, 1951, 1973, 1979, 1987, 1993, 1997, 1999

Notes

References

↑"chiliad". Merriam-Webster.{{cite web}}: CS1 maint: url-status (link)
↑Sloane, N. J. A. (ed.). "SequenceA195163(1000-gonal numbers: a(n) equal to n*(499*n - 498))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA122189(Heptanacci numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA036063(Increasing gaps among twin primes: size)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA332307(Array read by antidiagonals: T(m,n) is the number of (undirected) Hamiltonian paths in the m X n grid graph)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 8 January 2023.
1 2Sloane, N. J. A. (ed.). "SequenceA020473(Egyptian fractions: number of partitions of 1 into reciprocals of positive integers <= n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15Sloane, N. J. A. (ed.). "SequenceA005384(Sophie Germain primes p: 2p+1 is also prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2 3 4 5 6 7 8 9Sloane, N. J. A. (ed.). "SequenceA001844(Centered square numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2 3 4 5 6 7 8Sloane, N. J. A. (ed.). "SequenceA005282(Mian-Chowla sequence)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2 3Sloane, N. J. A. (ed.). "SequenceA005897(6*n^2 + 2 for n > 0)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2 3 4 5 6 7 8 9 10 11 12Sloane, N. J. A. (ed.). "SequenceA005385(Safe primes p: (p-1)/2 is also prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2Sloane, N. J. A. (ed.). "SequenceA007053(Number of primes <= 2^n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA004023(Indices of prime repunits: numbers n such that 11...111 (with n 1's)... is prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2 3 4 5 6 7 8 9Sloane, N. J. A. (ed.). "SequenceA000384(Hexagonal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18Sloane, N. J. A. (ed.). "SequenceA000217(Triangular numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA007522(Primes of the form 8n+7, that is, primes congruent to -1 mod 8)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 10 October 2023.
1 2 3Sloane, N. J. A. (ed.). "SequenceA002865(Number of partitions of n that do not contain 1 as a part)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA000025(Coefficients of the 3rd-order mock theta function f(q))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA336130(Number of ways to split a strict composition of n into contiguous subsequences all having the same sum)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2 3 4 5 6 7Sloane, N. J. A. (ed.). "SequenceA100827(Highly cototient numbers: records for a(n) in A063741)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2 3 4 5 6 7 8 9Sloane, N. J. A. (ed.). "SequenceA005891(Centered pentagonal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2 3 4 5 6 7 8 9Sloane, N. J. A. (ed.). "SequenceA002378(Oblong (or promic, pronic, or heteromecic) numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA003294(Numbers k such that k^4 can be written as a sum of four positive 4th powers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA007504(Sum of the first n primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA127337(Numbers that are the sum of 10 consecutive primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA006879(Number of primes with n digits.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA347565(Primes p such that A241014(A000720(p)) is +1 or -1)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2Sloane, N. J. A. (ed.). "SequenceA006567(Emirps (primes whose reversal is a different prime))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA273873(Number of strict trees of weight n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA073592(Euler transform of negative integers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2 3 4 5 6 7 8 9 10Sloane, N. J. A. (ed.). "SequenceA000326(Pentagonal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2Sloane, N. J. A. (ed.). "SequenceA067128(Ramanujan's largely composite numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2 3Sloane, N. J. A. (ed.). "SequenceA000931(Padovan sequence)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA006753(Smith numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA031157(Numbers that are both lucky and prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2 3 4 5Sloane, N. J. A. (ed.). "SequenceA003154(Centered 12-gonal numbers. Also star numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2 3Sloane, N. J. A. (ed.). "SequenceA323657(Number of strict solid partitions of n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2 3 4 5 6 7 8 9Sloane, N. J. A. (ed.). "SequenceA006562(Balanced primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2Sloane, N. J. A. (ed.). "SequenceA007629(Repfigit (REPetitive FIbonacci-like diGIT) numbers (or Keith numbers))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA319560(Number of non-isomorphic strict T_0 multiset partitions of weight n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA028916(Friedlander-Iwaniec primes: Primes of form a^2 + b^4)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2 3 4Sloane, N. J. A. (ed.). "SequenceA000009(Expansion of Product_{m > 0} (1 + x^m); number of partitions of n into distinct parts; number of partitions of n into odd parts)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2 3 4Sloane, N. J. A. (ed.). "SequenceA318949(Number of ways to write n as an orderless product of orderless sums)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2Sloane, N. J. A. (ed.). "SequenceA006748(Number of diagonally symmetric polyominoes with n cells)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA210000(Number of unimodular 2 X 2 matrices having all terms in {0,1,...,n})". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA033995(Number of bipartite graphs with n nodes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2Sloane, N. J. A. (ed.). "SequenceA076980(Leyland numbers: 3, together with numbers expressible as n^k + k^n nontrivially, i.e., n,k > 1 (to avoid n = (n-1)^1 + 1^(n-1)))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA062801(Number of 2 X 2 non-singular integer matrices with entries from {0,...,n})". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2 3 4 5 6Sloane, N. J. A. (ed.). "SequenceA000096(n*(n+3)/2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Van Ekeren, Jethro; Lam, Ching Hung; Möller, Sven; Shimakura, Hiroki (2021). "Schellekens' list and the very strange formula". Advances in Mathematics. 380 107567. Amsterdam: Elsevier. arXiv:2005.12248. doi:10.1016/j.aim.2021.107567. MR 4200469. S2CID 218870375. Zbl 1492.17027.
1 2 3 4 5 6 7Sloane, N. J. A. (ed.). "SequenceA000328". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA001608(Perrin sequence)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2 3Sloane, N. J. A. (ed.). "SequenceA140091(3*n*(n + 3)/2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA005380". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA051026(Number of primitive subsequences of 1, 2, ..., n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2 3 4 5 6 7 8 9 10Sloane, N. J. A. (ed.). "SequenceA005448(Centered triangular numbers: 3n(n-1)/2 + 1)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA080040(2*a(n-1) + 2*a(n-2) for n > 1)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA264237(Sum of values of vertices at level n of the hyperbolic Pascal pyramid)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2Sloane, N. J. A. (ed.). "SequenceA033991(n*(4*n-1))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2 3 4"Sloane's A000292 : Tetrahedral numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.
1 2 3 4 5 6Sloane, N. J. A. (ed.). "SequenceA208155(7-Knödel numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA006315(Numbers n such that n^32 + 1 is prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA185982(Triangle read by rows: number of set partitions of n elements with k connectors)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2 3 4 5Sloane, N. J. A. (ed.). "SequenceA050993(5-Knödel numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑"1150 (number)". The encyclopedia of numbers.
1 2"Sloane's A000101 : Increasing gaps between primes (upper end)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 10 July 2016.
1 2"Sloane's A097942 : Highly totient numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.
1 2 3 4"Sloane's A080076 : Proth primes". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.
1 2 3Sloane, N. J. A. (ed.). "SequenceA005893(Number of points on surface of tetrahedron; coordination sequence for sodalite net (equals 2*n^2+2 for n > 0))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2 3"Sloane's A005900 : Octahedral numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.
↑"Sloane's A069125 : a(n) = (11*n^2 - 11*n + 2)/2". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.
↑"1157 (number)". The encyclopedia of numbers.
1 2 3Sloane, N. J. A. (ed.). "SequenceA005899(Number of points on surface of octahedron)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2Sloane, N. J. A. (ed.). "SequenceA001845(Centered octahedral numbers (crystal ball sequence for cubic lattice))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2 June 2022.
1 2 3 4 5Sloane, N. J. A. (ed.). "SequenceA000567(Octagonal numbers: n*(3*n-2). Also called star numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA055887(Number of ordered partitions of partitions)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑"A000256 - OEIS". oeis.org.
↑"1179 (number)". The encyclopedia of numbers.
↑"A000031 - OEIS". oeis.org.
↑Higgins, Peter (2008). Number Story: From Counting to Cryptography. New York: Copernicus. p. 61. ISBN 978-1-84800-000-1.
1 2"Sloane's A042978 : Stern primes". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.
1 2Sloane, N. J. A. (ed.). "SequenceA005449(Second pentagonal numbers: n*(3*n + 1)/2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2Sloane, N. J. A. (ed.). "SequenceA002061(Central polygonal numbers: n^2 - n + 1)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑"A175654 - OEIS". oeis.org.
1 2 3 4 5 6Sloane, N. J. A. (ed.). "SequenceA024916(Sum_1^n sigma(k))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2 3 4 5 6Sloane, N. J. A. (ed.). "SequenceA069099(Centered heptagonal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2Sloane, N. J. A. (ed.). "SequenceA080663(3*n^2 - 1)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Meehan, Eileen R., Why TV is not our fault: television programming, viewers, and who's really in control Lanham, MD: Rowman & Littlefield, 2005
1 2Sloane, N. J. A. (ed.). "SequenceA051890(2*(n^2 - n + 1))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑"A265070 - OEIS". oeis.org.
↑"1204 (number)". The encyclopedia of numbers.
↑Sloane, N. J. A. (ed.). "SequenceA240574(Number of partitions of n such that the number of odd parts is a part)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2 3 4 5 6 7 8Sloane, N. J. A. (ed.). "SequenceA098237(Composite de Polignac numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA337070(Number of strict chains of divisors starting with the superprimorial A006939(n))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Higgins, ibid.
↑Sloane, N. J. A. (ed.). "SequenceA000070(Sum_{0..n} A000041(k))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2Sloane, N. J. A. (ed.). "SequenceA053767(Sum of first n composite numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2 3 4 5 6"Sloane's A001106 : 9-gonal (or enneagonal or nonagonal) numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.
1 2Sloane, N. J. A. (ed.). "SequenceA006355(Number of binary vectors of length n containing no singletons)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2 3 4 5 6 7 8Sloane, N. J. A. (ed.). "Sequencen*(n+2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑"Sloane's A001110 : Square triangular numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.
↑"A046177 - OEIS". oeis.org. Retrieved 18 December 2024.
1 2 3 4"Sloane's A016754 : Odd squares: a(n) = (2n+1)^2. Also centered octagonal numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.
↑Sloane, N. J. A. (ed.). "SequenceA303815(Generalized 29-gonal (or icosienneagonal) numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA249911(60-gonal (hexacontagonal) numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑"A004111 - OEIS". oeis.org.
1 2Sloane, N. J. A. (ed.). "SequenceA008302(Triangle of Mahonian numbers T(n,k): coefficients in expansion of Product{0..n-1} (1 + x + ... + x^i), where k ranges from 0 to A000217(n-1). Also enumerates permutations by their major index)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑"A006154 - OEIS". oeis.org.
1 2 3Sloane, N. J. A. (ed.). "SequenceA015723(Number of parts in all partitions of n into distinct parts)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2 3 4 5 6 7Sloane, N. J. A. (ed.). "SequenceA054735(Sums of twin prime pairs)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑"A160160 - OEIS". oeis.org.
1 2 3Sloane, N. J. A. (ed.). "SequenceA000330(Square pyramidal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑"Sloane's A005898 : Centered cube numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.
↑Sloane, N. J. A. (ed.). "SequenceA126796(Number of complete partitions of n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑oeis.org/A305843
↑"Sloane's A033819 : Trimorphic numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.
1 2 3 4Sloane, N. J. A. (ed.). "SequenceA058331(2*n^2 + 1)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2 3Sloane, N. J. A. (ed.). "SequenceA000041(a(n) is the number of partitions of n (the partition numbers))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2 3 4 5"Sloane's A014575 : Vampire numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.
1 2"Sloane's A002182 : Highly composite numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.
1 2 3Sloane, N. J. A. (ed.). "SequenceA003238(Number of rooted trees with n vertices in which vertices at the same level have the same degree)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2 3Sloane, N. J. A. (ed.). "SequenceA072895(Least k for the Theodorus spiral to complete n revolutions)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2Sloane, N. J. A. (ed.). "SequenceA084849(1 + n + 2*n^2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2Sloane, N. J. A. (ed.). "SequenceA000930(Narayana's cows sequence)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA001792((n+2)*2^(n-1))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA216492(Number of inequivalent connected planar figures that can be formed from n 1 X 2 rectangles (or dominoes) such that each pair of touching rectangles shares exactly one edge, of length 1, and the adjacency graph of the rectangles is a tree)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA007318(Pascal's triangle read by rows)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2 3 4 5 6Sloane, N. J. A. (ed.). "SequenceA000566(Heptagonal numbers (or 7-gonal numbers): n*(5*n-3)/2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA006872(Numbers k such that phi(k) equals phi(sigma(k)))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2 3 4 5 6Sloane, N. J. A. (ed.). "SequenceA059993(Pinwheel numbers: 2*n^2 + 6*n + 1)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA000055(Number of trees with n unlabeled nodes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑"A061256 - OEIS". oeis.org.
1 2"Sloane's A002559 : Markoff (or Markov) numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.
1 2Sloane, N. J. A. (ed.). "SequenceA005894(Centered tetrahedral numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2 3 4 5 6 7Sloane, N. J. A. (ed.). "SequenceA014206(n^2 + n + 2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑"A316473 - OEIS". oeis.org.
↑Sloane, N. J. A. (ed.). "SequenceA001610(a(n-1) + a(n-2) + 1)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA000032(Lucas numbers: L(n-1) + L(n-2))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2"Sloane's A000332 : Binomial coefficient binomial(n,4) = n*(n-1)*(n-2)*(n-3)/24". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.
1 2Sloane, N. J. A. (ed.). "SequenceA005945(Number of n-step mappings with 4 inputs)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA000111(Euler or up/down numbers: e.g.f. sec(x) + tan(x))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑"Sloane's A001567 : Fermat pseudoprimes to base 2". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.
1 2 3"Sloane's A001107 : 10-gonal (or decagonal) numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.
↑"Sloane's A050217 : Super-Poulet numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.
↑Sloane, N. J. A. (ed.). "SequenceA054552(4*n^2 - 3*n + 1)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA109308(Lesser emirps (primes whose digit reversal is a larger prime))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2Sloane, N. J. A. (ed.). "SequenceA051400(Smallest value of x such that M(x) equals n, where M() is Mertens's function A002321)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑"Sloane's A000682 : Semimeanders". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.
↑Sloane, N. J. A. (ed.). "SequenceA002445(Denominators of Bernoulli numbers B_{2n})". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
12Sloane, N. J. A. (ed.). "SequenceA001359(Lesser of twin primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA001764(binomial(3*n,n)/(2*n+1) (enumerates ternary trees and also noncrossing trees))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑"Sloane's A000108 : Catalan numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.
1 2 3 4Sloane, N. J. A. (ed.). "SequenceA033548(Honaker primes: primes P(k) such that sum of digits of P(k) equals sum of digits of k)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2 3Sloane, N. J. A. (ed.). "SequenceA006832(Discriminants of totally real cubic fields)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2Sloane, N. J. A. (ed.). "SequenceA003037(Smallest number of complexity n: smallest number requiring n 1's to build using +, * and ^)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2Sloane, N. J. A. (ed.). "SequenceA011379(n^2*(n+1))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Hadamard, J. (1893), "Résolution d'une question relative aux déterminants", Bulletin des Sciences Mathématiques, 17: 240–246
↑Fujiwara, M. (2005), Introduction to Truly Beautiful Mathematics, pp. 100–101
↑Sloane, N. J. A. (ed.). "SequenceA028569(n*(n + 9))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA085831(Sum_1^{2^n} d(k) where d(k) is the number of divisors of k (A000005))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA064410(Number of partitions of n with zero crank)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑"Sloane's A002411 : Pentagonal pyramidal numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.
1 2 3 4Sloane, N. J. A. (ed.). "SequenceA307958(Coreful perfect numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑"Sloane's A000078 : Tetranacci numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.
1 2Sloane, N. J. A. (ed.). "SequenceA084647(Hypotenuses for which there exist exactly 3 distinct integer triangles)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2Sloane, N. J. A. (ed.). "SequenceA002071(Number of pairs of consecutive integers x, x+1 such that all prime factors of both x and x+1 are at most the n-th prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA071395(Primitive abundant numbers (abundant numbers all of whose proper divisors are deficient numbers))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2Sloane, N. J. A. (ed.). "SequenceA002413(Heptagonal (or 7-gonal) pyramidal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA018000(Powers of cube root of 9 rounded down)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA038147(Number of polyhexes with n cells)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2Sloane, N. J. A. (ed.). "SequenceA000702(number of conjugacy classes in the alternating group A_n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA001970(Functional determinants; partitions of partitions; Euler transform applied twice to all 1's sequence)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA000084(Number of series-parallel networks with n unlabeled edges. Also called yoke-chains by Cayley and MacMahon)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA000615(Threshold functions of exactly n variables)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA000057(Primes dividing all Fibonacci sequences)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA002720(Number of partial permutations of an n-set; number of n X n binary matrices with at most one 1 in each row and column)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2 3 4Sloane, N. J. A. (ed.). "SequenceA065381(Primes not of the form p + 2^k)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA140090(n*(3*n + 7)/2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2Sloane, N. J. A. (ed.). "SequenceA008406(Triangle T(n,k) read by rows, giving number of graphs with n nodes and k edges))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA000014(Number of series-reduced trees with n nodes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA057660(Sum_{1..n} n/gcd(n,k))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA088319(Ordered hypotenuses of primitive Pythagorean triangles having legs that add up to a square)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2Sloane, N. J. A. (ed.). "SequenceA144300(Number of partitions of n minus number of divisors of n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2Sloane, N. J. A. (ed.). "SequenceA052486(Achilles numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑"Sloane's A005231 : Odd abundant numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.
↑Sloane, N. J. A. (ed.). "SequenceA033428(3*n^2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA326123(a(n) is the sum of all divisors of the first n odd numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA006327(Fibonacci(n) - 3. Number of total preorders)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑"Sloane's A000045 : Fibonacci numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.
1 2Sloane, N. J. A. (ed.). "SequenceA064174(Number of partitions of n with nonnegative rank)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA023360(Number of compositions of n into prime parts)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA103473(Number of polyominoes consisting of 7 regular unit n-gons)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA022004(Initial members of prime triples (p, p+2, p+6))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2Sloane, N. J. A. (ed.). "SequenceA018805". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA059845(n*(3*n + 11)/2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA006489(Numbers k such that k-6, k, and k+6 are primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA213427(Number of ways of refining the partition n^1 to get 1^n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA134602(Composite numbers such that the square mean of their prime factors is a nonprime integer (where the prime factors are taken with multiplicity and the square mean of c and d is sqrt((c^2+d^2)/2)))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA084990(n*(n^2+3*n-1)/3)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA077068(Semiprimes of the form prime + 1)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA115160(Numbers that are not the sum of two triangular numbers and a fourth power)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2Sloane, N. J. A. (ed.). "SequenceA046092(4 times triangular numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA071399(Rounded volume of a regular tetrahedron with edge length n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA001339(Sum_{0..n} (k+1)! binomial(n,k))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA007290(2*binomial(n,3))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA058360(Number of partitions of n whose reciprocal sum is an integer)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA046931(Prime islands: least prime whose adjacent primes are exactly 2n apart)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑"Sloane's A001599 : Harmonic or Ore numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.
↑Sloane, N. J. A. (ed.). "SequenceA001770(Numbers k such that 5*2^k - 1 is prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA056613(Number of n-celled pseudo still lifes in Conway's Game of Life, up to rotation and reflection)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA068140(Smaller of two consecutive numbers each divisible by a cube greater than one)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA030272(Number of partitions of n^3 into distinct cubes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2Sloane, N. J. A. (ed.). "SequenceA038499(Number of partitions of n into a prime number of parts)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA018818(Number of partitions of n into divisors of n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2 3"Sloane's A002407 : Cuban primes". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.
↑Sloane, N. J. A. (ed.). "SequenceA050710(Smallest composite that when added to sum of prime factors reaches a prime after n iterations)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA046376(Palindromes with exactly 2 palindromic prime factors (counted with multiplicity), and no other prime factors)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2 3Sloane, N. J. A. (ed.). "SequenceA051424(Number of partitions of n into pairwise relatively prime parts)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA059802(Numbers k such that 5^k - 4^k is prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA082982(Numbers k such that k, k+1 and k+2 are sums of 2 squares)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA061068(Primes which are the sum of a prime and its subscript)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA057562(Number of partitions of n into parts all relatively prime to n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA000230(smallest prime p such that there is a gap of exactly 2n between p and next prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA261983(Number of compositions of n such that at least two adjacent parts are equal)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA053781(Numbers k that divide the sum of the first k composite numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2Sloane, N. J. A. (ed.). "SequenceA090781(Numbers that can be expressed as the difference of the squares of primes in just one distinct way)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA098859(Number of partitions of n into parts each of which is used a different number of times)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2Sloane, N. J. A. (ed.). "SequenceA045943(Triangular matchstick numbers: 3*n*(n+1)/2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2 June 2022.
↑Sloane, N. J. A. (ed.). "SequenceA286518(Number of finite connected sets of positive integers greater than one with least common multiple n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA004041(Scaled sums of odd reciprocals: (2*n + 1)!!*(Sum_{0..n} 1/(2*k + 1)))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA023359(Number of compositions (ordered partitions) of n into powers of 2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA000787(Strobogrammatic numbers: the same upside down)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA001157(sigma_2(n): sum of squares of divisors of n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑"Sloane's A000073 : Tribonacci numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.
↑Sloane, N. J. A. (ed.). "SequenceA020989((5*4^n - 2)/3)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA301700(Number of aperiodic rooted trees with n nodes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA056045("Sum_{d divides n}(binomial(n,d))")". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2Sloane, N. J. A. (ed.). "SequenceA028387(n + (n+1)^2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑"Sloane's A007850 : Giuga numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.
↑Sloane, N. J. A. (ed.). "SequenceA161757((prime(n))^2 - (nonprime(n))^2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA078374(Number of partitions of n into distinct and relatively prime parts)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA005918(Number of points on surface of square pyramid: 3*n^2 + 2 (n>0))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA167008(Sum_{0..n} C(n,k)^k)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA350507(Number of (not necessarily connected) unit-distance graphs on n nodes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA102627(Number of partitions of n into distinct parts in which the number of parts divides n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA338470(Number of integer partitions of n with no part dividing all the others)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA144391(3*n^2 + n - 1)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA325349(Number of integer partitions of n whose augmented differences are distinct)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA216955(number of binary sequences of length n and curling number k)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA001523(Number of stacks, or planar partitions of n; also weakly unimodal compositions of n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA055327(Triangle of rooted identity trees with n nodes and k leaves)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA045944(Rhombic matchstick numbers: n*(3*n+2))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA005317((2^n + C(2*n,n))/2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA064118(Numbers k such that the first k digits of e form a prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA325860(Number of subsets of {1..n} such that every pair of distinct elements has a different quotient)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA073592(Euler transform of negative integers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA288253(Number of heptagons that can be formed with perimeter n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA056220(2*n^2 - 1)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA075213(Number of polyhexes with n cells that tile the plane isohedrally but not by translation or by 180-degree rotation (Conway criterion))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑"Sloane's A054377 : Primary pseudoperfect numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.
↑Kellner, Bernard C.; 'The equation denom(B_n) = n has only one solution'
↑Sloane, N. J. A. (ed.). "SequenceA006318(Large Schröder numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 22 May 2016.
↑"Sloane's A000058 : Sylvester's sequence". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.
↑Sloane, N. J. A. (ed.). "SequenceA083186(Sum of first n primes whose indices are primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA005260(Sum_{0..n} binomial(n,k)^4)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA056877(Number of polyominoes with n cells, symmetric about two orthogonal axes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA061801((7*6^n - 2)/5)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA037032(Total number of prime parts in all partitions of n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA332835(Number of compositions of n whose run-lengths are either weakly increasing or weakly decreasing)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2 June 2022.
1 2Sloane, N. J. A. (ed.). "SequenceA304716(Number of integer partitions of n whose distinct parts are connected)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA007585(10-gonal (or decagonal) pyramidal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA000230(smallest prime p such that there is a gap of exactly 2n between p and next prime, or -1 if no such prime exists)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA004068(Number of atoms in a decahedron with n shells)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA001905(From higher-order Bernoulli numbers: absolute value of numerator of D-number D2n(2n-1))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA001208(solution to the postage stamp problem with 3 denominations and n stamps)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA000081(Number of unlabeled rooted trees with n nodes (or connected functions with a fixed point))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA039771(Numbers k such that phi(k) is a perfect cube)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA024026(3^n - n^3)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA235945(Number of partitions of n containing at least one prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA088144(Sum of primitive roots of n-th prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA000166(Subfactorial or rencontres numbers, or derangements: number of permutations of n elements with no fixed points)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA000240(Rencontres numbers: number of permutations of [n] with exactly one fixed point)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA000602(Number of n-node unrooted quartic trees; number of n-carbon alkanes C(n)H(2n+2) ignoring stereoisomers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑""Aztec Diamond"". Retrieved 20 September 2022.
↑Sloane, N. J. A. (ed.). "SequenceA023811(Largest metadrome (number with digits in strict ascending order) in base n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA000990(Number of plane partitions of n with at most two rows)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA007530(Prime quadruples: numbers k such that k, k+2, k+6, k+8 are all prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA004799(Self convolution of Lucas numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA005920(Tricapped prism numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA000609(Number of threshold functions of n or fewer variables)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA259793(Number of partitions of n^4 into fourth powers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA006785(Number of triangle-free graphs on n vertices)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA005987(Number of symmetric plane partitions of n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA023431(Generalized Catalan Numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA001567(Fermat pseudoprimes to base 2, also called Sarrus numbers or Poulet numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑"Sloane's A034897 : Hyperperfect numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.
↑Sloane, N. J. A. (ed.). "SequenceA240736(Number of compositions of n having exactly one fixed point)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA007070(4*a(n-1) - 2*a(n-2))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA027851(Number of nonisomorphic semigroups of order n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA003060(Smallest number with reciprocal of period length n in decimal (base 10))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA002845(Number of distinct values taken by 2^2^...^2 (with n 2's and parentheses inserted in all possible ways))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA023894(Number of partitions of n into prime power parts)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA045648(Number of chiral n-ominoes in (n-1)-space, one cell labeled)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA000127(Maximal number of regions obtained by joining n points around a circle by straight lines. Also number of regions in 4-space formed by n-1 hyperplanes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA178084(Numbers k for which 10k + 1, 10k + 3, 10k + 7, 10k + 9 and 10k + 13 are primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
1 2Sloane, N. J. A. (ed.). "SequenceA007419(Largest number not the sum of distinct n-th-order polygonal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA100953(Number of partitions of n into relatively prime parts such that multiplicities of parts are also relatively prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA226366(Numbers k such that 5*2^k + 1 is a prime factor of a Fermat number 2^(2^m) + 1 for some m)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA007491(Smallest prime > n^2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA319014(1*2*3 + 4*5*6 + 7*8*9 + 10*11*12 + 13*14*15 + 16*17*18 + ... + (up to n))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA055621(Number of covers of an unlabeled n-set)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA005915(Hexagonal prism numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA000522(Total number of ordered k-tuples of distinct elements from an n-element set)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA005449(Second pentagonal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA002982(Numbers n such that n! - 1 is prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA030238(Backwards shallow diagonal sums of Catalan triangle A009766)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA006128(Total number of parts in all partitions of n. Also, sum of largest parts of all partitions of n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA089046(Least edge-length of a square dissectable into at least n squares in the Mrs. Perkins's quilt problem)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA065900(Numbers n such that sigma(n) equals sigma(n-1) + sigma(n-2))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Jon Froemke & Jerrold W. Grossman (February 1993). "A Mod-n Ackermann Function, or What's So Special About 1969?". The American Mathematical Monthly. 100 (2). Mathematical Association of America: 180–183. doi:10.2307/2323780. JSTOR 2323780.
↑Sloane, N. J. A. (ed.). "SequenceA052542(2*a(n-1) + a(n-2))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA217076(Numbers n such that (n^37-1)/(n-1) is prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA302545(Number of non-isomorphic multiset partitions of weight n with no singletons)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA343971(Numbers that are the sum of four positive cubes in four or more ways)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA034090(Numbers k whose sum of proper divisors exceeds that of all smaller numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA000124(Central polygonal numbers (the Lazy Caterer's sequence): n(n+1)/2 + 1; or, maximal number of pieces formed when slicing a pancake with n cuts)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA058037(Numbers k such that 3^k - k is prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA064591(Nonunitary perfect numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA007504(Sum of the first n primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA053767(Sum of the first n composite numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑Sloane, N. J. A. (ed.). "SequenceA096711(Number of balanced primes less than 10^n.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
↑ Sloane, N. J. A. (編). "数列A187220 (ガルウィング数列)" .オンライン整数列百科事典. OEIS Foundation.
↑ Sloane, N. J. A. (編). "数列A046351 (回文素因数のみを持つ回文合成数)" .オンライン整数列百科事典. OEIS Foundation.
↑ Sloane, N. J. A. (編). "数列A000612 (n 個以下の変数を持つスイッチング関数の P-同値類の数を 2 で割った値)" .オンライン整数列百科事典. OEIS Foundation.
↑ （ OEISの配列A059801）
↑ Sloane, N. J. A. (編). "数列A263341 (行で読み取る三角形: T(n,k) は、n 個の頂点を持つ独立数 k のラベルなしグラフの数)" .オンライン整数列百科事典. OEIS Foundation.
↑ Sloane, N. J. A. (編). "数列A011755 (Sum_{1..n} k*phi(k))" .整数列オンライン百科事典. OEIS Foundation.
↑ Sloane, N. J. A. (編). "数列A038823 (n*1000 と (n+1)*1000 の間の素数の数)" .オンライン整数列百科事典. OEIS Foundation.
↑スタイン、ウィリアム A. (2017 年 2月10 日)。「リーマン予想とバーチとスウィンナートン＝ダイアー予想」。wstein.org。2021年2 月 6 日取得。

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

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

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

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

[5] Sloane, N. J. A. (ed.). "SequenceA332307(Array read by antidiagonals: T(m,n) is the number of (undirected) Hamiltonian paths in the m X n grid graph)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 8 January 2023.

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

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

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

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

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

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

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

[13] Sloane, N. J. A. (ed.). "SequenceA004023(Indices of prime repunits: numbers n such that 11...111 (with n 1's)... is prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

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

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

[16] Sloane, N. J. A. (ed.). "SequenceA007522(Primes of the form 8n+7, that is, primes congruent to -1 mod 8)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 10 October 2023.

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

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

[19] Sloane, N. J. A. (ed.). "SequenceA336130(Number of ways to split a strict composition of n into contiguous subsequences all having the same sum)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

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

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

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

[23] Sloane, N. J. A. (ed.). "SequenceA003294(Numbers k such that k^4 can be written as a sum of four positive 4th powers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

[auto20-42] 1 2 3 4Sloane, N. J. A. (ed.). "SequenceA000009(Expansion of Product_{m > 0} (1 + x^m); number of partitions of n into distinct parts; number of partitions of n into odd parts)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

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

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

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

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

[A076980-47] 1 2Sloane, N. J. A. (ed.). "SequenceA076980(Leyland numbers: 3, together with numbers expressible as n^k + k^n nontrivially, i.e., n,k > 1 (to avoid n = (n-1)^1 + 1^(n-1)))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

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

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

[50] Van Ekeren, Jethro; Lam, Ching Hung; Möller, Sven; Shimakura, Hiroki (2021). "Schellekens' list and the very strange formula". Advances in Mathematics. 380 107567. Amsterdam: Elsevier. arXiv:2005.12248. doi:10.1016/j.aim.2021.107567. MR 4200469. S2CID 218870375. Zbl 1492.17027.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

[auto59-69] 1 2 3Sloane, N. J. A. (ed.). "SequenceA005893(Number of points on surface of tetrahedron; coordination sequence for sodalite net (equals 2*n^2+2 for n > 0))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

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

[71] "Sloane's A069125 : a(n) = (11*n^2 - 11*n + 2)/2". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

[95] Higgins, ibid.

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

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

[Nonagonal_number-98] 1 2 3 4 5 6"Sloane's A001106 : 9-gonal (or enneagonal or nonagonal) numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.

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

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

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

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

[Centered_octagonal_number-103] 1 2 3 4"Sloane's A016754 : Odd squares: a(n) = (2n+1)^2. Also centered octagonal numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.

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

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

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

[A008302-107] 1 2Sloane, N. J. A. (ed.). "SequenceA008302(Triangle of Mahonian numbers T(n,k): coefficients in expansion of Product{0..n-1} (1 + x + ... + x^i), where k ranges from 0 to A000217(n-1). Also enumerates permutations by their major index)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

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

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

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

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

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

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

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

[115] s.org/A305843

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

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

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

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

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

[auto28-121] 1 2 3Sloane, N. J. A. (ed.). "SequenceA003238(Number of rooted trees with n vertices in which vertices at the same level have the same degree)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

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

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

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

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

[126] Sloane, N. J. A. (ed.). "SequenceA216492(Number of inequivalent connected planar figures that can be formed from n 1 X 2 rectangles (or dominoes) such that each pair of touching rectangles shares exactly one edge, of length 1, and the adjacency graph of the rectangles is a tree)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

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

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

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

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

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

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

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

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

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

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

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

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

[Pentatope_number-139] 1 2"Sloane's A000332 : Binomial coefficient binomial(n,4) = n*(n-1)*(n-2)*(n-3)/24". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 12 June 2016.

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

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

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

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

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

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

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

[ReferenceC-147] 1 2Sloane, N. J. A. (ed.). "SequenceA051400(Smallest value of x such that M(x) equals n, where M() is Mertens's function A002321)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

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

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

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

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

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

[auto39-153] 1 2 3 4Sloane, N. J. A. (ed.). "SequenceA033548(Honaker primes: primes P(k) such that sum of digits of P(k) equals sum of digits of k)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

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

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

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

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

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

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

[160] Sloane, N. J. A. (ed.). "SequenceA085831(Sum_1^{2^n} d(k) where d(k) is the number of divisors of k (A000005))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

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

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

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

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

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

[auto80-166] 1 2Sloane, N. J. A. (ed.). "SequenceA002071(Number of pairs of consecutive integers x, x+1 such that all prime factors of both x and x+1 are at most the n-th prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

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

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

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

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

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

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

[173] Sloane, N. J. A. (ed.). "SequenceA000084(Number of series-parallel networks with n unlabeled edges. Also called yoke-chains by Cayley and MacMahon)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

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

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

[176] Sloane, N. J. A. (ed.). "SequenceA002720(Number of partial permutations of an n-set; number of n X n binary matrices with at most one 1 in each row and column)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

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

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

[auto78-179] 1 2Sloane, N. J. A. (ed.). "SequenceA008406(Triangle T(n,k) read by rows, giving number of graphs with n nodes and k edges))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

[198] Sloane, N. J. A. (ed.). "SequenceA134602(Composite numbers such that the square mean of their prime factors is a nonprime integer (where the prime factors are taken with multiplicity and the square mean of c and d is sqrt((c^2+d^2)/2)))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

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

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

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

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

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

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

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

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

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

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

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

[210] Sloane, N. J. A. (ed.). "SequenceA056613(Number of n-celled pseudo still lifes in Conway's Game of Life, up to rotation and reflection)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

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

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

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

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

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

[auto37-216] Sloane, N. J. A. (ed.). "SequenceA050710(Smallest composite that when added to sum of prime factors reaches a prime after n iterations)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

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

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

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

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

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

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

[223] Sloane, N. J. A. (ed.). "SequenceA000230(smallest prime p such that there is a gap of exactly 2n between p and next prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

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

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

[auto96-226] 1 2Sloane, N. J. A. (ed.). "SequenceA090781(Numbers that can be expressed as the difference of the squares of primes in just one distinct way)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[ReferenceG-227] Sloane, N. J. A. (ed.). "SequenceA098859(Number of partitions of n into parts each of which is used a different number of times)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

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

[229] Sloane, N. J. A. (ed.). "SequenceA286518(Number of finite connected sets of positive integers greater than one with least common multiple n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

[245] Sloane, N. J. A. (ed.). "SequenceA102627(Number of partitions of n into distinct parts in which the number of parts divides n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

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

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

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

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

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

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

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

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

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

[255] Sloane, N. J. A. (ed.). "SequenceA325860(Number of subsets of {1..n} such that every pair of distinct elements has a different quotient)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

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

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

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

[259] Sloane, N. J. A. (ed.). "SequenceA075213(Number of polyhexes with n cells that tile the plane isohedrally but not by translation or by 180-degree rotation (Conway criterion))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

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

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

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

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

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

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

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

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

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

[auto1-269] Sloane, N. J. A. (ed.). "SequenceA332835(Number of compositions of n whose run-lengths are either weakly increasing or weakly decreasing)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2 June 2022.

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

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

[272] Sloane, N. J. A. (ed.). "SequenceA000230(smallest prime p such that there is a gap of exactly 2n between p and next prime, or -1 if no such prime exists)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

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

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

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

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

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

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

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

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

[281] Sloane, N. J. A. (ed.). "SequenceA000166(Subfactorial or rencontres numbers, or derangements: number of permutations of n elements with no fixed points)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

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

[283] Sloane, N. J. A. (ed.). "SequenceA000602(Number of n-node unrooted quartic trees; number of n-carbon alkanes C(n)H(2n+2) ignoring stereoisomers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

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

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

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

[287] Sloane, N. J. A. (ed.). "SequenceA007530(Prime quadruples: numbers k such that k, k+2, k+6, k+8 are all prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

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

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

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

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

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

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

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

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

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

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

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

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

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

[301] Sloane, N. J. A. (ed.). "SequenceA002845(Number of distinct values taken by 2^2^...^2 (with n 2's and parentheses inserted in all possible ways))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

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

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

[304] Sloane, N. J. A. (ed.). "SequenceA000127(Maximal number of regions obtained by joining n points around a circle by straight lines. Also number of regions in 4-space formed by n-1 hyperplanes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[305] Sloane, N. J. A. (ed.). "SequenceA178084(Numbers k for which 10k + 1, 10k + 3, 10k + 7, 10k + 9 and 10k + 13 are primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

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

[307] Sloane, N. J. A. (ed.). "SequenceA100953(Number of partitions of n into relatively prime parts such that multiplicities of parts are also relatively prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[308] Sloane, N. J. A. (ed.). "SequenceA226366(Numbers k such that 5*2^k + 1 is a prime factor of a Fermat number 2^(2^m) + 1 for some m)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

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

[310] Sloane, N. J. A. (ed.). "SequenceA319014(1*2*3 + 4*5*6 + 7*8*9 + 10*11*12 + 13*14*15 + 16*17*18 + ... + (up to n))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

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

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

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

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

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

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

[auto16-317] Sloane, N. J. A. (ed.). "SequenceA006128(Total number of parts in all partitions of n. Also, sum of largest parts of all partitions of n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[318] Sloane, N. J. A. (ed.). "SequenceA089046(Least edge-length of a square dissectable into at least n squares in the Mrs. Perkins's quilt problem)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

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

[320] Jon Froemke & Jerrold W. Grossman (February 1993). "A Mod-n Ackermann Function, or What's So Special About 1969?". The American Mathematical Monthly. 100 (2). Mathematical Association of America: 180–183. doi:10.2307/2323780. JSTOR 2323780.

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

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

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

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

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

[auto11-326] Sloane, N. J. A. (ed.). "SequenceA000124(Central polygonal numbers (the Lazy Caterer's sequence): n(n+1)/2 + 1; or, maximal number of pieces formed when slicing a pancake with n cuts)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

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

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

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

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

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

[332] Sloane, N. J. A. (編). "数列A187220 (ガルウィング数列)" .オンライン整数列百科事典. OEIS Foundation.

[333] Sloane, N. J. A. (編). "数列A046351 (回文素因数のみを持つ回文合成数)" .オンライン整数列百科事典. OEIS Foundation.

[334] Sloane, N. J. A. (編). "数列A000612 (n 個以下の変数を持つスイッチング関数の P-同値類の数を 2 で割った値)" .オンライン整数列百科事典. OEIS Foundation.

[335] （ OEISの配列A059801）

[336] Sloane, N. J. A. (編). "数列A263341 (行で読み取る三角形: T(n,k) は、n 個の頂点を持つ独立数 k のラベルなしグラフの数)" .オンライン整数列百科事典. OEIS Foundation.

[337] Sloane, N. J. A. (編). "数列A011755 (Sum_{1..n} k*phi(k))" .整数列オンライン百科事典. OEIS Foundation.

[338] Sloane, N. J. A. (編). "数列A038823 (n*1000 と (n+1)*1000 の間の素数の数)" .オンライン整数列百科事典. OEIS Foundation.

[339] スタイン、ウィリアム A. (2017 年 2月10 日)。「リーマン予想とバーチとスウィンナートン＝ダイアー予想」。wstein.org。2021年2 月 6 日取得。

[ 1 ]

[ 2 ]

[ 3 ]

[ 4 ]

[

[

[ 7 ]

[ 8 ]

[ 9 ]

[ 10 ]

[ 11 ]

[ 12 ]

[ 13 ]

[ 14 ]

[

[ 16 ]

[ 17 ]

[ 18 ]

[ 19 ]

20 ] 、

[ 21 ]

[ 22 ]

[

[ 24 ]

[ 25 ]

[

[

[ 28 ]

[ 29 ]

[

[ 31 ]

[

[ 33 ]

[ 34 ]

[ 35 ]

[

[ 37 ]

[

[ 39 ]

[ 40 ]

[ 41 ]

[ 42 ]

[ 43 ]

[ 44 ]

[ 45 ]

[ 46 ]

[ 47 ]

[ 48 ]

[ 49 ]

[

[ 51 ]

[ 52 ]

[ 53 ]

[ 54 ]

[ 55 ]

[ 56 ]

[

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