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.

A162986 Number of Dyck paths with no UUU's and no DDD's of semilength n and having k UD's starting at level 0 (i.e., hills); (0 <= k <= n; U=(1,1), D=(1,-1)).

Table of values

n a(n)
0 1
1 0
2 1
3 1
4 0
5 1
6 1
7 2
8 0
9 1
10 2
11 2
12 3
13 0
14 1
15 4
16 5
17 3
18 4
19 0
20 1
21 8
22 10
23 9
24 4
25 5
26 0
27 1
28 17
29 21
30 18
31 14
32 5
33 6
34 0
35 1
36 37
37 46
38 40
39 28
40 20
41 6
42 7
43 0
44 1
45 82
46 102
47 90
48 66
49 40
50 27
51 7
52 8
53 0
54 1
55 185
56 230
57 204
58 152
59 100
60 54
61 35
62 8
63 9
64 0
65 1
66 423
67 526
68 469
69 353
70 235
71 143
72 70
73 44
74 9
75 10
76 0
77 1
78 978
79 1216

List of values

[1, 0, 1, 1, 0, 1, 1, 2, 0, 1, 2, 2, 3, 0, 1, 4, 5, 3, 4, 0, 1, 8, 10, 9, 4, 5, 0, 1, 17, 21, 18, 14, 5, 6, 0, 1, 37, 46, 40, 28, 20, 6, 7, 0, 1, 82, 102, 90, 66, 40, 27, 7, 8, 0, 1, 185, 230, 204, 152, 100, 54, 35, 8, 9, 0, 1, 423, 526, 469, 353, 235, 143, 70, 44, 9, 10, 0, 1, 978, 1216]