|
|
A060834
|
|
a(n) = 6*n^2 + 6*n + 31.
|
|
2
|
|
|
31, 43, 67, 103, 151, 211, 283, 367, 463, 571, 691, 823, 967, 1123, 1291, 1471, 1663, 1867, 2083, 2311, 2551, 2803, 3067, 3343, 3631, 3931, 4243, 4567, 4903, 5251, 5611, 5983, 6367, 6763, 7171, 7591, 8023, 8467, 8923, 9391, 9871, 10363, 10867, 11383
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,1
|
|
COMMENTS
|
First 29 values are primes.
Let P(n) = 6*n^2 + 6*n + 31. The polynomial P(2*n-14) = 24*n^2 - 660*n + 4567 takes distinct prime values for n = 0 to 28.
The value of the polynomial 2*P(3/2*(n-10)) = 27*n^2 - 522*n + 2582 for n = 0 to 22 is either double a prime or a prime (alternately).
The value of the polynomial 4*P(4/3*(n-9)) = 32*n^2 - 552*n + 2469 for n = 0 to 28 is either prime or 3 times a prime, except when n = 16. (End)
Also, numbers k such that 2*k/3 - 2/3 - 19 is a perfect square. - Bruno Berselli, Apr 23 2018
Equivalently, numbers k such that 6*k - 177 is a square. - Vincenzo Librandi, Apr 23 2018
|
|
REFERENCES
|
Donald D. Spencer, Computers in Number Theory, Computer Science Press, Rockville, MD, 1982, pp. 118-119.
|
|
LINKS
|
|
|
FORMULA
|
O.g.f.: -(31-50*x+31*x^2)/(-1+x)^3.
a(0)=31, a(1)=43, a(2)=67, a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3). - Harvey P. Dale, Aug 09 2011
|
|
EXAMPLE
|
a(29)=4903, prime. a(30)=5251, nonprime.
|
|
MATHEMATICA
|
Table[6n^2+6n+31, {n, 0, 60}] (* or *) LinearRecurrence[{3, -3, 1}, {31, 43, 67}, 60] (* Harvey P. Dale, Aug 09 2011 *)
|
|
PROG
|
(PARI) { for (n=0, 1000, write("b060834.txt", n, " ", 6*n^2 + 6*n + 31); ) } \\ Harry J. Smith, Jul 19 2009
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
EXTENSIONS
|
More terms from Larry Reeves (larryr(AT)acm.org), May 07 2001
|
|
STATUS
|
approved
|
|
|
|