|
| |
|
|
A084378
|
|
a(n) = n^3 + 3.
|
|
4
|
|
|
|
4, 11, 30, 67, 128, 219, 346, 515, 732, 1003, 1334, 1731, 2200, 2747, 3378, 4099, 4916, 5835, 6862, 8003, 9264, 10651, 12170, 13827, 15628, 17579, 19686, 21955, 24392, 27003, 29794, 32771, 35940, 39307, 42878, 46659, 50656, 54875, 59322, 64003
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1,1
|
|
|
LINKS
|
Table of n, a(n) for n=1..40.
Cino Hilliard, Proof that n^3+7 <> k^2 for all integers n,k.
|
|
|
MATHEMATICA
|
f[n_]:=n^3+3; f[Range[60]] (*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. sequence for n^3+7.
Sequence in context: A110579 A024829 A224215 * A099065 A102281 A026583
Adjacent sequences: A084375 A084376 A084377 * A084379 A084380 A084381
|
|
|
KEYWORD
|
easy,nonn
|
|
|
AUTHOR
|
Cino Hilliard (hillcino368(AT)gmail.com), Jun 23 2003
|
|
|
STATUS
|
approved
|
| |
|
|
