|
%I #5 Jan 10 2017 19:14:45
%S 0,0,0,0,0,0,0,0,0,0,0,6,0,6,0,0,0,0,0,10,0,0,12,10,0,10,12,0,0,10,0,
%T 0,0,0,0,18,0,12,20,30,0,12,0,30,24,0,20,18,0,18,20,0,24,30,0,12,0,30,
%U 20,12,0,18,0,0,0,0,0,34,0,20,36,54,0,0,24,34,40,20,60,54,0,20,24,54,0,0,60,34,48,20,0,54,40,0,36,34,0,34,36,0,40,54,0,20,48
%N a(n) = n XOR A057889(n).
%H Antti Karttunen, <a href="/A280508/b280508.txt">Table of n, a(n) for n = 0..8191</a>
%H <a href="/index/Bi#binary">Index entries for sequences related to binary expansion of n</a>
%H <a href="/index/Ge#GF2X">Index entries for sequences operating on polynomials in ring GF(2)[X]</a>
%F a(n) = A003987(n,A057889(n)) = n XOR A057889(n).
%F Other identities. For all n >= 0:
%F a(A057889(n)) = a(n).
%o (Scheme) (define (A280508 n) (A003987bi n (A057889 n))) ;; Where A003987bi implements A003987 (bitwise-XOR).
%Y Cf. A003987, A057889, A280505, A280506, A280507, A280509.
%Y Cf. A057890 (positions of zeros).
%K nonn,base
%O 0,12
%A _Antti Karttunen_, Jan 09 2017
|
