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.

A110333 Triangle read by rows: T(n,k) (n,k>=0) = number of peakless Motzkin paths of length n having k valleys (i.e., (1,-1) followed by (1,1)) at level zero (can be easily translated into RNA secondary structure terminology).

Table of values

n a(n)
0 1
1 1
2 1
3 2
4 4
5 8
6 16
7 1
8 33
9 4
10 70
11 12
12 152
13 32
14 1
15 336
16 82
17 5
18 754
19 206
20 18
21 1714
22 512
23 56
24 1
25 3940
26 1264
27 163
28 6
29 9145
30 3109
31 456
32 25
33 21406
34 7634
35 1243
36 88
37 1
38 50478
39 18737
40 3326
41 284
42 7
43 119814
44 46006
45 8781
46 868
47 33
48 286045
49 113062
50 22955
51 2556
52 129
53 1
54 686456

List of values

[1, 1, 1, 2, 4, 8, 16, 1, 33, 4, 70, 12, 152, 32, 1, 336, 82, 5, 754, 206, 18, 1714, 512, 56, 1, 3940, 1264, 163, 6, 9145, 3109, 456, 25, 21406, 7634, 1243, 88, 1, 50478, 18737, 3326, 284, 7, 119814, 46006, 8781, 868, 33, 286045, 113062, 22955, 2556, 129, 1, 686456]