A169814 a(n) = n XOR phi(n).
0, 3, 1, 6, 1, 4, 1, 12, 15, 14, 1, 8, 1, 8, 7, 24, 1, 20, 1, 28, 25, 28, 1, 16, 13, 22, 9, 16, 1, 22, 1, 48, 53, 50, 59, 40, 1, 52, 63, 56, 1, 38, 1, 56, 53, 56, 1, 32, 27, 38, 19, 44, 1, 36, 31, 32, 29, 38, 1, 44, 1, 32, 27, 96, 113, 86, 1, 100, 105, 94, 1, 80, 1, 110, 99, 104, 113, 86
Offset: 1
Links
- Amiram Eldar, Table of n, a(n) for n = 1..10000
Programs
-
Maple
a:= n-> Bits[Xor](n, numtheory[phi](n)): seq(a(n), n=1..89); # Alois P. Heinz, Jul 06 2023
-
Mathematica
Table[BitXor[n,EulerPhi[n]],{n,80}] (* Harvey P. Dale, Sep 18 2011 *)
-
PARI
a(n)=bitxor(n,eulerphi(n)) \\ Charles R Greathouse IV, Feb 21 2013
Formula
a(n) = 1 <=> n in { A065091 }. - Alois P. Heinz, Jul 06 2023