A132465 - cp's OEIS frontend

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(2n-m)/((m-1)!*m!). Sequence gives P(7,n).

n	a(n)
1	0
2	0
3	0
4	0
5	0
6	0
7	1
8	63
9	1232
10	13104
11	94500
12	518364
13	2317392
14	8833968
15	29630601
16	89464375
17	247351104
18	634542272
19	1526183568
20	3470399856
21	7511688000
22	15564217536
23	31016698713
24	59686024167
25	111284511184
26	201628350000
27	355896440900
28	613353440700
29	1034083486800

[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]

cp's OEIS Frontend

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(2n-m)/((m-1)!*m!). Sequence gives P(7,n).

Table of values

List of values

cp's OEIS Frontend

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

Table of values

List of values

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(2n-m)/((m-1)!*m!). Sequence gives P(7,n).