OFFSET
1,1
LINKS
Chai Wah Wu, Table of n, a(n) for n = 1..10000
Chris von Csefalvay, Bitwise prime-square sequences ("Jellyfish Hearts").
Wikipedia, Bitwise operation
EXAMPLE
For n=3, a(3) is prime(3) XOR 3^2 = 5 XOR 9 or b(0101) XOR b(1001) = (b)1100, which in base 10 is 12.
MAPLE
a:= n-> Bits[Xor](n^2, ithprime(n)):
seq(a(n), n=1..50); # Alois P. Heinz, May 30 2021
MATHEMATICA
a[n_] := BitXor[n^2, Prime[n]]; Array[a, 50] (* Amiram Eldar, Jun 05 2021 *)
PROG
(Python)
from sympy import primerange, prime
import numpy
def a_vector(n):
primes = list(primerange(0, prime(n)))
squares = [x ** 2 for x in range(1, n)]
return numpy.bitwise_xor(primes, squares)
(PARI) A344856(n) = bitxor(prime(n), n*n); \\ Antti Karttunen, Jun 05 2021
(Python)
from sympy import prime
def A344856(n): return prime(n) ^ n**2 # Chai Wah Wu, Jun 12 2021
CROSSREFS
KEYWORD
nonn,base
AUTHOR
Chris von Csefalvay, May 30 2021
STATUS
approved