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.

A118972 Triangle read by rows: T(n,k) is the number of hill-free Dyck paths of semilength n and having length of first descent equal to k (1<=k<=n; n>=1). A hill in a Dyck path is a peak at level 1.

Table of values

n a(n)
1 0
2 0
3 1
4 1
5 0
6 1
7 3
8 2
9 0
10 1
11 10
12 5
13 2
14 0
15 1
16 33
17 16
18 5
19 2
20 0
21 1
22 111
23 51
24 16
25 5
26 2
27 0
28 1
29 379
30 168
31 51
32 16
33 5
34 2
35 0
36 1
37 1312
38 565
39 168
40 51
41 16
42 5
43 2
44 0
45 1
46 4596
47 1934
48 565
49 168
50 51
51 16
52 5
53 2
54 0
55 1
56 16266
57 6716
58 1934
59 565
60 168
61 51
62 16
63 5
64 2
65 0
66 1
67 58082
68 23604
69 6716
70 1934
71 565
72 168

List of values

[0, 0, 1, 1, 0, 1, 3, 2, 0, 1, 10, 5, 2, 0, 1, 33, 16, 5, 2, 0, 1, 111, 51, 16, 5, 2, 0, 1, 379, 168, 51, 16, 5, 2, 0, 1, 1312, 565, 168, 51, 16, 5, 2, 0, 1, 4596, 1934, 565, 168, 51, 16, 5, 2, 0, 1, 16266, 6716, 1934, 565, 168, 51, 16, 5, 2, 0, 1, 58082, 23604, 6716, 1934, 565, 168]