login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A060459 a(n) = (n*(n+1))^3. 4
0, 8, 216, 1728, 8000, 27000, 74088, 175616, 373248, 729000, 1331000, 2299968, 3796416, 6028568, 9261000, 13824000, 20123648, 28652616, 40001688, 54872000, 74088000, 98611128, 129554216, 168196608, 216000000, 274625000, 345948408 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

LINKS

Harry J. Smith, Table of n, a(n) for n = 0..1000

FORMULA

a(n) = A002378(n)^3. - Zerinvary Lajos, Apr 11 2006

G.f.: 8*x*(1 + 20*x + 48*x^2 + 20*x^3 + x^4)/(1-x)^7. - Colin Barker, Jan 29 2012

Sum_{n>=1} 1/a(n) = 10 - Pi^2. - Vaclav Kotesovec, Feb 14 2015

EXAMPLE

(0)^3, (1+1)^3, (2+2+2)^3, (3+3+3+3)^3, (4+4+4+4+4)^3, (5+5+5+5+5+5)^3, ...

MAPLE

seq((n*(n+1))^3, n=0..66);

MATHEMATICA

lst={}; Do[s0=n^3; s1=(n+1)^3; AppendTo[lst, (s1*s0)], {n, 0, 5!}]; lst (* Vladimir Joseph Stephan Orlovsky, Feb 19 2009 *)

PROG

(PARI) { for (n=0, 1000, write("b060459.txt", n, " ", (n*(n + 1))^3); ) } \\ Harry J. Smith, Jul 05 2009

CROSSREFS

Cf. A002378.

Sequence in context: A239222 A275023 A163289 * A007409 A195506 A069045

Adjacent sequences:  A060456 A060457 A060458 * A060460 A060461 A060462

KEYWORD

easy,nonn

AUTHOR

Jason Earls, Apr 09 2001

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 22 04:27 EST 2020. Contains 331133 sequences. (Running on oeis4.)