OFFSET
1,2
COMMENTS
Conjecture: a(n)>0. If the conjecture is true, then there exist infinitely many primes of the form m^2+1.
LINKS
Alois P. Heinz and Charles R Greathouse IV, Table of n, a(n) for n = 1..10000 (first 1000 terms from Heinz)
MAPLE
a:= proc(n) local k;
for k while not(isprime(4*n*k+1) and issqr (n*k)) do od; k
end:
seq (a(n), n=1..70); # Alois P. Heinz, May 13 2012
PROG
(PARI) a(n)=my(N=4*n*core(n), k=0); while(!isprime(k++^2*N+1), ); k^2*N/(4*n) \\ Charles R Greathouse IV, May 14 2012
(Magma) S:=[]; for n in [1..62] do k:=1; while not IsPrime(4*n*k+1) or not IsSquare(n*k) do k:=k+1; end while; Append(~S, k); end for; S; // Bruno Berselli, May 15 2012
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Vladimir Shevelev, May 13 2012
STATUS
approved