|
%I #7 Dec 29 2015 03:12:35
%S 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,
%T 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,
%U 7,7,6,7,7,6,6,6,6,7,7,6,7,7
%N Number of iterations of A265339 needed to reach zero; a(0) = 0; for n >= 1, a(n) = 1 + a(A265339(n)).
%C Also the number of significant digits in the binary representation of A263273(n).
%H Antti Karttunen, <a href="/A265340/b265340.txt">Table of n, a(n) for n = 0..16384</a>
%F a(0) = 0; for n >= 1, a(n) = 1 + a(A265339(n)).
%F a(0) = 0; for n >= 1, a(n) = A070939(A263273(n)).
%F a(n) = A265336(n) + A265337(n).
%o (Scheme, two variants)
%o (definec (A265340 n) (if (zero? n) 0 (+ 1 (A265340 (A265339 n)))))
%o (define (A265340 n) (if (zero? n) 0 (A070939 (A263273 n))))
%Y Cf. A070939, A263273, A265330, A265336, A265337, A265339.
%K nonn
%O 0,3
%A _Antti Karttunen_, Dec 18 2015
|
