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.

A109189 Triangle read by rows: T(n,k) is number of Grand Motzkin paths of length n having k (1,0)-steps at level zero. (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 0
2 1
3 2
4 0
5 1
6 2
7 4
8 0
9 1
10 8
11 4
12 6
13 0
14 1
15 16
16 20
17 6
18 8
19 0
20 1
21 46
22 40
23 36
24 8
25 10
26 0
27 1
28 114
29 128
30 72
31 56
32 10
33 12
34 0
35 1
36 310
37 324
38 254
39 112
40 80
41 12
42 14
43 0
44 1
45 822
46 932
47 654
48 432
49 160
50 108
51 14
52 16
53 0
54 1
55 2238
56 2540
57 1986
58 1128
59 670
60 216
61 140
62 16
63 18
64 0
65 1
66 6094
67 7164
68 5546

List of values

[1, 0, 1, 2, 0, 1, 2, 4, 0, 1, 8, 4, 6, 0, 1, 16, 20, 6, 8, 0, 1, 46, 40, 36, 8, 10, 0, 1, 114, 128, 72, 56, 10, 12, 0, 1, 310, 324, 254, 112, 80, 12, 14, 0, 1, 822, 932, 654, 432, 160, 108, 14, 16, 0, 1, 2238, 2540, 1986, 1128, 670, 216, 140, 16, 18, 0, 1, 6094, 7164, 5546]