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.

A191791 Triangle read by rows: T(n,k) is the number of length n left factors of Dyck paths having k UDUD's, where U=(1,1) and D=(1,-1).

Table of values

n a(n)
0 1
1 1
2 2
3 3
4 5
5 1
6 8
7 2
8 15
9 4
10 1
11 25
12 8
13 2
14 46
15 19
16 4
17 1
18 79
19 36
20 9
21 2
22 147
23 76
24 24
25 4
26 1
27 256
28 146
29 48
30 10
31 2
32 477
33 304
34 109
35 29
36 4
37 1
38 841
39 578
40 224
41 60
42 11
43 2
44 1570
45 1180
46 499
47 144
48 34
49 4
50 1
51 2791
52 2244
53 1002
54 312
55 72
56 12
57 2
58 5217
59 4525
60 2172
61 731
62 181
63 39
64 4
65 1
66 9336
67 8588
68 4347
69 1530
70 410
71 84
72 13
73 2

List of values

[1, 1, 2, 3, 5, 1, 8, 2, 15, 4, 1, 25, 8, 2, 46, 19, 4, 1, 79, 36, 9, 2, 147, 76, 24, 4, 1, 256, 146, 48, 10, 2, 477, 304, 109, 29, 4, 1, 841, 578, 224, 60, 11, 2, 1570, 1180, 499, 144, 34, 4, 1, 2791, 2244, 1002, 312, 72, 12, 2, 5217, 4525, 2172, 731, 181, 39, 4, 1, 9336, 8588, 4347, 1530, 410, 84, 13, 2]