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.

A305419 Largest k < n whose binary expansion encodes an irreducible (0,1)-polynomial over GF(2)[X], with a(1) = a(2) = 1.

Table of values

n a(n)
1 1
2 1
3 2
4 3
5 3
6 3
7 3
8 7
9 7
10 7
11 7
12 11
13 11
14 13
15 13
16 13
17 13
18 13
19 13
20 19
21 19
22 19
23 19
24 19
25 19
26 25
27 25
28 25
29 25
30 25
31 25
32 31
33 31
34 31
35 31
36 31
37 31
38 37
39 37
40 37
41 37
42 41
43 41
44 41
45 41
46 41
47 41
48 47
49 47
50 47
51 47
52 47
53 47
54 47
55 47
56 55
57 55
58 55
59 55
60 59
61 59
62 61
63 61
64 61
65 61
66 61
67 61
68 67
69 67
70 67
71 67
72 67
73 67
74 73
75 73
76 73
77 73
78 73
79 73
80 73
81 73
82 73
83 73
84 73
85 73
86 73
87 73
88 87

List of values

[1, 1, 2, 3, 3, 3, 3, 7, 7, 7, 7, 11, 11, 13, 13, 13, 13, 13, 13, 19, 19, 19, 19, 19, 19, 25, 25, 25, 25, 25, 25, 31, 31, 31, 31, 31, 31, 37, 37, 37, 37, 41, 41, 41, 41, 41, 41, 47, 47, 47, 47, 47, 47, 47, 47, 55, 55, 55, 55, 59, 59, 61, 61, 61, 61, 61, 61, 67, 67, 67, 67, 67, 67, 73, 73, 73, 73, 73, 73, 73, 73, 73, 73, 73, 73, 73, 73, 87]