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.

A094449 Triangle read by rows: T(n,k) is the number of Dyck paths of semilength n and having sum of pyramid heights equal to k.

Table of values

n a(n)
0 1
1 0
2 1
3 0
4 0
5 2
6 1
7 0
8 0
9 4
10 4
11 2
12 0
13 0
14 8
15 13
16 8
17 5
18 0
19 0
20 16
21 42
22 26
23 20
24 12
25 0
26 0
27 32
28 139
29 85
30 65
31 48
32 28
33 0
34 0
35 64
36 470
37 286
38 214
39 156
40 112
41 64
42 0
43 0
44 128
45 1616
46 982
47 727
48 517
49 364
50 256
51 144
52 0
53 0
54 256
55 5632
56 3420
57 2518
58 1772
59 1214
60 832
61 576
62 320
63 0
64 0
65 512
66 19852

List of values

[1, 0, 1, 0, 0, 2, 1, 0, 0, 4, 4, 2, 0, 0, 8, 13, 8, 5, 0, 0, 16, 42, 26, 20, 12, 0, 0, 32, 139, 85, 65, 48, 28, 0, 0, 64, 470, 286, 214, 156, 112, 64, 0, 0, 128, 1616, 982, 727, 517, 364, 256, 144, 0, 0, 256, 5632, 3420, 2518, 1772, 1214, 832, 576, 320, 0, 0, 512, 19852]