A336708 - cp's OEIS frontend

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

n	a(n)
0	1
1	1
2	1
3	1
4	1
5	-1
6	1
7	1
8	0
9	0
10	1
11	1
12	1
13	-1
14	2
15	1
16	1
17	2
18	1
19	0
20	-3
21	1
22	1
23	3
24	6
25	1
26	2
27	-1
28	1
29	1
30	4
31	14
32	21
33	1
34	0
35	11
36	1
37	1
38	5
39	25
40	76
41	80
42	1
43	-5
44	-15
45	1
46	1
47	6
48	39
49	182
50	450
51	322
52	1
53	0
54	-13
55	1
56	1
57	7
58	56
59	355
60	1447
61	2818
62	1347
63	1
64	14
65	77
66	1
67	1
68	8
69	76
70	611
71	3532
72	12175
73	18352
74	5798
75	1
76	0
77	-86

[1, 1, 1, 1, 1, -1, 1, 1, 0, 0, 1, 1, 1, -1, 2, 1, 1, 2, 1, 0, -3, 1, 1, 3, 6, 1, 2, -1, 1, 1, 4, 14, 21, 1, 0, 11, 1, 1, 5, 25, 76, 80, 1, -5, -15, 1, 1, 6, 39, 182, 450, 322, 1, 0, -13, 1, 1, 7, 56, 355, 1447, 2818, 1347, 1, 14, 77, 1, 1, 8, 76, 611, 3532, 12175, 18352, 5798, 1, 0, -86]

cp's OEIS Frontend

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

Table of values

List of values