|
%I #17 Jul 08 2016 00:11:40
%S 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
%N Number of possible sets of antipower periods for binary strings of length n.
%C 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.
%H G. Fici, A. Restivo, M. Silva, and L. Q. Zamboni, <a href="http://arxiv.org/abs/1606.02868">Anti-powers in infinite words</a>, arxiv preprint, 1606.02868v1 [cs.DM], June 9 2016.
%e 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.
%Y Cf. A274409, A274449, A274450.
%K nonn
%O 1,2
%A _Jeffrey Shallit_, Jun 23 2016
%E a(19)-a(32) from _Bjarki Ágúst Guðmundsson_, Jul 07 2016
|
