|
0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1
|
|
LINKS
|
|
|
FORMULA
|
a(3k-2)=0, a(3k-1)=1-a(k), a(3k)=1 for k>=1, a(0)=0.
|
|
EXAMPLE
|
0->011->011001001->...
|
|
MATHEMATICA
|
t = Nest[Flatten[# /. {0->{0, 1, 1}, 1->{0, 0, 1}}] &, {0}, 5] (* A189706 *)
f[n_] := t[[n]]
Flatten[Position[t, 0]] (* A189707 *)
Flatten[Position[t, 1]] (* A189708 *)
s[n_] := Sum[f[i], {i, 1, n}]; s[0] = 0;
Table[s[n], {n, 1, 120}] (* A189709 *)
|
|
PROG
|
(PARI) a(n) = n--; my(ret=0); while([n, r]=divrem(n, 3); r==1, ret++); (ret+r>>1)%2; \\ Kevin Ryde, Jun 02 2021
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|