A256993 - OEIS

A256993

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

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

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,3

COMMENTS

Number of iterations of A256992 needed to reach one when starting from n.

LINKS

Antti Karttunen, Table of n, a(n) for n = 1..8192

FORMULA

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

Other observations. For all n >= 1 it holds that:

a(n) >= A254110(n).

a(n) >= A256989(n).