OFFSET
1,1
EXAMPLE
PROG
(PARI) is(p) = isprime(p) && sum(j=1, p-1, sum(k=1, p-1, Mod(prime(k), p)^prime(j))) == 0; \\ Jinyuan Wang, Jan 16 2021
(Python)
from sympy import nextprime, prime
p, A122004_list = 2, []
while p < 10**6:
if 0 == sum(pow(prime(i), prime(j), p) for i in range(1, p) for j in range(1, p)) % p:
A122004_list.append(p)
p = nextprime(p) # Chai Wah Wu, Feb 19 2021
CROSSREFS
KEYWORD
nonn,more,hard
AUTHOR
Alexander Adamchuk, Oct 14 2006
STATUS
approved