login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A244932
Least number k > n such that k^8 + n^8 is prime.
1
2, 13, 10, 17, 6, 37, 12, 13, 16, 27, 24, 71, 16, 31, 64, 43, 18, 43, 26, 23, 32, 29, 24, 79, 32, 53, 34, 61, 92, 47, 40, 33, 34, 57, 36, 47, 40, 53, 40, 79, 44, 43, 68, 91, 68, 57, 66, 61, 60, 53, 58, 83, 60, 91, 94, 61, 82, 61, 70, 101, 82, 71, 68, 145, 82, 67, 76, 69, 100
OFFSET
1,1
COMMENTS
a(n) = n+1 iff n is in A153504.
LINKS
EXAMPLE
13^8 + 14^8 = 2291519777 is not prime, 13^8 + 15^8 = 3378621346 is not prime. 13^8 + 16^8 = 5110698017 is prime. Thus a(13) = 16.
PROG
(Python)
import sympy
from sympy import isprime
def a(n):
..for k in range(n+1, 10**4):
....if isprime(k**8+n**8):
......return k
n = 1
while n < 100:
..print(a(n), end=', ')
..n += 1
(PARI) a(n)=for(k=n+1, 10^4, if(isprime(k^8+n^8), return(k)))
n=1; while(n<100, print1(a(n), ", "); n++)
CROSSREFS
KEYWORD
nonn
AUTHOR
Derek Orr, Jul 08 2014
STATUS
approved