Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A135038
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A135038 Sums of the products of n consecutive quadruples of numbers. +0
1
0, 840, 8760, 41520, 134544, 347064, 768264, 1523424, 2780064, 4754088, 7715928, 11996688, 17994288, 26179608, 37102632, 51398592, 69794112, 93113352, 122284152, 158344176, 202447056, 255868536, 320012616, 396417696, 486762720 (list; graph; listen)
OFFSET

1,2

COMMENT

a(n) = 51.2n^5-32n^4-48n^3+20n^2+8.8n.

FORMULA

a(1) = 0*1*2*3 a(2) = 0*1*2*3 + 4*5*6*7 ..., a(n) = 0*1*2*3 + 4*5*6*7 + 8*9*10*11 + ... + (2n-1)*(2n)*(2n+1)(2n+2)

O.g.f.: 24*x^2*(35+155*x+65*x^2+x^3)/(-1+x)^6 . - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Feb 14 2008

EXAMPLE

For n = 3, the sum of the first 3 quadruples is 0*1*2*3+4*5*6*7+8*9*10*11 = 8760, the 3rd entry in the sequence.

MAPLE

A135038 := proc(n) 20*n^2+44/5*n-48*n^3-32*n^4+256/5*n^5 ; end: seq(A135038(n), n=1..20) ; - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Feb 14 2008

PROGRAM

(PARI) sumprod3(n) = { local(x, s=0); forstep(x=0, n, 4, s+=x*(x+1)*(x+2)*(x+3); print1(s", ") ) }

CROSSREFS

Adjacent sequences: A135035 A135036 A135037 this_sequence A135039 A135040 A135041

Sequence in context: A092002 A045477 A005952 this_sequence A022052 A055353 A107516

KEYWORD

nonn

AUTHOR

Cino Hilliard (hillcino368(AT)hotmail.com), Feb 11 2008

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified January 8 02:43 EST 2009. Contains 152824 sequences.


AT&T Labs Research