|
%I #20 Mar 19 2019 17:19:02
%S 0,0,0,0,0,0,0,0,0,0,11,0,25,18,39,60,45,86,67,72,22,25,0,55,50,45,36,
%T 83,78,65,29,18,55,0,9,22,27,108,117,122,44,39,50,9,0,27,110,101,100,
%U 111,55,60,45,22,27,0,121,114,111,100,58,45,36,27,110,121
%N a(n) = bitwise XOR of n and the reverse of n.
%H Alois P. Heinz, <a href="/A256756/b256756.txt">Table of n, a(n) for n = 0..10000</a>
%H Wikipedia, <a href="https://en.wikipedia.org/wiki/Bitwise operation">Bitwise operation</a>
%F a(n) = A003987(n, A004086(n)).
%p a:= n-> Bits[Xor](n, (s-> parse(cat(s[-i]$i=1..length(s))))(""||n)):
%p seq(a(n), n=0..80);
%t Table[BitXor[n,FromDigits[Reverse[IntegerDigits[n]]]],{n,0,65}] (* _Ivan N. Ianakiev_, Apr 10 2015 *)
%o (PARI) a(n) = bitxor(n, subst(Polrev(digits(n)), x, 10)); \\ _Michel Marcus_, Apr 10 2015
%Y Cf. A003987, A004086, A055483, A056964, A056965, A061205, A068634, A175919, A256754, A256755.
%K nonn,base,look,easy
%O 0,11
%A _Alois P. Heinz_, Apr 09 2015
|
