A361834 - cp's OEIS frontend

A361834 Square array T(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where T(n,k) = Sum_{j=0..n} (-1)^(n-j) * binomial(2j,j) binomial(k*j,n-j).

n	a(n)
0	1
1	1
2	2
3	1
4	2
5	6
6	1
7	2
8	4
9	20
10	1
11	2
12	2
13	8
14	70
15	1
16	2
17	0
18	-2
19	16
20	252
21	1
22	2
23	-2
24	-10
25	-14
26	32
27	924
28	1
29	2
30	-4
31	-16
32	-22
33	-32
34	64
35	3432
36	1
37	2
38	-6
39	-20
40	-10
41	12
42	-30
43	128
44	12870
45	1
46	2
47	-8
48	-22
49	20
50	118
51	174
52	64
53	256
54	48620
55	1
56	2
57	-10
58	-22
59	66
60	242
61	304
62	344
63	346
64	512
65	184756

[1, 1, 2, 1, 2, 6, 1, 2, 4, 20, 1, 2, 2, 8, 70, 1, 2, 0, -2, 16, 252, 1, 2, -2, -10, -14, 32, 924, 1, 2, -4, -16, -22, -32, 64, 3432, 1, 2, -6, -20, -10, 12, -30, 128, 12870, 1, 2, -8, -22, 20, 118, 174, 64, 256, 48620, 1, 2, -10, -22, 66, 242, 304, 344, 346, 512, 184756]

cp's OEIS Frontend

A361834 Square array T(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where T(n,k) = Sum_{j=0..n} (-1)^(n-j) * binomial(2j,j) binomial(k*j,n-j).

Table of values

List of values

cp's OEIS Frontend

A361834 Square array T(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where T(n,k) = Sum_{j=0..n} (-1)^(n-j) * binomial(2*j,j) * binomial(k*j,n-j).

Table of values

List of values

A361834 Square array T(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where T(n,k) = Sum_{j=0..n} (-1)^(n-j) * binomial(2j,j) binomial(k*j,n-j).