The OEIS is supported by the many generous donors to the OEIS Foundation.

 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; text; internal format)
 OFFSET 1,9 LINKS Table of n, a(n) for n=1..29. CROSSREFS See A132458 for further information. Sequence in context: A173782 A332580 A333546 * A277764 A328875 A154307 Adjacent sequences: A132463 A132464 A132465 * A132467 A132468 A132469 KEYWORD nonn AUTHOR Ottavio D'Antona (dantona(AT)dico.unimi.it), Oct 31 2007 STATUS approved

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

Last modified July 24 12:16 EDT 2024. Contains 374583 sequences. (Running on oeis4.)