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.

A110235 Triangle read by rows: T(n,k)(1<=k<=n) is the number of peakless Motzkin paths of length n having k (1,0) steps (can be easily translated into RNA secondary structure terminology).

Table of values

n a(n)
1 1
2 0
3 1
4 1
5 0
6 1
7 0
8 3
9 0
10 1
11 1
12 0
13 6
14 0
15 1
16 0
17 6
18 0
19 10
20 0
21 1
22 1
23 0
24 20
25 0
26 15
27 0
28 1
29 0
30 10
31 0
32 50
33 0
34 21
35 0
36 1
37 1
38 0
39 50
40 0
41 105
42 0
43 28
44 0
45 1
46 0
47 15
48 0
49 175
50 0
51 196
52 0
53 36
54 0
55 1
56 1
57 0
58 105
59 0
60 490
61 0
62 336
63 0
64 45
65 0
66 1
67 0
68 21
69 0
70 490
71 0
72 1176
73 0
74 540
75 0
76 55
77 0
78 1
79 1
80 0
81 196
82 0
83 1764
84 0
85 2520
86 0

List of values

[1, 0, 1, 1, 0, 1, 0, 3, 0, 1, 1, 0, 6, 0, 1, 0, 6, 0, 10, 0, 1, 1, 0, 20, 0, 15, 0, 1, 0, 10, 0, 50, 0, 21, 0, 1, 1, 0, 50, 0, 105, 0, 28, 0, 1, 0, 15, 0, 175, 0, 196, 0, 36, 0, 1, 1, 0, 105, 0, 490, 0, 336, 0, 45, 0, 1, 0, 21, 0, 490, 0, 1176, 0, 540, 0, 55, 0, 1, 1, 0, 196, 0, 1764, 0, 2520, 0]