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.

A191305 Triangle read by rows: T(n,k) is the number of dispersed Dyck paths (i.e., Motzkin paths with no (1,0) steps at positive heights) of length n having k hills (i.e., peaks at height 1).

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 1
5 2
6 2
7 3
8 1
9 3
10 4
11 3
12 6
13 7
14 6
15 1
16 9
17 12
18 10
19 4
20 18
21 23
22 18
23 10
24 1
25 28
26 40
27 33
28 20
29 5
30 57
31 76
32 64
33 39
34 15
35 1
36 91
37 134
38 120
39 76
40 35
41 6
42 187
43 257
44 231
45 152
46 75
47 21
48 1
49 304
50 460
51 433
52 300
53 156
54 56
55 7
56 629
57 888
58 834
59 595
60 325
61 132
62 28
63 1
64 1037
65 1606
66 1572
67 1164
68 670
69 294
70 84
71 8
72 2157
73 3115
74 3035
75 2292
76 1375
77 642
78 217
79 36
80 1

List of values

[1, 1, 1, 1, 1, 2, 2, 3, 1, 3, 4, 3, 6, 7, 6, 1, 9, 12, 10, 4, 18, 23, 18, 10, 1, 28, 40, 33, 20, 5, 57, 76, 64, 39, 15, 1, 91, 134, 120, 76, 35, 6, 187, 257, 231, 152, 75, 21, 1, 304, 460, 433, 300, 156, 56, 7, 629, 888, 834, 595, 325, 132, 28, 1, 1037, 1606, 1572, 1164, 670, 294, 84, 8, 2157, 3115, 3035, 2292, 1375, 642, 217, 36, 1]