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.

A092107 Triangle read by rows: T(n,k) is the number of Dyck paths of semilength n having exactly k UUU's (triple rises) where U=(1,1). Rows have 1,1,1,2,3,4,5,... entries, respectively.

Table of values

n a(n)
0 1
1 1
2 2
3 4
4 1
5 9
6 4
7 1
8 21
9 15
10 5
11 1
12 51
13 50
14 24
15 6
16 1
17 127
18 161
19 98
20 35
21 7
22 1
23 323
24 504
25 378
26 168
27 48
28 8
29 1
30 835
31 1554
32 1386
33 750
34 264
35 63
36 9
37 1
38 2188
39 4740
40 4920
41 3132
42 1335
43 390
44 80
45 10
46 1
47 5798
48 14355
49 17028
50 12507
51 6237
52 2200
53 550
54 99
55 11
56 1
57 15511
58 43252
59 57816

List of values

[1, 1, 2, 4, 1, 9, 4, 1, 21, 15, 5, 1, 51, 50, 24, 6, 1, 127, 161, 98, 35, 7, 1, 323, 504, 378, 168, 48, 8, 1, 835, 1554, 1386, 750, 264, 63, 9, 1, 2188, 4740, 4920, 3132, 1335, 390, 80, 10, 1, 5798, 14355, 17028, 12507, 6237, 2200, 550, 99, 11, 1, 15511, 43252, 57816]