



1, 4, 5, 7, 9, 12, 13, 16, 17, 19, 22, 23, 25, 28, 29, 31, 33, 36, 37, 40, 41, 43, 45, 48, 49, 52, 53, 55, 58, 59, 61, 63, 66, 67, 70, 71, 73, 76, 77, 79, 81, 84, 85, 88, 89, 91, 94, 95, 97, 100, 101, 103, 105, 108, 109, 112, 113, 115, 117, 120, 121, 124
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,2


COMMENTS

Let s(n) = 2n  a(n). It appears that s(n) is a 01sequence with 0 in positions given by A189660 and 1 in positions given by A189665.


LINKS

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


EXAMPLE

As a word, A285305 = 1001101..., in which 1 is in positions 1,4,5,7,9,...


MATHEMATICA

s = Nest[Flatten[# /. {0 > {1, 0}, 1 > {0, 1, 1, 1}}] &, {0}, 10]; (* A285274 *)
Flatten[Position[s, 0]]; (* A285275 *)
Flatten[Position[s, 1]]; (* A285276 *)


CROSSREFS

Cf. A189660, A189665, A285305, A285306.
Sequence in context: A335984 A286050 A047493 * A297838 A032360 A117150
Adjacent sequences: A285304 A285305 A285306 * A285308 A285309 A285310


KEYWORD

nonn,easy


AUTHOR

Clark Kimberling, Apr 25 2017


STATUS

approved



