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.

A191781 Triangle read by rows: T(n,k) is the number of length-n left factors of Dyck paths having length of the first ascent equal to k (1 <= k <= n).

Table of values

n a(n)
1 1
2 1
3 1
4 1
5 1
6 1
7 2
8 2
9 1
10 1
11 3
12 3
13 2
14 1
15 1
16 6
17 6
18 4
19 2
20 1
21 1
22 10
23 10
24 7
25 4
26 2
27 1
28 1
29 20
30 20
31 14
32 8
33 4
34 2
35 1
36 1
37 35
38 35
39 25
40 15
41 8
42 4
43 2
44 1
45 1
46 70
47 70
48 50
49 30
50 16
51 8
52 4
53 2
54 1
55 1
56 126
57 126
58 91
59 56
60 31
61 16
62 8
63 4
64 2
65 1
66 1
67 252
68 252
69 182
70 112
71 62
72 32
73 16
74 8
75 4
76 2
77 1
78 1
79 462
80 462
81 336
82 210
83 119
84 63
85 32
86 16
87 8
88 4
89 2
90 1
91 1

List of values

[1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 3, 3, 2, 1, 1, 6, 6, 4, 2, 1, 1, 10, 10, 7, 4, 2, 1, 1, 20, 20, 14, 8, 4, 2, 1, 1, 35, 35, 25, 15, 8, 4, 2, 1, 1, 70, 70, 50, 30, 16, 8, 4, 2, 1, 1, 126, 126, 91, 56, 31, 16, 8, 4, 2, 1, 1, 252, 252, 182, 112, 62, 32, 16, 8, 4, 2, 1, 1, 462, 462, 336, 210, 119, 63, 32, 16, 8, 4, 2, 1, 1]