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”).

A327239
For n >= 1, a(n) = b(n+1) - b(n) where b is A013947.
0
3, 1, 2, 3, 3, 1, 2, 1, 3, 2, 1, 2, 3, 1, 2, 1, 2, 3, 3, 1, 2, 3, 2, 1, 2, 1, 3, 3, 1, 2, 3, 3, 1, 2, 1, 2, 3, 2, 1, 3, 3, 1, 2, 3, 3, 1, 2, 1, 3, 2, 1, 2, 3, 3, 1, 2, 1, 2, 3, 1, 2, 1, 3, 2, 1, 2, 1, 3, 3, 1, 2, 3, 2, 1, 3, 3, 2, 1, 2, 1, 3, 3, 1, 2, 3
OFFSET
1,1
COMMENTS
Stepwise answer to the stepwise question "How far ahead is the next 1 in the Kolakoski sequence, starting from A000002(1) = 1?" Sequence contains only 1s, 2s and 3s. Conjecture: Densities of 1s, 2s, and 3s -> 1/3 as n->infinity.
FORMULA
a(n) = A013947(n+1) - A013947(n); n >= 1.
EXAMPLE
n=1 -> a(1) = A013947(2) - A013947(1) = 4 - 1 = 3.
CROSSREFS
Sequence in context: A274514 A342932 A026181 * A322849 A322850 A337566
KEYWORD
nonn
AUTHOR
STATUS
approved