|
%I #16 Mar 31 2012 13:22:09
%S 1,1,1,1,1,43,25,21,207,223,1125,2577,3091,9165,6223,3493,1063
%N Least odd k such that k*2^(2^n)+1 is prime.
%H Mark Rodenkirch: <a href="http://openpfgw.sourceforge.net/">OpenPFGW</a> (for running the PFGW the program).
%t Table[k=1; While[! PrimeQ[k*2^2^n + 1], k=k+2]; k, {n, 0, 10}]
%o (PFGW)
%o SCRIPT
%o DIM nn,-1
%o DIM kk
%o DIMS tt
%o LABEL loopn
%o SET nn,nn+1
%o SET kk,-1
%o LABEL loopk
%o SET kk,kk+2
%o SETS tt,%d,%d\,;nn;kk
%o PRP kk*2^(2^nn)+1,tt
%o IF ISPRP THEN GOTO loopn
%o GOTO loopk
%o \PFGW -t FILE.txt
%o FILE.txt =
%o ABC $a
%o 43*2^(2^5)+1
%o 25*2^(2^6)+1
%o 21*2^(2^7)+1
%o 207*2^(2^8)+1
%o 223*2^(2^9)+1
%o 1125*2^(2^10)+1
%o 2577*2^(2^11)+1
%o 3091*2^(2^12)+1
%o 9165*2^(2^13)+1
%o 6223*2^(2^14)+1
%o 3493*2^(2^15)+1
%o 1063*2^(2^16)+1
%K nonn
%O 0,6
%A _Pierre CAMI_, Mar 08 2011
|
