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.

A114583 Triangle read by rows: T(n,k) is the number of Motzkin paths of length n and having k UHD's, where U=(1,1),H=(1,0),D=(1,-1) (0<=k<=floor(n/3)).

Table of values

n a(n)
0 1
1 1
2 2
3 3
4 1
5 7
6 2
7 15
8 6
9 36
10 14
11 1
12 85
13 39
14 3
15 209
16 102
17 12
18 517
19 280
20 37
21 1
22 1303
23 758
24 123
25 4
26 3312
27 2085
28 381
29 20
30 8510
31 5730
32 1194
33 76
34 1
35 22029
36 15849
37 3657
38 295
39 5
40 57447
41 43914
42 11187
43 1056
44 30
45 150709
46 122090
47 33903
48 3734
49 135
50 1
51 397569
52 340104

List of values

[1, 1, 2, 3, 1, 7, 2, 15, 6, 36, 14, 1, 85, 39, 3, 209, 102, 12, 517, 280, 37, 1, 1303, 758, 123, 4, 3312, 2085, 381, 20, 8510, 5730, 1194, 76, 1, 22029, 15849, 3657, 295, 5, 57447, 43914, 11187, 1056, 30, 150709, 122090, 33903, 3734, 135, 1, 397569, 340104]