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.

A098093 Triangle read by rows: T(n,k) is the number of peakless Motzkin paths of length n and having k ladders.

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 1
5 1
6 3
7 1
8 7
9 1
10 13
11 3
12 1
13 22
14 14
15 1
16 34
17 46
18 1
19 1
20 50
21 118
22 16
23 1
24 70
25 264
26 88
27 1
28 95
29 530
30 343
31 9
32 1
33 125
34 986
35 1066
36 105
37 1
38 161
39 1722
40 2857
41 630
42 2
43 1
44 203
45 2863
46 6841
47 2751
48 76
49 1
50 252
51 4564
52 15028
53 9746
54 781
55 1
56 308
57 7028
58 30778
59 29778
60 4909
61 30

List of values

[1, 1, 1, 1, 1, 1, 3, 1, 7, 1, 13, 3, 1, 22, 14, 1, 34, 46, 1, 1, 50, 118, 16, 1, 70, 264, 88, 1, 95, 530, 343, 9, 1, 125, 986, 1066, 105, 1, 161, 1722, 2857, 630, 2, 1, 203, 2863, 6841, 2751, 76, 1, 252, 4564, 15028, 9746, 781, 1, 308, 7028, 30778, 29778, 4909, 30]