|
|
A289839
|
|
Primes of the form 8*n^2+8*n+31.
|
|
0
|
|
|
31, 47, 79, 127, 191, 271, 367, 479, 607, 751, 911, 1087, 1279, 1487, 1951, 2207, 2767, 3391, 3727, 4079, 4447, 4831, 5231, 5647, 6079, 6991, 9007, 9551, 10111, 10687, 11279, 11887, 12511, 13151, 13807, 14479, 17327, 20431, 21247, 22079, 24671, 26479, 27407
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
The first 14 terms correspond to n from 0 to 13, which makes 8*n^2+8*n+31 a prime-generating polynomial (see the link).
This is a prime-generating polynomial of the form c*n^2+c*n+p, where c=2^k (k=0,1,2...) and p is prime with c and p containing at most two digits. Prime-generating polynomials of this kind arise for k=0,1,2,3 - see A005846 and A007635 (k=0), A007639 (k=1), and A048988 (k=2).
All terms are of the form 4m+3. Terms 1 and 4 are Mersenne primes (A000668).
|
|
LINKS
|
|
|
EXAMPLE
|
79 is a term as it is a prime corresponding to n=2: 8*4+8*2+31=79.
|
|
MATHEMATICA
|
Select[Range[0, 100]//8#^2+8#+31&, PrimeQ]
|
|
PROG
|
(PARI) for(n=0, 100, isprime(p=8*n^2+8*n+31)&& print1(p ", "))
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|