Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A058649
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A058649 2^(n-4)*n*(n+1)*(n^2+5*n-2). +0
4
0, 1, 18, 132, 680, 2880, 10752, 36736, 117504, 357120, 1041920, 2939904, 8067072, 21618688, 56770560, 146472960, 372113408, 932511744, 2308571136, 5653135360, 13707509760, 32942063616, 78525759488, 185799278592, 436627046400 (list; graph; listen)
OFFSET

0,3

REFERENCES

A. P. Prudnikov, Yu. A. Brychkov and O.I. Marichev, "Integrals and Series", Volume 1: "Elementary Functions", Chapter 4: "Finite Sums", New York, Gordon and Breach Science Publishers, 1986-1992.

FORMULA

Sum(i^4 * binomial(n, i), i=1..n) = 2^(n-4)*n*(n+1)*(n^2+5*n-2).

G.f.:(x*(8*x^2-8*x-1))/(2*x-1)^5 [From Maksym Voznyy (voznyy(AT)mail.ru), Jul 26 2009]

CROSSREFS

Sequence in context: A027566 A041620 A142965 this_sequence A103308 A010824 A022710

Adjacent sequences: A058646 A058647 A058648 this_sequence A058650 A058651 A058652

KEYWORD

nonn

AUTHOR

Yong Kong (ykong(AT)curagen.com), Dec 26 2000

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 November 23 17:09 EST 2009. Contains 167438 sequences.


AT&T Labs Research