A329907 - OEIS

A329907

Number of iterations of A329904 needed to reach 1.

0, 1, 2, 2, 3, 3, 4, 4, 3, 5, 3, 5, 4, 6, 4, 6, 5, 7, 5, 4, 7, 4, 4, 6, 8, 6, 5, 8, 5, 5, 7, 9, 7, 6, 9, 6, 6, 4, 8, 10, 5, 8, 5, 5, 7, 10, 7, 7, 5, 9, 11, 6, 9, 5, 6, 6, 8, 11, 8, 8, 6, 10, 12, 7, 10, 6, 7, 7, 5, 9, 12, 5, 6, 9, 9, 7, 6, 11, 6, 13, 8, 11, 7, 8, 8, 6, 10, 13, 6, 7, 10, 10, 6, 8, 7, 12, 7, 14, 9, 12, 8, 9, 9, 7, 11

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

OFFSET

1,3

COMMENTS

Equally, starting from A025487(n), number of iterations of A329899 needed to reach 1.

Any k > 0 occurs 2^(k-1) times in total in this sequence.

LINKS

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

FORMULA

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

a(1) = 0; for n > 1, a(n) = A070939(A329905(n)).

a(n) = A252464(A181815(n)).