



2, 3, 5, 7, 10, 11, 14, 15, 17, 19, 22, 23, 26, 27, 29, 32, 33, 35, 37, 40, 41, 44, 45, 47, 50, 51, 53, 55, 58, 59, 62, 63, 65, 68, 69, 71, 74, 75, 77, 79, 82, 83, 86, 87, 89, 91, 94, 95, 98, 99, 101, 104, 105, 107, 110, 111, 113, 115, 118, 119, 122, 123
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,1


COMMENTS

Conjecture: 2n  a(n) is in {0,1} for n>=1.
See the comments of A285250 for a proof of this conjecture.  Michel Dekking, Oct 07 2020


LINKS

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


EXAMPLE

As a word, A285255 = 011010..., in which 0 is in positions 1,4,6,8,9,...


MATHEMATICA

s = Nest[Flatten[# /. {0 > {1, 0}, 1 > {0, 1, 1, 0}}] &, {0}, 12]; (* A285255 *)
Flatten[Position[s, 0]]; (* A285256 *)
Flatten[Position[s, 1]]; (* A285257 *)


CROSSREFS

Cf. A285250, A285255, A285256, A285258.
Sequence in context: A169802 A194948 A266679 * A317407 A191211 A263133
Adjacent sequences: A285254 A285255 A285256 * A285258 A285259 A285260


KEYWORD

nonn,easy


AUTHOR

Clark Kimberling, Apr 24 2017


STATUS

approved



