



1, 4, 5, 8, 9, 11, 14, 15, 17, 20, 21, 23, 25, 28, 29, 32, 33, 35, 37, 40, 41, 44, 45, 47, 50, 51, 53, 56, 57, 59, 61, 64, 65, 68, 69, 71, 73, 76, 77, 80, 81, 83, 86, 87, 89, 91, 94, 95, 98, 99, 101, 104, 105, 107, 110, 111, 113, 115, 118, 119, 122, 123, 125
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,2


COMMENTS

Conjecture: 2n  a(n) is in {0,1} for n>=1.


LINKS

Clark Kimberling, Table of n, a(n) for n = 1..10000


EXAMPLE

As a word, A285258 = 10011001101..., in which 1 is in positions 1,4,5,8,9,11,...


MATHEMATICA

s = Nest[Flatten[# /. {0 > {1, 0}, 1 > {0, 1, 1, 0}}] &, {0}, 11]; (* A285258 *)
Flatten[Position[s, 0]]; (* A285259 *)
Flatten[Position[s, 1]]; (* A285260 *)


CROSSREFS

Cf. A285255, A285258, A285259.
Sequence in context: A128217 A288671 A284906 * A190671 A327221 A042948
Adjacent sequences: A285257 A285258 A285259 * A285261 A285262 A285263


KEYWORD

nonn,easy


AUTHOR

Clark Kimberling, Apr 24 2017


STATUS

approved



