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.

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

Table of values

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

List of values

[0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 4, 3, 4, 6, 4, 5, 4, 2, 2, 6, 2, 0, 0, 0, 13, 9, 16, 24, 9, 17, 13, 16, 21, 21, 20, 21, 24, 13, 20, 17, 19, 23, 16, 19, 16, 13, 14, 20, 13, 10, 11, 24, 23, 21, 14, 12, 21, 10, 4, 3, 24, 11, 3, 0, 0, 0, 41, 27, 53, 80, 24, 54, 40, 59, 80, 66, 75, 86, 99, 27]