cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A175198 a(n) is the smallest integer k such that the polynomial x^k + 1 over the integers mod 2 has exactly n distinct irreducible factors.

Table of values

n a(n)
1 1
2 3
3 7
4 27
5 15
6 21
7 31
8 45
9 73
10 91
11 129
12 85
13 63
14 93
15 105
16 275
17 257
18 219
19 127
20 189
21 217
22 453
23 441
24 357
25 601
26 741
27 273
28 837
29 1191
30 981
31 513
32 645
33 903
34 949
35 255
36 315
37 1649
38 341
39 1103
40 1235
41 455
42 651
43 657
44 1443
45 775
46 2795
47 825
48 1925
49 1911
50 771

List of values

[1, 3, 7, 27, 15, 21, 31, 45, 73, 91, 129, 85, 63, 93, 105, 275, 257, 219, 127, 189, 217, 453, 441, 357, 601, 741, 273, 837, 1191, 981, 513, 645, 903, 949, 255, 315, 1649, 341, 1103, 1235, 455, 651, 657, 1443, 775, 2795, 825, 1925, 1911, 771]