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.

A263191 Triangle read by rows: T(n>=0, 1<=k<=A000108(n)) is the number of Dyck paths of length 2n having k smaller elements in Tamari order.

Table of values

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

List of values

[1, 1, 1, 1, 1, 2, 1, 0, 1, 1, 3, 2, 2, 2, 0, 2, 0, 1, 0, 0, 0, 0, 1, 1, 4, 3, 5, 4, 2, 4, 0, 5, 2, 0, 2, 0, 3, 0, 1, 0, 0, 2, 0, 0, 0, 2, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 5, 4, 9, 6, 7, 6, 3, 10, 6, 4, 4, 0, 9, 5, 2, 0, 4, 4, 4, 0, 0, 4, 3, 1, 0, 2, 4, 0, 4, 0, 0, 0, 3, 0, 0, 2]