Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A132465
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A132465 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(7,n). +0
2
0, 0, 0, 0, 0, 0, 1, 63, 1232, 13104, 94500, 518364, 2317392, 8833968, 29630601, 89464375, 247351104, 634542272, 1526183568, 3470399856, 7511688000, 15564217536, 31016698713, 59686024167, 111284511184, 201628350000, 355896440900, 613353440700, 1034083486800 (list; graph; listen)
OFFSET

1,8

CROSSREFS

See A132458 for further information.

Sequence in context: A024004 A091027 A112494 this_sequence A107319 A005463 A017779

Adjacent sequences: A132462 A132463 A132464 this_sequence A132466 A132467 A132468

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 3 01:16 EST 2008. Contains 151161 sequences.


AT&T Labs Research