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.

A190172 Triangle read by rows: T(n,k) is the number of peakless Motzkin paths of length n having k UHD's; here U=(1,1), H=(1,0), and D=(1,-1).

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 1
5 2
6 2
7 4
8 4
9 8
10 8
11 1
12 16
13 18
14 3
15 33
16 40
17 9
18 69
19 90
20 25
21 1
22 146
23 204
24 69
25 4
26 312
27 467
28 183
29 16
30 673
31 1074
32 479
33 56
34 1
35 1463
36 2481
37 1239
38 185
39 5
40 3202
41 5752
42 3180
43 576
44 25
45 7050
46 13378
47 8104
48 1734
49 105
50 1
51 15605
52 31196
53 20544
54 5076
55 405
56 6
57 34705
58 72912
59 51852
60 14546
61 1451
62 36

List of values

[1, 1, 1, 1, 1, 2, 2, 4, 4, 8, 8, 1, 16, 18, 3, 33, 40, 9, 69, 90, 25, 1, 146, 204, 69, 4, 312, 467, 183, 16, 673, 1074, 479, 56, 1, 1463, 2481, 1239, 185, 5, 3202, 5752, 3180, 576, 25, 7050, 13378, 8104, 1734, 105, 1, 15605, 31196, 20544, 5076, 405, 6, 34705, 72912, 51852, 14546, 1451, 36]