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.

A091156 Triangle read by rows: T(n,k) is the number of Dyck paths of semilength n, having k long ascents (i.e., ascents of length at least 2). Rows are of length 1,1,2,2,3,3,... .

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 1
5 4
6 1
7 11
8 2
9 1
10 26
11 15
12 1
13 57
14 69
15 5
16 1
17 120
18 252
19 56
20 1
21 247
22 804
23 364
24 14
25 1
26 502
27 2349
28 1800
29 210
30 1
31 1013
32 6455
33 7515
34 1770
35 42
36 1
37 2036
38 16962
39 27940
40 11055
41 792
42 1
43 4083
44 43086
45 95458
46 57035
47 8217
48 132
49 1
50 8178
51 106587
52 305812
53 257257

List of values

[1, 1, 1, 1, 1, 4, 1, 11, 2, 1, 26, 15, 1, 57, 69, 5, 1, 120, 252, 56, 1, 247, 804, 364, 14, 1, 502, 2349, 1800, 210, 1, 1013, 6455, 7515, 1770, 42, 1, 2036, 16962, 27940, 11055, 792, 1, 4083, 43086, 95458, 57035, 8217, 132, 1, 8178, 106587, 305812, 257257]