OFFSET
1,4
COMMENTS
According to Bunyakovsky's conjecture, if f(n,X) is irreducible over the rationals, f(n,x) is prime for infinitely many positive integers x. It is irreducible for 1 <= n <= 1800. - Robert Israel, Jul 01 2018
LINKS
Robert Israel, Table of n, a(n) for n = 1..400
Wikipedia, Bunyakovsky conjecture
MAPLE
P:= 1: q:= 1:
for n from 1 to 100 do
q:= q+1;
while isprime(q) do q:= q+1 od;
P:= P + q*x^n;
if not irreduc(P) then A[n]:= 0
else
Pf:= unapply(P, x);
for xx from 1 while not isprime(Pf(xx)) do od:
A[n]:= xx;
fi
od:
seq(A[n], n=1..100); # Robert Israel, Jul 01 2018
CROSSREFS
KEYWORD
nonn
AUTHOR
Amarnath Murthy, Sep 25 2003
EXTENSIONS
More terms from Tom Mueller (muel4503(AT)uni-trier.de), May 04 2004
More terms from David Wasserman, Jul 25 2005
STATUS
approved