A292973 - cp's OEIS frontend

A292973 Square array T(n,k), n>=0, k>=0, read by antidiagonals, where T(0,k) = 1 and T(n,k) = (-1)^(k+1) * k! * Sum_{i=0..n-1} (-1)^i * binomial(n-1,i) * binomial(i+1,k) * T(n-1-i,k) for n > 0.

n	a(n)
0	1
1	1
2	-1
3	1
4	1
5	2
6	1
7	0
8	-1
9	-5
10	1
11	0
12	2
13	-2
14	15
15	1
16	0
17	0
18	-6
19	9
20	-52
21	1
22	0
23	0
24	6
25	24
26	-4
27	203
28	1
29	0
30	0
31	0
32	-24
33	-140
34	-95
35	-877
36	1
37	0
38	0
39	0
40	24
41	60
42	870
43	414
44	4140
45	1
46	0
47	0
48	0
49	0
50	-120
51	240
52	-5922
53	49
54	-21147
55	1
56	0
57	0
58	0
59	0
60	120
61	360
62	-4830
63	45416
64	-10088
65	115975

[1, 1, -1, 1, 1, 2, 1, 0, -1, -5, 1, 0, 2, -2, 15, 1, 0, 0, -6, 9, -52, 1, 0, 0, 6, 24, -4, 203, 1, 0, 0, 0, -24, -140, -95, -877, 1, 0, 0, 0, 24, 60, 870, 414, 4140, 1, 0, 0, 0, 0, -120, 240, -5922, 49, -21147, 1, 0, 0, 0, 0, 120, 360, -4830, 45416, -10088, 115975]

cp's OEIS Frontend

A292973 Square array T(n,k), n>=0, k>=0, read by antidiagonals, where T(0,k) = 1 and T(n,k) = (-1)^(k+1) * k! * Sum_{i=0..n-1} (-1)^i * binomial(n-1,i) * binomial(i+1,k) * T(n-1-i,k) for n > 0.

Table of values

List of values