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.

A166295 Triangle read by rows: T(n,k) is the number of Dyck paths with no UUU's and no DDD's, of semilength n and having k UUDUDD's starting at level 0 (0 <= k <= floor(n/3); U=(1,1), D=(1,-1)).

Table of values

n a(n)
0 1
1 1
2 2
3 3
4 1
5 6
6 2
7 12
8 5
9 26
10 10
11 1
12 57
13 22
14 3
15 128
16 48
17 9
18 291
19 109
20 22
21 1
22 670
23 250
24 54
25 4
26 1558
27 582
28 129
29 14
30 3655
31 1366
32 311
33 40
34 1
35 8639
36 3232
37 750
38 109
39 5
40 20554
41 7696
42 1818
43 284
44 20
45 49185
46 18432
47 4419
48 730
49 65
50 1
51 118301
52 44368
53 10776
54 1856
55 195
56 6

List of values

[1, 1, 2, 3, 1, 6, 2, 12, 5, 26, 10, 1, 57, 22, 3, 128, 48, 9, 291, 109, 22, 1, 670, 250, 54, 4, 1558, 582, 129, 14, 3655, 1366, 311, 40, 1, 8639, 3232, 750, 109, 5, 20554, 7696, 1818, 284, 20, 49185, 18432, 4419, 730, 65, 1, 118301, 44368, 10776, 1856, 195, 6]