|
Search: id:A101094
|
|
| |
|
| 1, 11, 57, 203, 574, 1386, 2982, 5874, 10791, 18733, 31031, 49413, 76076, 113764, 165852, 236436, 330429, 453663, 612997, 816431, 1073226, 1394030, 1791010, 2277990, 2870595, 3586401, 4445091, 5468617, 6681368, 8110344, 9785336
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
LINKS
|
C. Rossiter, Depictions, Explorations and Formulas of the Euler/Pascal Cube.
|
|
FORMULA
|
a(n) = {(n*(1 + n)*(2 + n)*(3 + n)*(1 + n*(3 + n)))/120}.
This sequence could be obtained from the general formula n*(n+1)*(n+2)*(n+3)* ...* (n+k) *(n*(n+k) + (k-1)*k/6)/((k+3)!/6) at k=3. - Alexander R. Povolotsky (pevnev(AT)juno.com), May 17 2008
|
|
MATHEMATICA
|
s1=s2=s3=0; lst={}; Do[s1+=n^3; s2+=s1; s3+=s2; AppendTo[lst, s3], {n, 0, 6!}]; lst [From Vladimir Orlovsky (4vladimir(AT)gmail.com), Jan 15 2009]
|
|
PROGRAM
|
(PARI) a(n)=sum(l=1, n, sum(j=1, l, sum(m=1, j, sum(i=m*(m+1)/2-m+1, m*(m+1)/2, (2*i-1))))) - Alexander R. Povolotsky (pevnev(AT)juno.com), May 17 2008
|
|
CROSSREFS
|
Cf. A024166, A101097.
Cf. A101102, A101097, A024166, A000537.
Cf. A024166 [From Vladimir Orlovsky (4vladimir(AT)gmail.com), Jan 15 2009]
Sequence in context: A051946 A114030 A071984 this_sequence A014470 A048366 A107425
Adjacent sequences: A101091 A101092 A101093 this_sequence A101095 A101096 A101097
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Cecilia Rossiter (cecilia(AT)noticingnumbers.net), Dec 15 2004
|
|
EXTENSIONS
|
Edited by Ralf Stephan, Dec 16 2004
|
|
|
Search completed in 0.002 seconds
|
