%I #6 Dec 18 2015 11:22:04
%S 0,1,1,1,1,1,1,1,2,2,3,3,3,3,4,4,4,4,4,4,4,4,5,5,5,5,5,5,6,6,6,6,6,7,
%T 7,7,7,7,7,8,8,8,8,8,8,8,8,9,9,9,9,9,9,9,9,10,10,10,10,10,10,10,10,11,
%U 11,11,11,11,11,11,11,12,12,12,12,12,12,12,12,12,13,13,13,13,13,13,13,13,13,13,14,14
%N a(0) = 0; for n >= 1, a(n) = A070939(A078510(n)).
%C Number of significant bits in the binary representation of n-th Spironacci number, A078510(n).
%H Antti Karttunen, <a href="/A265370/b265370.txt">Table of n, a(n) for n = 0..8192</a>
%F a(0) = 0; for n >= 1, a(n) = A070939(A078510(n)).
%o (define (A265370 n) (if (zero? n) n (A070939 (A078510 n))))
%Y Cf. A070939, A078510.
%Y Cf. also A020909.
%K nonn
%O 0,9
%A _Antti Karttunen_, Dec 16 2015
|