|
|
A111296
|
|
Smallest prime of the form n*k + 1, where each k may be used in the sequence only once.
|
|
1
|
|
|
2, 5, 13, 13, 31, 31, 71, 73, 73, 71, 199, 157, 157, 197, 241, 241, 409, 199, 419, 401, 547, 419, 691, 409, 701, 547, 919, 701, 929, 691, 1117, 929, 1321, 919, 1471, 1117, 1777, 1483, 1483, 1321, 2297, 1471, 1979, 2069, 2251, 1979, 2069, 1777, 2549, 2251
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
LINKS
|
|
|
EXAMPLE
|
a(10) = 10*13 + 1 = 131 though 10*10 + 1 = 101 is also prime but k=10 has already been used by n=7.
|
|
MATHEMATICA
|
l = {}; Do[k = 1; While[MemberQ[l, k] || !PrimeQ[n*k + 1], k++ ]; Print[n*k+1]; AppendTo[l, k], {n, 30}] (* Ryan Propper, Jun 15 2006 *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|