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.

A268389 a(n) = greatest k such that polynomial (X+1)^k divides the polynomial (in polynomial ring GF(2)[X]) that is encoded in the binary expansion of n. (See the comments for details).

Table of values

n a(n)
1 0
2 0
3 1
4 0
5 2
6 1
7 0
8 0
9 1
10 2
11 0
12 1
13 0
14 0
15 3
16 0
17 4
18 1
19 0
20 2
21 0
22 0
23 1
24 1
25 0
26 0
27 2
28 0
29 1
30 3
31 0
32 0
33 1
34 4
35 0
36 1
37 0
38 0
39 2
40 2
41 0
42 0
43 1
44 0
45 3
46 1
47 0
48 1
49 0
50 0
51 5
52 0
53 1
54 2
55 0
56 0
57 2
58 1
59 0
60 3
61 0
62 0
63 1
64 0
65 2
66 1
67 0
68 4
69 0
70 0
71 1
72 1
73 0
74 0
75 3
76 0
77 1
78 2
79 0
80 2
81 0
82 0
83 1
84 0
85 6
86 1
87 0
88 0
89 1
90 3
91 0
92 1
93 0
94 0
95 2
96 1
97 0
98 0
99 2
100 0
101 1
102 5
103 0
104 0
105 3
106 1
107 0
108 2
109 0
110 0
111 1
112 0
113 1
114 2
115 0
116 1
117 0
118 0
119 4
120 3

List of values

[0, 0, 1, 0, 2, 1, 0, 0, 1, 2, 0, 1, 0, 0, 3, 0, 4, 1, 0, 2, 0, 0, 1, 1, 0, 0, 2, 0, 1, 3, 0, 0, 1, 4, 0, 1, 0, 0, 2, 2, 0, 0, 1, 0, 3, 1, 0, 1, 0, 0, 5, 0, 1, 2, 0, 0, 2, 1, 0, 3, 0, 0, 1, 0, 2, 1, 0, 4, 0, 0, 1, 1, 0, 0, 3, 0, 1, 2, 0, 2, 0, 0, 1, 0, 6, 1, 0, 0, 1, 3, 0, 1, 0, 0, 2, 1, 0, 0, 2, 0, 1, 5, 0, 0, 3, 1, 0, 2, 0, 0, 1, 0, 1, 2, 0, 1, 0, 0, 4, 3]