login
A265340
Number of iterations of A265339 needed to reach zero; a(0) = 0; for n >= 1, a(n) = 1 + a(A265339(n)).
5
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
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
KEYWORD
nonn
AUTHOR
Antti Karttunen, Dec 18 2015
STATUS
approved