OFFSET
2,3
COMMENTS
Minimal n of sequence A103783. Weak conjecture: sequence is defined for all k>=2; strong conjecture: a(k)<=(prime(k))^2;
EXAMPLE
P(2)*1-1=5 is prime, so a(2)=1;
P(9)*3-1=669278609 is prime, so a(9)=3;
MATHEMATICA
nmax = 2^2048; npd = 2; n = 2; npd = npd*Prime[n]; While[npd < nmax, tt = 1; cp = npd*tt - 1; While[(tt <= (Prime[n])^2) && (! (PrimeQ[cp])), tt = tt + 1; cp = npd*tt - 1]; If[tt >= (Prime[n])^2, cp = -cp; tn1 = -tt, tn1 = tt]; Print[tn1]; n = n + 1; npd = npd*Prime[n]]
CROSSREFS
KEYWORD
nonn
AUTHOR
Lei Zhou, Feb 15 2005
STATUS
approved