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.

A114593 Triangle read by rows: T(n,k) is the number of hill-free Dyck paths of semilength n, having k ascents of length at least 2 (1 <= k <= floor(n/2), n >= 2).

Table of values

n a(n)
2 1
3 2
4 4
5 2
6 8
7 10
8 16
9 36
10 5
11 32
12 112
13 42
14 64
15 320
16 224
17 14
18 128
19 864
20 960
21 168
22 256
23 2240
24 3600
25 1200
26 42
27 512
28 5632
29 12320
30 6600
31 660
32 1024
33 13824
34 39424
35 30800
36 5940
37 132
38 2048
39 33280
40 119808
41 128128
42 40040
43 2574
44 4096
45 78848
46 349440
47 489216
48 224224
49 28028
50 429

List of values

[1, 2, 4, 2, 8, 10, 16, 36, 5, 32, 112, 42, 64, 320, 224, 14, 128, 864, 960, 168, 256, 2240, 3600, 1200, 42, 512, 5632, 12320, 6600, 660, 1024, 13824, 39424, 30800, 5940, 132, 2048, 33280, 119808, 128128, 40040, 2574, 4096, 78848, 349440, 489216, 224224, 28028, 429]