Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #11 Mar 10 2020 00:29:19
%S 0,0,0,1,0,0,2,2,0,1,0,0,4,5,4,5,0,0,2,2,0,1,0,0,8,8,10,11,8,8,10,10,
%T 0,1,0,0,4,5,4,5,0,0,2,2,0,1,0,0,16,17,16,17,20,20,22,23,16,17,16,16,
%U 20,21,20,21,0,0,2,2,0,1,0,0,8,8,10,11,8,8,10,10,0,1,0,0,4,5,4,5,0,0,2,2,0,1,0,0,32,32,34,35,32,32,34,34,40,41
%N a(n) = A332896(A332817(n)).
%C In contrast to similarly constructed A292274, this sequence can be computed directly from the binary expansion of n, without involving primes or their distribution at all.
%H Antti Karttunen, <a href="/A332996/b332996.txt">Table of n, a(n) for n = 0..16383</a>
%H Antti Karttunen, <a href="/A332996/a332996.txt">Data supplement: n, a(n) computed 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) = A332896(A332817(n)).
%F a(n) = n - A332995(n) = n XOR A332995(n).
%F A000120(a(n)) = A332998(n).
%o (PARI) A332996(n) = A332896(A332817(n));
%Y Cf. A292274, A332817, A332896, A332995, A332998.
%Y Differs from a similarly constructed A292592 for the first time at n=511, where a(511) = 170, while A292592(511) = 171.
%K nonn
%O 0,7
%A _Antti Karttunen_, Mar 05 2020