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.

A355255 Irregular table read by rows: a(n,k) gives the number of distinct necklaces that appear in the following procedure: starting with the n-bead, (0,1)-necklace given by k written in binary, repeatedly take the first differences (mod 2) of the beads. 0 <= k < 2^n.

Table of values

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

List of values

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