A120059 - cp's OEIS frontend

A120059 Triangle read by rows: T(n,k) is the number of Dyck n-paths (A000108) whose longest pyramid has size k.

n	a(n)
0	1
1	0
2	1
3	0
4	1
5	1
6	0
7	2
8	2
9	1
10	0
11	5
12	6
13	2
14	1
15	0
16	13
17	19
18	7
19	2
20	1
21	0
22	35
23	63
24	24
25	7
26	2
27	1
28	0
29	97
30	212
31	85
32	25
33	7
34	2
35	1
36	0
37	275
38	723
39	307
40	90
41	25
42	7
43	2
44	1
45	0
46	794
47	2491
48	1121
49	330
50	91
51	25
52	7
53	2
54	1
55	0
56	2327
57	8654
58	4129
59	1225
60	335
61	91
62	25
63	7
64	2
65	1

[1, 0, 1, 0, 1, 1, 0, 2, 2, 1, 0, 5, 6, 2, 1, 0, 13, 19, 7, 2, 1, 0, 35, 63, 24, 7, 2, 1, 0, 97, 212, 85, 25, 7, 2, 1, 0, 275, 723, 307, 90, 25, 7, 2, 1, 0, 794, 2491, 1121, 330, 91, 25, 7, 2, 1, 0, 2327, 8654, 4129, 1225, 335, 91, 25, 7, 2, 1]

cp's OEIS Frontend

A120059 Triangle read by rows: T(n,k) is the number of Dyck n-paths (A000108) whose longest pyramid has size k.

Table of values

List of values