cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A333229 First sums of the Kolakoski sequence A000002.

Original entry on oeis.org

3, 4, 3, 2, 3, 3, 3, 4, 3, 3, 4, 3, 2, 3, 3, 2, 3, 4, 3, 3, 3, 2, 3, 3, 3, 4, 3, 2, 3, 3, 2, 3, 3, 3, 4, 3, 3, 4, 3, 2, 3, 3, 3, 4, 3, 3, 3, 2, 3, 3, 2, 3, 4, 3, 3, 4, 3, 2, 3, 3, 3, 4, 3, 3, 4, 3, 2, 3, 3, 2, 3, 3, 3, 4, 3, 3, 3, 2, 3, 4, 3, 3, 4, 3, 2, 3, 3
Offset: 1

Views

Author

Gus Wiseman, Mar 18 2020

Keywords

Crossrefs

Positions of 3's are A054353.
Positions of 2's are A074262.
Positions of 4's are A074263.
The number of runs in the first n terms of A000002 is A156253(n).
Even-indexed terms are A332273 (without the first term).
Odd-indexed terms are A332875.

Programs

  • Mathematica
    kolagrow[q_]:=If[Length[q]<2,Take[{1,2},Length[q]+1],Append[q,Switch[{q[[Length[Split[q]]]],q[[-2]],Last[q]},{1,1,1},0,{1,1,2},1,{1,2,1},2,{1,2,2},0,{2,1,1},2,{2,1,2},2,{2,2,1},1,{2,2,2},1]]]
    kol[n_Integer]:=Nest[kolagrow,{1},n-1];
    Table[kol[n][[-1]]+kol[n+1][[-1]],{n,30}]

Formula

a(n) = A000002(n) + A000002(n + 1).