Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A132466
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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). +0
2
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; listen)
OFFSET

1,9

CROSSREFS

See A132458 for further information.

Sequence in context: A038727 A151603 A060623 this_sequence A154307 A017796 A035735

Adjacent sequences: A132463 A132464 A132465 this_sequence A132467 A132468 A132469

KEYWORD

nonn

AUTHOR

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

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 December 10 00:48 EST 2009. Contains 170565 sequences.


AT&T Labs Research