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.

A114276 Triangle read by rows: T(n,k) is the number of Dyck paths of semilength n having length of second ascent equal to k (0<=k<=n-1).

Table of values

n a(n)
1 1
2 1
3 1
4 1
5 3
6 1
7 1
8 8
9 4
10 1
11 1
12 22
13 13
14 5
15 1
16 1
17 64
18 41
19 19
20 6
21 1
22 1
23 196
24 131
25 67
26 26
27 7
28 1
29 1
30 625
31 428
32 232
33 101
34 34
35 8
36 1
37 1
38 2055
39 1429
40 804
41 376
42 144
43 43
44 9
45 1
46 1
47 6917
48 4861
49 2806
50 1377
51 573
52 197
53 53
54 10
55 1
56 1
57 23713
58 16795
59 9878
60 5017
61 2211
62 834
63 261
64 64
65 11
66 1
67 1

List of values

[1, 1, 1, 1, 3, 1, 1, 8, 4, 1, 1, 22, 13, 5, 1, 1, 64, 41, 19, 6, 1, 1, 196, 131, 67, 26, 7, 1, 1, 625, 428, 232, 101, 34, 8, 1, 1, 2055, 1429, 804, 376, 144, 43, 9, 1, 1, 6917, 4861, 2806, 1377, 573, 197, 53, 10, 1, 1, 23713, 16795, 9878, 5017, 2211, 834, 261, 64, 11, 1, 1]