A265340 Number of iterations of A265339 needed to reach zero; a(0) = 0; for n >= 1, a(n) = 1 + a(A265339(n)).

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

Offset: 0

Author

Antti Karttunen, Dec 18 2015

Keywords

• nonn

Comments

Also the number of significant digits in the binary representation of A263273(n).

Links

• Antti Karttunen, Table of n, a(n) for n = 0..16384

Crossrefs

Cf. A070939, A263273, A265330, A265336, A265337, A265339.

Formula

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

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

a(n) = A265336(n) + A265337(n).