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.

A166284 Number of Dyck paths with no UUU's and no DDD's of semilength n and having k UUDD's (0<=k<=floor(n/2); U=(1,1), D=(1,-1)).

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 2
5 2
6 4
7 3
8 1
9 7
10 7
11 3
12 13
13 17
14 6
15 1
16 26
17 36
18 16
19 4
20 52
21 77
22 45
23 10
24 1
25 104
26 173
27 111
28 30
29 5
30 212
31 387
32 268
33 95
34 15
35 1
36 438
37 857
38 666
39 266
40 50
41 6
42 910
43 1911
44 1641
45 714
46 175
47 21
48 1
49 1903
50 4287
51 3975
52 1940
53 546
54 77
55 7
56 4009
57 9619
58 9606
59 5205
60 1610
61 294
62 28
63 1

List of values

[1, 1, 1, 1, 2, 2, 4, 3, 1, 7, 7, 3, 13, 17, 6, 1, 26, 36, 16, 4, 52, 77, 45, 10, 1, 104, 173, 111, 30, 5, 212, 387, 268, 95, 15, 1, 438, 857, 666, 266, 50, 6, 910, 1911, 1641, 714, 175, 21, 1, 1903, 4287, 3975, 1940, 546, 77, 7, 4009, 9619, 9606, 5205, 1610, 294, 28, 1]