|
|
A274451
|
|
Number of possible sets of antipower periods for binary strings of length n.
|
|
4
|
|
|
1, 2, 1, 2, 1, 4, 1, 3, 2, 2, 1, 6, 1, 2, 4, 3, 1, 5, 1, 6, 4, 2, 1, 11, 2, 2, 2, 6, 1, 10, 1, 4
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
An antiperiod of a length-n string x is a divisor l of n such that if you factor x as the concatenation of (n/l) blocks of length l, then all these blocks are distinct.
|
|
LINKS
|
|
|
EXAMPLE
|
For n = 12 there are six possible sets, achieved by the string that follows each: {12} 000000000000; {6,12} 000000000001; {4,6,12} 000000010010; {4,12} 000001000001; {3,4,6,12} 000001010011; {3,6,12} 000001010101.
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|