A293015 - cp's OEIS frontend

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

n	a(n)
0	1
1	1
2	-1
3	1
4	-1
5	0
6	1
7	0
8	-1
9	1
10	1
11	0
12	-1
13	2
14	1
15	1
16	0
17	0
18	-3
19	9
20	-2
21	1
22	0
23	0
24	-1
25	-3
26	4
27	-9
28	1
29	0
30	0
31	0
32	-4
33	20
34	-95
35	-9
36	1
37	0
38	0
39	0
40	-1
41	-10
42	150
43	-414
44	50
45	1
46	0
47	0
48	0
49	0
50	-5
51	-10
52	504
53	49
54	267
55	1
56	0
57	0
58	0
59	0
60	-1
61	-15
62	105
63	-343
64	10088
65	413
66	1
67	0
68	0
69	0
70	0
71	0
72	-6

[1, 1, -1, 1, -1, 0, 1, 0, -1, 1, 1, 0, -1, 2, 1, 1, 0, 0, -3, 9, -2, 1, 0, 0, -1, -3, 4, -9, 1, 0, 0, 0, -4, 20, -95, -9, 1, 0, 0, 0, -1, -10, 150, -414, 50, 1, 0, 0, 0, 0, -5, -10, 504, 49, 267, 1, 0, 0, 0, 0, -1, -15, 105, -343, 10088, 413, 1, 0, 0, 0, 0, 0, -6]

cp's OEIS Frontend

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

Table of values

List of values