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.

A143949 Triangle read by rows: T(n,k) is the number of n-Dyck paths containing k odd-length descents to ground level (0<=k<=n).

Table of values

n a(n)
0 1
1 0
2 1
3 1
4 0
5 1
6 1
7 3
8 0
9 1
10 4
11 4
12 5
13 0
14 1
15 10
16 17
17 7
18 7
19 0
20 1
21 32
22 46
23 34
24 10
25 9
26 0
27 1
28 100
29 155
30 94
31 55
32 13
33 11
34 0
35 1
36 329
37 502
38 335
39 154
40 80
41 16
42 13
43 0
44 1
45 1101
46 1701
47 1110
48 580
49 226
50 109
51 19
52 15
53 0
54 1
55 3761
56 5820
57 3865
58 1960
59 898
60 310
61 142
62 22
63 17
64 0
65 1
66 13035
67 20251

List of values

[1, 0, 1, 1, 0, 1, 1, 3, 0, 1, 4, 4, 5, 0, 1, 10, 17, 7, 7, 0, 1, 32, 46, 34, 10, 9, 0, 1, 100, 155, 94, 55, 13, 11, 0, 1, 329, 502, 335, 154, 80, 16, 13, 0, 1, 1101, 1701, 1110, 580, 226, 109, 19, 15, 0, 1, 3761, 5820, 3865, 1960, 898, 310, 142, 22, 17, 0, 1, 13035, 20251]