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”).

A090873
a(n) is the smallest number m such that n^2^k + m^2^k is prime for k=0,1,2,3 and 4.
4
1, 1, 218368, 9324385, 6628674, 601, 365082, 532253, 449140, 4193407, 175746, 2857547, 2752708, 6315245, 80612, 3354745, 10892, 953, 6577504, 157437, 2247676, 11357637, 7650, 272935, 318784, 8034141, 1158380, 22315, 610550, 340357
OFFSET
1,3
LINKS
FORMULA
a[n_] := (For[m=1, !(PrimeQ[m+n]&&PrimeQ[m^2+n^2]&&PrimeQ[m^4+n^4]&& PrimeQ[m^8+n^8]&&PrimeQ[m^16+n^16]), m++ ];m)
EXAMPLE
a(2)=1 because 2^2^k + 1 is prime for k= 0,1,2,3 and 4.
MATHEMATICA
a[n_] := (For[m=1, !(PrimeQ[m+n]&&PrimeQ[m^2+n^2]&&PrimeQ[m^4+n^4]&& PrimeQ[m^8+n^8]&&PrimeQ[m^16+n^16]), m++ ]; m); Do[Print[a[n]], {n, 50}]
CROSSREFS
KEYWORD
nonn
AUTHOR
Farideh Firoozbakht, Feb 06 2004
STATUS
approved