|
|
A318687
|
|
Number of length-n circular binary words having exactly n distinct blocks of length floor(log_2(n)) + 1 (A070939).
|
|
1
|
|
|
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
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
A "circular word" (a.k.a. "necklace") is one that wraps around from the end to the beginning. The words are counted up to an equivalence where two circular words are the same if one is a cyclic shift of the other.
|
|
LINKS
|
|
|
FORMULA
|
|
|
CROSSREFS
|
Cf. A317586, which studies a similar quantity for two different lengths of blocks.
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|