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.

A166291 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 peaks at odd level (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 3
16 6
17 3
18 4
19 0
20 1
21 5
22 10
23 12
24 4
25 5
26 0
27 1
28 8
29 20
30 22
31 20
32 5
33 6
34 0
35 1
36 13
37 36
38 52
39 40
40 30
41 6
42 7
43 0
44 1
45 21
46 66
47 104
48 109
49 65
50 42
51 7
52 8
53 0
54 1
55 34
56 118
57 214
58 240
59 200
60 98
61 56
62 8
63 9
64 0
65 1
66 55
67 210
68 421
69 549
70 481
71 335
72 140
73 72
74 9
75 10
76 0
77 1
78 89
79 370

List of values

[1, 0, 1, 1, 0, 1, 1, 2, 0, 1, 2, 2, 3, 0, 1, 3, 6, 3, 4, 0, 1, 5, 10, 12, 4, 5, 0, 1, 8, 20, 22, 20, 5, 6, 0, 1, 13, 36, 52, 40, 30, 6, 7, 0, 1, 21, 66, 104, 109, 65, 42, 7, 8, 0, 1, 34, 118, 214, 240, 200, 98, 56, 8, 9, 0, 1, 55, 210, 421, 549, 481, 335, 140, 72, 9, 10, 0, 1, 89, 370]