|
|
A217932
|
|
a(n) = total number of binary sequences S of length n and curling number k (so S = XY^k) in which Y can be taken to have length 1.
|
|
1
|
|
|
2, 4, 8, 14, 28, 52, 104, 202, 402, 794, 1588, 3152, 6304, 12572, 25136, 50198, 100396, 200636, 401272, 802260, 1604488, 3208416, 6416832, 12832482, 25664962, 51327702, 102655278, 205306104, 410612208, 821215304, 1642430608, 3284843468
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
LINKS
|
|
|
EXAMPLE
|
Taking the alphabet to be {0,1}, the 14 sequences of length 14 are **10 (k=1), *100 (k=2), 1000 (k=3) and their complements, for a total of 2(4+2+1) = 14 (here * = 0 or 1).
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|