cp's OEIS Frontend

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

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