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.

A317586 Number of circular binary words of length n having the maximum possible number of distinct blocks of length floor(log_2 n) and floor(log_2 n)+1.

Table of values

n a(n)
1 2
2 1
3 2
4 1
5 2
6 3
7 4
8 2
9 4
10 3
11 6
12 13
13 12
14 20
15 32
16 16
17 32
18 36
19 68
20 141
21 242
22 407
23 600
24 898
25 1440
26 1812
27 2000
28 2480
29 2176
30 2816
31 4096
32 2048
33 4096
34 3840
35 7040
36 13744
37 28272
38 54196
39 88608
40 160082
41 295624
42 553395
43 940878
44 1457197
45 2234864
46 3302752
47 4975168
48 7459376

List of values

[2, 1, 2, 1, 2, 3, 4, 2, 4, 3, 6, 13, 12, 20, 32, 16, 32, 36, 68, 141, 242, 407, 600, 898, 1440, 1812, 2000, 2480, 2176, 2816, 4096, 2048, 4096, 3840, 7040, 13744, 28272, 54196, 88608, 160082, 295624, 553395, 940878, 1457197, 2234864, 3302752, 4975168, 7459376]