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.

A327239 For n >= 1, a(n) = b(n+1) - b(n) where b is A013947.

Original entry on oeis.org

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

Views

Author

David James Sycamore, Sep 14 2019

Keywords

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.

Examples

			n=1 -> a(1) = A013947(2) - A013947(1) = 4 - 1 = 3.
		

Crossrefs

Formula

a(n) = A013947(n+1) - A013947(n); n >= 1.