|
%I #4 Mar 31 2012 14:40:08
%S 1,1,218368,9324385,6628674,601,365082,532253,449140,4193407,175746,
%T 2857547,2752708,6315245,80612,3354745,10892,953,6577504,157437,
%U 2247676,11357637,7650,272935,318784,8034141,1158380,22315,610550,340357
%N 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.
%F 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)
%e a(2)=1 because 2^2^k + 1 is prime for k= 0,1,2,3 and 4.
%t 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}]
%Y Cf. A090872, A019434, A000215.
%K nonn
%O 1,3
%A _Farideh Firoozbakht_, Feb 06 2004
|
