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.

A098747 Triangle read by rows: T(n,k) is the number of Dyck paths of semilength n having exactly k UDU's at low level.

Table of values

n a(n)
1 1
2 1
3 1
4 3
5 1
6 1
7 8
8 4
9 1
10 1
11 24
12 11
13 5
14 1
15 1
16 75
17 35
18 14
19 6
20 1
21 1
22 243
23 113
24 47
25 17
26 7
27 1
28 1
29 808
30 376
31 156
32 60
33 20
34 8
35 1
36 1
37 2742
38 1276
39 532
40 204
41 74
42 23
43 9
44 1
45 1
46 9458
47 4402
48 1840
49 712
50 257
51 89
52 26
53 10
54 1
55 1
56 33062
57 15390
58 6448
59 2507
60 917
61 315
62 105
63 29
64 11
65 1
66 1
67 116868

List of values

[1, 1, 1, 3, 1, 1, 8, 4, 1, 1, 24, 11, 5, 1, 1, 75, 35, 14, 6, 1, 1, 243, 113, 47, 17, 7, 1, 1, 808, 376, 156, 60, 20, 8, 1, 1, 2742, 1276, 532, 204, 74, 23, 9, 1, 1, 9458, 4402, 1840, 712, 257, 89, 26, 10, 1, 1, 33062, 15390, 6448, 2507, 917, 315, 105, 29, 11, 1, 1, 116868]