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!)
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

%I #1 Dec 09 2007 03:00:00

%S 0,0,0,0,0,0,0,1,80,1944,25200,217800,1411344,7361640,32391216,

%T 124227675,425339200,1323786464,3797876160,10155802176,25539739200,

%U 60844672800,138154965696,300509773245,628886888784,1270898695000,2488029830000,4731583685400,8762192010000

%N 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).

%Y See A132458 for further information.

%K nonn

%O 1,9

%A 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 | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 29 06:36 EDT 2024. Contains 373826 sequences. (Running on oeis4.)