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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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). 1
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; refs; listen; history; text; internal format)
OFFSET
1,8
LINKS
CROSSREFS
See A132458 for further information.
Sequence in context: A258014 A183076 A230660 * A202983 A107319 A243214
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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 25 02:21 EDT 2024. Contains 373691 sequences. (Running on oeis4.)