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.

A100754 Triangle read by rows: T(n, k) = number of hill-free Dyck paths (i.e., no peaks at height 1) of semilength n and having k peaks.

Table of values

n a(n)
2 1
3 1
4 1
5 1
6 4
7 1
8 1
9 8
10 8
11 1
12 1
13 13
14 29
15 13
16 1
17 1
18 19
19 73
20 73
21 19
22 1
23 1
24 26
25 151
26 266
27 151
28 26
29 1
30 1
31 34
32 276
33 749
34 749
35 276
36 34
37 1
38 1
39 43
40 463
41 1781
42 2762
43 1781
44 463
45 43
46 1
47 1
48 53
49 729
50 3758
51 8321
52 8321
53 3758
54 729
55 53
56 1
57 1
58 64
59 1093
60 7253
61 21659
62 31004
63 21659
64 7253
65 1093
66 64
67 1

List of values

[1, 1, 1, 1, 4, 1, 1, 8, 8, 1, 1, 13, 29, 13, 1, 1, 19, 73, 73, 19, 1, 1, 26, 151, 266, 151, 26, 1, 1, 34, 276, 749, 749, 276, 34, 1, 1, 43, 463, 1781, 2762, 1781, 463, 43, 1, 1, 53, 729, 3758, 8321, 8321, 3758, 729, 53, 1, 1, 64, 1093, 7253, 21659, 31004, 21659, 7253, 1093, 64, 1]