A064645 - cp's OEIS frontend

A064645 Table where the entry (n,k) (n >= 0, k >= 0) gives number of Motzkin paths of the length n with the minimum peak width of k.

n	a(n)
0	1
1	1
2	1
3	2
4	1
5	1
6	4
7	1
8	1
9	1
10	9
11	2
12	1
13	1
14	1
15	21
16	4
17	1
18	1
19	1
20	1
21	51
22	8
23	2
24	1
25	1
26	1
27	1
28	127
29	17
30	4
31	1
32	1
33	1
34	1
35	1
36	323
37	37
38	8
39	2
40	1
41	1
42	1
43	1
44	1
45	835
46	82
47	16
48	4
49	1
50	1
51	1
52	1
53	1
54	1
55	2188
56	185
57	33
58	8
59	2
60	1
61	1
62	1
63	1
64	1
65	1
66	5798
67	423
68	69
69	16
70	4
71	1
72	1
73	1
74	1
75	1
76	1
77	1
78	15511
79	978
80	146
81	32
82	8
83	2
84	1
85	1
86	1
87	1
88	1
89	1
90	1
91	41835
92	2283
93	312
94	65
95	16
96	4
97	1
98	1
99	1
100	1
101	1
102	1
103	1
104	1

[1, 1, 1, 2, 1, 1, 4, 1, 1, 1, 9, 2, 1, 1, 1, 21, 4, 1, 1, 1, 1, 51, 8, 2, 1, 1, 1, 1, 127, 17, 4, 1, 1, 1, 1, 1, 323, 37, 8, 2, 1, 1, 1, 1, 1, 835, 82, 16, 4, 1, 1, 1, 1, 1, 1, 2188, 185, 33, 8, 2, 1, 1, 1, 1, 1, 1, 5798, 423, 69, 16, 4, 1, 1, 1, 1, 1, 1, 1, 15511, 978, 146, 32, 8, 2, 1, 1, 1, 1, 1, 1, 1, 41835, 2283, 312, 65, 16, 4, 1, 1, 1, 1, 1, 1, 1, 1]

cp's OEIS Frontend

A064645 Table where the entry (n,k) (n >= 0, k >= 0) gives number of Motzkin paths of the length n with the minimum peak width of k.

Table of values

List of values