A341359 - cp's OEIS frontend

A341359 Square array T(m,n) read by antidiagonals, satisfying shifted Catalan recurrences: T(m,0) = 1 and T(m,n) = Sum_{k=0..n-1} T(m,k) * T(m,(n-1-k+m) mod n) for all n > 0.

n	a(n)
0	1
1	1
2	1
3	1
4	1
5	2
6	1
7	1
8	2
9	5
10	1
11	1
12	2
13	5
14	14
15	1
16	1
17	2
18	6
19	15
20	42
21	1
22	1
23	2
24	5
25	26
26	51
27	132
28	1
29	1
30	2
31	5
32	30
33	142
34	188
35	429
36	1
37	1
38	2
39	6
40	14
41	305
42	882
43	731
44	1430
45	1
46	1
47	2
48	5
49	17
50	210
51	3955
52	5910
53	2950
54	4862
55	1
56	1
57	2
58	5
59	22
60	50
61	5894
62	57855
63	41610
64	12235
65	16796
66	1
67	1
68	2
69	6
70	30
71	65
72	2550
73	209146
74	908880
75	303390
76	51822
77	58786

[1, 1, 1, 1, 1, 2, 1, 1, 2, 5, 1, 1, 2, 5, 14, 1, 1, 2, 6, 15, 42, 1, 1, 2, 5, 26, 51, 132, 1, 1, 2, 5, 30, 142, 188, 429, 1, 1, 2, 6, 14, 305, 882, 731, 1430, 1, 1, 2, 5, 17, 210, 3955, 5910, 2950, 4862, 1, 1, 2, 5, 22, 50, 5894, 57855, 41610, 12235, 16796, 1, 1, 2, 6, 30, 65, 2550, 209146, 908880, 303390, 51822, 58786]

cp's OEIS Frontend

A341359 Square array T(m,n) read by antidiagonals, satisfying shifted Catalan recurrences: T(m,0) = 1 and T(m,n) = Sum_{k=0..n-1} T(m,k) * T(m,(n-1-k+m) mod n) for all n > 0.

Table of values

List of values