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,3

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

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).

Prog

(Scheme, two variants)
(definec (A265340 n) (if (zero? n) 0 (+ 1 (A265340 (A265339 n)))))
(define (A265340 n) (if (zero? n) 0 (A070939 (A263273 n))))

Crossrefs

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

Sequence in context: A271058 A107320 A095186 * A373503 A356993 A189631

Adjacent sequences: A265337 A265338 A265339 * A265341 A265342 A265343

Keyword

nonn

Author

Antti Karttunen, Dec 18 2015

Status

approved