login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A034262 n^3+n. 16
0, 2, 10, 30, 68, 130, 222, 350, 520, 738, 1010, 1342, 1740, 2210, 2758, 3390, 4112, 4930, 5850, 6878, 8020, 9282, 10670, 12190, 13848, 15650, 17602, 19710, 21980, 24418, 27030, 29822, 32800, 35970, 39338, 42910, 46692, 50690, 54910 (list; graph; refs; listen; history; internal format)
OFFSET

0,2

COMMENTS

n such that x^3 + x + n factors over the integers. - James Buddenhagen (jbuddenh(AT)gmail.com), Apr 19 2005

If a(n)=X [A155977], Y=b(n) [A071253], Z=c(n) [A034262], then X^2+Y^2 = n*Z^3; Ex: If n=3, a(3)=270, b(3)=90, c(3)=30, then 270^2+90^2=3*30^3; [From Vincenzo Librandi, Nov 24 2010]

FORMULA

a(n)=A002522(n)*A001477(n). - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Apr 20 2008

for n>1 a(n) = floor(n^5/(n^2-1)) [From Gary Detlefs (gdetlefs(AT)aol.com), Feb 10 2010]

MAPLE

with(combinat, fibonacci):seq(fibonacci(3, i)*i, i=0..38); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Mar 20 2008

with(combinat):seq(lcm(fibonacci(3, n), n), n=0..38); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Apr 20 2008

a:=n->sum(1+sum(n, k=1..n), k=1..n):seq(a(n), n=0...38); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Jun 11 2008

MATHEMATICA

Table[(n^3+n), {n, 0, 4!}] [From Vladimir Orlovsky (4vladimir(AT)gmail.com), Mar 06 2010]

CROSSREFS

Cf. A001477, A002522.

Cf. A000290, A001477.

Cf. A071253, A155977 [From Vincenzo Librandi (vincenzo.librandi(AT)tin.it), Feb 01 2009]

Sequence in context: A047198 A162524 A065137 * A180499 A167214 A034827

Adjacent sequences:  A034259 A034260 A034261 * A034263 A034264 A034265

KEYWORD

nonn

AUTHOR

Stuart M. Ellerstein (ellerstein(AT)aol.com), Apr 21 2000

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 13 08:12 EST 2012. Contains 205451 sequences.