|
| |
|
|
A060834
|
|
6n^2 + 6n + 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; internal format)
|
|
|
|
OFFSET
| 0,1
|
|
|
COMMENTS
| First 29 values are primes.
|
|
|
REFERENCES
| Donald D. Spencer, Computers in Number Theory, Computer Science Press, Rockville, MD, 1982, pp. 118-119.
|
|
|
LINKS
| Harry J. Smith, Table of n, a(n) for n=0,...,1000
|
|
|
FORMULA
| O.g.f.: -(31-50*x+31*x^2)/(-1+x)^3 . a(n) = A049598(n)+31. - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Feb 05 2008
a(0)=31, a(1)=43, a(2)=67, a(n)=3*a(n-1)-3*a(n-2)+a(n-3) [From 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] (* From Harvey P. Dale, Aug 09 2011 *)
|
|
|
PROG
| (PARI) { for (n=0, 1000, write("b060834.txt", n, " ", 6*n^2 + 6*n + 31); ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Jul 19 2009]
|
|
|
CROSSREFS
| Cf. A060844.
Sequence in context: A118637 A096163 A139883 * A060844 A112789 A161615
Adjacent sequences: A060831 A060832 A060833 * A060835 A060836 A060837
|
|
|
KEYWORD
| easy,nonn
|
|
|
AUTHOR
| Jason Earls (zevi_35711(AT)yahoo.com), May 02 2001
|
|
|
EXTENSIONS
| More terms from Larry Reeves (larryr(AT)acm.org), May 07 2001
|
| |
|
|
