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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A132466 Let df(n,k) = Product_{i=0..k-1} (n-i) be the descending factorial and let P(m,n) = df(n-1,m-1)^2*(2*n-m)/((m-1)!*m!). Sequence gives P(8,n). 1
0, 0, 0, 0, 0, 0, 0, 1, 80, 1944, 25200, 217800, 1411344, 7361640, 32391216, 124227675, 425339200, 1323786464, 3797876160, 10155802176, 25539739200, 60844672800, 138154965696, 300509773245, 628886888784, 1270898695000, 2488029830000, 4731583685400, 8762192010000 (list; graph; refs; listen; history; internal format)
OFFSET

1,9

CROSSREFS

See A132458 for further information.

Sequence in context: A199533 A060623 A173782 * A154307 A017796 A035735

Adjacent sequences:  A132463 A132464 A132465 * A132467 A132468 A132469

KEYWORD

nonn

AUTHOR

Ottavio D'Antona (dantona(AT)dico.unimi.it), Oct 31 2007

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 14 16:11 EST 2012. Contains 205635 sequences.