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.

A193691 Triangle T(n,k), n>=0, 1<=k<=C(n), read by rows: T(n,k) = number of elements <= k-th path in the poset of Dyck paths of semilength n ordered by inclusion.

Table of values

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

List of values

[1, 1, 1, 2, 1, 2, 2, 4, 5, 1, 2, 2, 4, 5, 2, 4, 4, 8, 10, 5, 10, 13, 14, 1, 2, 2, 4, 5, 2, 4, 4, 8, 10, 5, 10, 13, 14, 2, 4, 4, 8, 10, 4, 8, 8, 16, 20, 10, 20, 26, 28, 5, 10, 10, 20, 25, 13, 26, 34, 37, 14, 28, 37, 41, 42, 1, 2, 2, 4, 5, 2, 4, 4, 8, 10, 5, 10, 13, 14, 2, 4, 4, 8, 10, 4]