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.

A318687 Number of length-n circular binary words having exactly n distinct blocks of length floor(log_2(n)) + 1 (A070939).

Table of values

n a(n)
1 2
2 1
3 2
4 3
5 2
6 3
7 4
8 12
9 14
10 17
11 14
12 13
13 12
14 20
15 32
16 406
17 538
18 703
19 842
20 1085
21 1310
22 1465
23 1544
24 1570
25 1968
26 2132
27 2000
28 2480
29 2176
30 2816
31 4096
32 1060280

List of values

[2, 1, 2, 3, 2, 3, 4, 12, 14, 17, 14, 13, 12, 20, 32, 406, 538, 703, 842, 1085, 1310, 1465, 1544, 1570, 1968, 2132, 2000, 2480, 2176, 2816, 4096, 1060280]