A307665 - cp's OEIS frontend

A307665 A(n,k) = Sum_{j=0..floor(n/k)} binomial(2n,kj+n), square array A(n,k) read by antidiagonals, for n >= 0, k >= 1.

n	a(n)
0	1
1	1
2	3
3	1
4	2
5	11
6	1
7	2
8	7
9	42
10	1
11	2
12	6
13	26
14	163
15	1
16	2
17	6
18	21
19	99
20	638
21	1
22	2
23	6
24	20
25	78
26	382
27	2510
28	1
29	2
30	6
31	20
32	71
33	297
34	1486
35	9908
36	1
37	2
38	6
39	20
40	70
41	262
42	1145
43	5812
44	39203
45	1
46	2
47	6
48	20
49	70
50	253
51	990
52	4447
53	22819
54	155382
55	1
56	2
57	6
58	20
59	70
60	252
61	936
62	3796
63	17358
64	89846
65	616666

[1, 1, 3, 1, 2, 11, 1, 2, 7, 42, 1, 2, 6, 26, 163, 1, 2, 6, 21, 99, 638, 1, 2, 6, 20, 78, 382, 2510, 1, 2, 6, 20, 71, 297, 1486, 9908, 1, 2, 6, 20, 70, 262, 1145, 5812, 39203, 1, 2, 6, 20, 70, 253, 990, 4447, 22819, 155382, 1, 2, 6, 20, 70, 252, 936, 3796, 17358, 89846, 616666]

cp's OEIS Frontend

A307665 A(n,k) = Sum_{j=0..floor(n/k)} binomial(2n,kj+n), square array A(n,k) read by antidiagonals, for n >= 0, k >= 1.

Table of values

List of values

cp's OEIS Frontend

A307665 A(n,k) = Sum_{j=0..floor(n/k)} binomial(2*n,k*j+n), square array A(n,k) read by antidiagonals, for n >= 0, k >= 1.

Table of values

List of values

A307665 A(n,k) = Sum_{j=0..floor(n/k)} binomial(2n,kj+n), square array A(n,k) read by antidiagonals, for n >= 0, k >= 1.