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.

A162984 Number of Dyck paths with no UUU's and no DDD's of semilength n and having k UUDUDD's (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 25
10 11
11 1
12 53
13 26
14 3
15 114
16 62
17 9
18 249
19 148
20 25
21 1
22 550
23 355
24 69
25 4
26 1227
27 853
28 189
29 14
30 2760
31 2057
32 509
33 46
34 1
35 6253
36 4973
37 1359
38 145
39 5
40 14256
41 12050
42 3600
43 446
44 20
45 32682
46 29256
47 9484
48 1334
49 75
50 1
51 75293
52 71154
53 24870
54 3914
55 265
56 6

List of values

[1, 1, 2, 3, 1, 6, 2, 12, 5, 25, 11, 1, 53, 26, 3, 114, 62, 9, 249, 148, 25, 1, 550, 355, 69, 4, 1227, 853, 189, 14, 2760, 2057, 509, 46, 1, 6253, 4973, 1359, 145, 5, 14256, 12050, 3600, 446, 20, 32682, 29256, 9484, 1334, 75, 1, 75293, 71154, 24870, 3914, 265, 6]