OFFSET
1,1
COMMENTS
For any integer k, XOR(n,k) = 2*OR(n,k) - (n+k). - Gary Detlefs, Oct 26 2013
LINKS
Reinhard Zumkeller, Table of n, a(n) for n = 1..10000
Eric Weisstein's World of Mathematics, aut.
Eric Weisstein's World of Mathematics, XOR.
FORMULA
a(n) = 2*OR(p,n) - (p+n), for n-th prime p. - Gary Detlefs, Oct 26 2013
EXAMPLE
A000040(25)=97, [25]2 = '00011001', [97]2 = '01100001' '00011001' XOR '01100001' = '01111000', therefore a(25)=120.
MATHEMATICA
Table[ BitXor[ n, Prime[n]], {n, 1, 55}]
PROG
(Haskell)
import Data.Bits (xor)
a070883 n = a070883_list !! (n-1)
a070883_list = zipWith xor [1..] a000040_list
-- Reinhard Zumkeller, Jun 23 2015
(PARI) a(n) = bitxor(n, prime(n));
(Python)
from sympy import prime
def a(n): return n^prime(n)
print([a(n) for n in range(1, 60)]) # Michael S. Branicky, Mar 05 2022
CROSSREFS
KEYWORD
nonn,look
AUTHOR
Reinhard Zumkeller, May 22 2002
STATUS
approved
