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.

A256989 One-based column index of n in array A256995.

Original entry on oeis.org

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

Views

Author

Antti Karttunen, Apr 14 2015

Keywords

Comments

Also one-based row index for array A256997.
a(1) = 0 by convention, as 1 is outside of the actual arrays A256995 & A256997.

Crossrefs

Cf. A256990 (corresponding row index), A255559.

Formula

a(1) = 0; for n > 1, if A213714(n) = 0 [i.e., if n is one of the terms of A055938], then a(n) = 1, otherwise a(n) = 1 + a(A213714(n)).
In other words, a(1) = 0, and for n > 1, if n = A005187(k) for some k, then a(n) = 1 + a(k), otherwise it must be that n is in A055938, in which case a(n) = 1.
Other observations. For all n >= 1 it holds that:
a(n) <= A256993(n).