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.

A143950 Triangle read by rows: T(n,k) is the number of Dyck n-paths containing k even-length ascents (0 <= k <= floor(n/2)).

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 2
5 3
6 5
7 7
8 2
9 12
10 20
11 10
12 30
13 61
14 36
15 5
16 79
17 182
18 133
19 35
20 213
21 547
22 488
23 168
24 14
25 584
26 1668
27 1728
28 756
29 126
30 1628
31 5116
32 6020
33 3240
34 750
35 42
36 4600
37 15752
38 20812
39 13200
40 3960
41 462
42 13138
43 48709
44 71376
45 52030
46 19360
47 3267
48 132
49 37871
50 151164

List of values

[1, 1, 1, 1, 2, 3, 5, 7, 2, 12, 20, 10, 30, 61, 36, 5, 79, 182, 133, 35, 213, 547, 488, 168, 14, 584, 1668, 1728, 756, 126, 1628, 5116, 6020, 3240, 750, 42, 4600, 15752, 20812, 13200, 3960, 462, 13138, 48709, 71376, 52030, 19360, 3267, 132, 37871, 151164]