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.

A319951 Take Golomb's sequence A001462 and extend all the runs by 1; prepend an initial 0.

Original entry on oeis.org

0, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10, 10, 11, 11, 11, 11, 11, 11, 12, 12, 12, 12, 12, 12, 12, 13, 13, 13, 13, 13, 13, 13, 14, 14, 14, 14, 14, 14, 14, 15, 15, 15, 15, 15, 15, 15, 16, 16, 16, 16, 16, 16, 16, 16, 17, 17, 17, 17, 17, 17, 17, 17, 18, 18, 18, 18, 18, 18, 18, 18, 19
Offset: 0

Views

Author

N. J. A. Sloane, Oct 02 2018

Keywords

Comments

Each value of n (n >= 1) appears exactly A001462(n)+1 times.

Examples

			Golomb's sequence begins 1, 2,2, 3,3, 4,4,4, 5,5,5, ...
and we just extend each run by one term, getting 0,  1, 1,  2, 2, 2,  3, 3, 3,  4, 4, 4, 4,  5, 5, 5, 5, ...
		

Crossrefs

Formula

a(n) = A001462(n - A001462(n - A001462(n))) for n >= 3. - Alan Michael Gómez Calderón, Aug 14 2025