login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A134466
See A134457.
3
0, 1, 1, 2, 6, 6, 11, 22, 44, 92, 92, 157, 311, 622, 1239, 2478, 4956, 9912, 19832, 19832, 36217, 72058, 144061, 288122, 576123, 1152239, 2304478, 4608943
OFFSET
1,4
COMMENTS
Note that a(n) = a(n-1) for n = [1,] 3, 6, 11, 20,... = A006127(2^k + k) (conjectured); this corresponds to the case where the string c (see A134457) satisfies c(n)="0".c(n-1) (pre-pended "0"). The next string c(n+1) is obtained by inserting "0" after the first "1" and adding 1 (except for c(4) where both of these operations are equivalent and only one must be performed). - M. F. Hasler, Dec 17 2007
CROSSREFS
Sequence in context: A323444 A099027 A306925 * A062562 A208570 A106832
KEYWORD
nonn
AUTHOR
David W. Wilson, Dec 17 2007
STATUS
approved