login
A356921
Irregular table read by rows: necklaces on the alphabet {0,1} sorted by length then by lexicographic order of minimum rotation.
3
0, 1, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 1, 0, 1, 0, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0
OFFSET
1
COMMENTS
There are A000031(n) rows of length n.
EXAMPLE
Table begins:
0,
1,
0, 0,
0, 1,
1, 1,
0, 0, 0,
0, 0, 1,
0, 1, 1,
1, 1, 1,
0, 0, 0, 0,
0, 0, 0, 1,
0, 0, 1, 1,
0, 1, 0, 1,
0, 1, 1, 1,
1, 1, 1, 1,
0, 0, 0, 0, 0,
0, 0, 0, 0, 1,
0, 0, 0, 1, 1,
0, 0, 1, 0, 1,
0, 0, 1, 1, 1,
0, 1, 0, 1, 1,
0, 1, 1, 1, 1,
1, 1, 1, 1, 1,
...
CROSSREFS
Cf. A000031.
Cf. A356922 (bracelets), A356923 (invertible necklaces), A356924 (invertible bracelets).
Sequence in context: A076478 A091444 A091447 * A356922 A106701 A258021
KEYWORD
nonn,tabf
AUTHOR
Peter Kagey, Sep 04 2022
STATUS
approved