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.

A109191 Triangle read by rows: T(n,k) is number of Grand Motzkin paths of length n having k hills (i.e., ud's starting at level 0). (A Grand Motzkin path is a path in the half-plane x>=0, starting at (0,0), ending at (n,0) and consisting of steps u=(1,1), d=(1,-1) and h=(1,0).).

Table of values

n a(n)
0 1
1 1
2 2
3 1
4 5
5 2
6 13
7 5
8 1
9 34
10 14
11 3
12 91
13 40
14 9
15 1
16 247
17 114
18 28
19 4
20 678
21 327
22 87
23 14
24 1
25 1877
26 942
27 267
28 48
29 5
30 5233
31 2723
32 815
33 161
34 20
35 1
36 14674
37 7892
38 2478
39 528
40 75
41 6
42 41349
43 22924
44 7512
45 1706
46 270
47 27
48 1
49 117001
50 66712
51 22718
52 5452
53 941
54 110
55 7
56 332260

List of values

[1, 1, 2, 1, 5, 2, 13, 5, 1, 34, 14, 3, 91, 40, 9, 1, 247, 114, 28, 4, 678, 327, 87, 14, 1, 1877, 942, 267, 48, 5, 5233, 2723, 815, 161, 20, 1, 14674, 7892, 2478, 528, 75, 6, 41349, 22924, 7512, 1706, 270, 27, 1, 117001, 66712, 22718, 5452, 941, 110, 7, 332260]