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.

A091965 Triangle read by rows: T(n,k) = number of lattice paths from (0,0) to (n,k) that do not go below the line y=0 and consist of steps U=(1,1), D=(1,-1) and three types of steps H=(1,0) (left factors of 3-Motzkin steps).

Table of values

n a(n)
0 1
1 3
2 1
3 10
4 6
5 1
6 36
7 29
8 9
9 1
10 137
11 132
12 57
13 12
14 1
15 543
16 590
17 315
18 94
19 15
20 1
21 2219
22 2628
23 1629
24 612
25 140
26 18
27 1
28 9285
29 11732
30 8127
31 3605
32 1050
33 195
34 21
35 1
36 39587
37 52608
38 39718
39 19992
40 6950
41 1656
42 259
43 24
44 1
45 171369
46 237129
47 191754
48 106644
49 42498
50 12177
51 2457

List of values

[1, 3, 1, 10, 6, 1, 36, 29, 9, 1, 137, 132, 57, 12, 1, 543, 590, 315, 94, 15, 1, 2219, 2628, 1629, 612, 140, 18, 1, 9285, 11732, 8127, 3605, 1050, 195, 21, 1, 39587, 52608, 39718, 19992, 6950, 1656, 259, 24, 1, 171369, 237129, 191754, 106644, 42498, 12177, 2457]