cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A364386 Triangle T(n,k) read by rows: the number of Motzkin paths of length n that have k nodes at their peak level, 1 <= k <= n+1.

Table of values

n a(n)
0 1
1 0
2 1
3 1
4 0
5 1
6 2
7 1
8 0
9 1
10 4
11 3
12 1
13 0
14 1
15 8
16 7
17 4
18 1
19 0
20 1
21 18
22 15
23 11
24 5
25 1
26 0
27 1
28 44
29 33
30 26
31 16
32 6
33 1
34 0
35 1
36 113
37 78
38 59
39 42
40 22
41 7
42 1
43 0
44 1
45 296
46 197
47 138
48 101
49 64
50 29
51 8
52 1
53 0
54 1
55 782
56 518
57 342
58 240
59 165
60 93
61 37
62 9
63 1
64 0
65 1
66 2076
67 1388
68 892
69 590
70 406
71 258
72 130
73 46
74 10
75 1
76 0
77 1

List of values

[1, 0, 1, 1, 0, 1, 2, 1, 0, 1, 4, 3, 1, 0, 1, 8, 7, 4, 1, 0, 1, 18, 15, 11, 5, 1, 0, 1, 44, 33, 26, 16, 6, 1, 0, 1, 113, 78, 59, 42, 22, 7, 1, 0, 1, 296, 197, 138, 101, 64, 29, 8, 1, 0, 1, 782, 518, 342, 240, 165, 93, 37, 9, 1, 0, 1, 2076, 1388, 892, 590, 406, 258, 130, 46, 10, 1, 0, 1]