A212363 - cp's OEIS frontend

A212363 Number A(n,k) of Dyck n-paths all of whose ascents and descents have lengths equal to 1+k*m (m>=0); square array A(n,k), n>=0, k>=0, read by antidiagonals.

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

[1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 5, 1, 1, 1, 1, 2, 14, 1, 1, 1, 1, 1, 4, 42, 1, 1, 1, 1, 1, 2, 8, 132, 1, 1, 1, 1, 1, 1, 4, 17, 429, 1, 1, 1, 1, 1, 1, 2, 7, 37, 1430, 1, 1, 1, 1, 1, 1, 1, 4, 12, 82, 4862, 1, 1, 1, 1, 1, 1, 1, 2, 7, 22, 185, 16796, 1]

cp's OEIS Frontend

A212363 Number A(n,k) of Dyck n-paths all of whose ascents and descents have lengths equal to 1+k*m (m>=0); square array A(n,k), n>=0, k>=0, read by antidiagonals.

Table of values

List of values