|
%I #7 Mar 10 2020 00:29:33
%S 0,0,0,1,0,0,1,1,0,1,0,0,1,2,1,2,0,0,1,1,0,1,0,0,1,1,2,3,1,1,2,2,0,1,
%T 0,0,1,2,1,2,0,0,1,1,0,1,0,0,1,2,1,2,2,2,3,4,1,2,1,1,2,3,2,3,0,0,1,1,
%U 0,1,0,0,1,1,2,3,1,1,2,2,0,1,0,0,1,2,1,2,0,0,1,1,0,1,0,0,1,1,2,3,1,1,2,2,2,3
%N a(n) = A000120(A332996(n)).
%H Antti Karttunen, <a href="/A332998/b332998.txt">Table of n, a(n) for n = 0..65537</a>
%H <a href="/index/Bi#binary">Index entries for sequences related to binary expansion of n</a>
%F a(n) = A000120(A332996(n)) = A332898(A332817(n)).
%F a(n) = A000120(n) - A332997(n).
%F Conjecture: for n >= 2, a(A086224(n-1)) = n, this being also the first occurrence of each n larger than 1.
%o (PARI) A332998(n) = hammingweight(A332996(n));
%o (PARI) A332998(n) = A332898(A332817(n));
%Y Cf. A000120, A332817, A332898, A332996, A332997.
%Y Cf. A086224.
%K nonn
%O 0,14
%A _Antti Karttunen_, Mar 05 2020
|
