|
|
A216958
|
|
Number of binary vectors v of length n with curling number 1 such that the concatenation v v with first term omitted also has curling number 1.
|
|
8
|
|
|
2, 2, 4, 6, 10, 20, 36, 72, 142, 280, 560, 1114, 2222, 4436, 8864, 17718, 35420, 70824, 141624, 283210, 566394, 1132728, 2265390, 4530726, 9061318, 18122518, 36244908, 72489566, 144978870, 289957490, 579914470, 1159828430, 2319656332, 4639311620, 9278622168
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
I would very much like to have a formula or recurrence for this sequence.
Alternatively, the number of squares of length 2n over a binary alphabet having no proper prefix that is a square. Here by a square I mean a word of the form xx, where x is any word. - Jeffrey Shallit, Nov 29 2013
|
|
LINKS
|
|
|
EXAMPLE
|
Taking the alphabet to be {2,3}, v = 32232 has curling number 1, but 2232.32232 has curling number 2, so is not counted here.
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|