|
%I #11 Dec 17 2017 22:15:25
%S 2,4,6,12,18,18,18,24,26,40,42,48,42,60,52,56,60,90,102,72,78,84,90,
%T 90,114,102,114,112,126,122,138,132,140,156,154,192,174,174,168,174,
%U 196,192,212,234,206,216,240,246,230,264,240,264,282,260,260,272
%N The least number m not less than the n-th prime p such that m^2 - p is prime.
%p f:= proc(n) local p,m;
%p p:= ithprime(n);
%p for m from p+1 by 2 do if isprime(m^2-p) then return m fi od:
%p end proc:
%p f(1):=2:
%p map(f, [$1..100]); # _Robert Israel_, Dec 14 2017
%t Table[m = p = Prime[n]; While[! PrimeQ[m^2 - p], m++]; m, {n, 60}] (* slightly modified by _Robert G. Wilson v_, Dec 14 2017 *)
%o (PARI) vector(100,n,m=prime(n);while(!isprime(m^2-prime(n)),m++);m)
%K nonn
%O 1,1
%A _Zak Seidov_, Dec 13 2017
|
