A127068 - cp's OEIS frontend

A127068 Let d(m, 0) = 1, d(m, 1) = m, and d(m, k) = (m - k + 1)d(m+1, k-1) - (k-1)(m+1) d(m+2, k-2). Sequence gives d(3,n).

n	a(n)
0	1
1	3
2	4
3	-30
4	-216
5	420
6	14400
7	22680
8	-1411200
9	-8482320
10	195955200
11	2399997600
12	-36883123200
13	-788107320000
14	9066542284800
15	318173519664000
16	-2824576634880000
17	-159078423407904000
18	1088403529973760000
19	97970873094110016000
20	-508476519708917760000
21	-73631427647097640320000

[1, 3, 4, -30, -216, 420, 14400, 22680, -1411200, -8482320, 195955200, 2399997600, -36883123200, -788107320000, 9066542284800, 318173519664000, -2824576634880000, -159078423407904000, 1088403529973760000, 97970873094110016000, -508476519708917760000, -73631427647097640320000]

cp's OEIS Frontend

A127068 Let d(m, 0) = 1, d(m, 1) = m, and d(m, k) = (m - k + 1)d(m+1, k-1) - (k-1)(m+1) d(m+2, k-2). Sequence gives d(3,n).

Table of values

List of values

cp's OEIS Frontend

A127068 Let d(m, 0) = 1, d(m, 1) = m, and d(m, k) = (m - k + 1)*d(m+1, k-1) - (k-1)*(m+1) d(m+2, k-2). Sequence gives d(3,n).

Table of values

List of values

A127068 Let d(m, 0) = 1, d(m, 1) = m, and d(m, k) = (m - k + 1)d(m+1, k-1) - (k-1)(m+1) d(m+2, k-2). Sequence gives d(3,n).