|
| |
|
|
A084380
|
|
a(n) = n^3 + 2.
|
|
3
| |
|
|
2, 3, 10, 29, 66, 127, 218, 345, 514, 731, 1002, 1333, 1730, 2199, 2746, 3377, 4098, 4915, 5834, 6861, 8002, 9263, 10650, 12169, 13826, 15627, 17578, 19685, 21954, 24391, 27002, 29793, 32770, 35939, 39306, 42877, 46658, 50655, 54874, 59321, 64002
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,1
|
|
|
COMMENTS
| This sequence contains no square numbers. A proof may be similar to the link.
|
|
|
LINKS
| Cino Hilliard, Proof that n^3+7 <> k^2 for all integers n,k.
Index to sequences with linear recurrences with constant coefficients, signature (4,-6,4,-1)
|
|
|
FORMULA
| G.f. ( 2-5*x+10*x^2-x^3 ) / (x-1)^4 . - R. J. Mathar, Feb 16 2011
|
|
|
MATHEMATICA
| f[n_]:=n^3+2; f[Range[60]] (* Offset 1. From Vladimir Joseph Stephan Orlovsky, Feb 14 2011*)
|
|
|
PROG
| (PARI) n3pm(n, m) = { for(x=1, n, y=x^3+m; print1(y" ")) }
|
|
|
CROSSREFS
| Cf. sequences for n^3+7, n^3+17, n^3+3. Cf. A034324.
Sequence in context: A160909 A004980 A034324 * A121909 A153909 A131764
Adjacent sequences: A084377 A084378 A084379 * A084381 A084382 A084383
|
|
|
KEYWORD
| easy,nonn
|
|
|
AUTHOR
| Cino Hilliard (hillcino368(AT)gmail.com), Jun 23 2003
|
|
|
EXTENSIONS
| Extended to offset 0 - R. J. Mathar, Feb 16 2011
|
| |
|
|
