|
%I #6 Dec 29 2015 03:10:23
%S 0,1,1,2,1,3,2,2,1,2,2,3,2,3,3,3,1,3,2,3,2,4,3,4,2,2,3,4,3,5,4,3,1,4,
%T 4,3,2,5,4,4,2,3,2,3,3,6,2,5,2,4,3,4,3,5,4,4,3,2,3,2,4,5,3,4,1,5,3,3,
%U 2,3,3,4,2,3,5,4,3,4,4,4,2,3,3,4,3,5,6,4,2,5,4,5,4,6,5,5,2,3,4,5,3,5,3,7,3,6,4,6,4,4,4,5,3,3,5,4,5,5,5,6,4,5,4,4,3,5,4,5,4
%N Number of 1-bits in base-3 reversal of n: a(n) = A000120(A263273(n)).
%H Antti Karttunen, <a href="/A265337/b265337.txt">Table of n, a(n) for n = 0..16384</a>
%F a(n) = A000120(A263273(n)).
%F a(0) = 0, a(2n) = a(A265339(n)), a(2n+1) = 1 + a(A265339(n)).
%F a(n) = A265340(n) - A265336(n).
%o (Scheme) (definec (A265337 n) (if (zero? n) 0 (+ (A265337 (A265339 n)) (if (odd? n) 1 0))))
%Y Cf. A000120, A263273, A265336, A265339, A265340.
%K nonn,base
%O 0,4
%A _Antti Karttunen_, Dec 18 2015
|
