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.

A277824 a(0) = 0; for n >= 1, a(n) = 1 + a(A277815(n)); index of the column where n is located in array A277710.

Original entry on oeis.org

0, 1, 1, 1, 1, 2, 1, 1, 1, 1, 2, 2, 1, 3, 1, 1, 1, 1, 1, 3, 2, 2, 2, 1, 1, 2, 3, 2, 1, 4, 1, 1, 1, 1, 1, 4, 1, 3, 3, 2, 2, 5, 2, 2, 2, 3, 1, 1, 1, 1, 2, 3, 3, 4, 2, 2, 1, 2, 4, 2, 1, 6, 1, 1, 1, 1, 1, 5, 1, 3, 4, 3, 1, 1, 3, 3, 3, 5, 2, 3, 2, 1, 5, 4, 2, 7, 2, 1, 2, 2, 3, 4, 1, 4, 1, 1, 1, 1, 1, 4, 2, 2, 3, 5, 3, 2, 4, 5, 2, 6, 2, 1, 1, 2, 2, 3, 4, 4, 2, 2, 1
Offset: 0

Views

Author

Antti Karttunen, Nov 06 2016

Keywords

Comments

For n >= 1, a(n) = index of the column where n is located in array A277710.
Ordinal transform of A277826 and A277884.

Crossrefs

Cf. A277817 (gives the positions of ones in this sequence).
Cf. A277826, A277884 and their scatter-plots.

Programs

Formula

a(0) = 0; for n >= 1, a(n) = 1 + a(A277815(n)).