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.

A114463 Triangle read by rows: T(n,k) is the number of Dyck paths of semilength n having k ascents of length 2 starting at an odd level (0<=k<=floor(n/2)-1 for n>=2; k=0 for n=0,1).

Table of values

n a(n)
0 1
1 1
2 2
3 5
4 13
5 1
6 36
7 6
8 105
9 26
10 1
11 317
12 104
13 8
14 982
15 402
16 45
17 1
18 3105
19 1522
20 225
21 10
22 9981
23 5693
24 1052
25 69
26 1
27 32520
28 21144
29 4698
30 412
31 12
32 107157
33 78188
34 20319
35 2249
36 98
37 1
38 356481
39 288340
40 85864
41 11522
42 679
43 14
44 1195662
45 1061520
46 356535
47 56360
48 4230

List of values

[1, 1, 2, 5, 13, 1, 36, 6, 105, 26, 1, 317, 104, 8, 982, 402, 45, 1, 3105, 1522, 225, 10, 9981, 5693, 1052, 69, 1, 32520, 21144, 4698, 412, 12, 107157, 78188, 20319, 2249, 98, 1, 356481, 288340, 85864, 11522, 679, 14, 1195662, 1061520, 356535, 56360, 4230]