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.

A097100 Triangle read by rows: T(n,k) is the number of peakless Motzkin paths of length n containing k subwords of the type U H^j U or D H^j D for some j>0, where U=(1,1), H=(1,0) and D=(1,-1) (can be easily expressed using RNA secondary structure terminology).

Table of values

n a(n)
0 1
1 1
2 1
3 2
4 4
5 8
6 15
7 2
8 28
9 8
10 1
11 53
12 24
13 5
14 102
15 62
16 21
17 199
18 152
19 68
20 4
21 391
22 366
23 196
24 24
25 1
26 773
27 868
28 531
29 104
30 7
31 1537
32 2032
33 1393
34 368
35 43
36 3075
37 4694
38 3593
39 1172
40 195
41 6
42 6189
43 10732
44 9120
45 3528
46 754
47 48
48 1
49 12525
50 24348
51 22822
52 10224
53 2632
54 272
55 9

List of values

[1, 1, 1, 2, 4, 8, 15, 2, 28, 8, 1, 53, 24, 5, 102, 62, 21, 199, 152, 68, 4, 391, 366, 196, 24, 1, 773, 868, 531, 104, 7, 1537, 2032, 1393, 368, 43, 3075, 4694, 3593, 1172, 195, 6, 6189, 10732, 9120, 3528, 754, 48, 1, 12525, 24348, 22822, 10224, 2632, 272, 9]