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.

A287822 Number T(n,k) of Dyck paths of semilength n such that the maximal number of peaks per level equals k; triangle T(n,k), n>=0, 0<=k<=n, read by rows.

Table of values

n a(n)
0 1
1 0
2 1
3 0
4 1
5 1
6 0
7 3
8 1
9 1
10 0
11 5
12 7
13 1
14 1
15 0
16 13
17 18
18 9
19 1
20 1
21 0
22 31
23 59
24 29
25 11
26 1
27 1
28 0
29 71
30 193
31 112
32 38
33 13
34 1
35 1
36 0
37 181
38 616
39 405
40 163
41 48
42 15
43 1
44 1
45 0
46 447
47 1955
48 1514
49 648
50 220
51 59
52 17
53 1
54 1
55 0
56 1111
57 6244
58 5565
59 2571
60 925
61 288
62 71
63 19
64 1
65 1

List of values

[1, 0, 1, 0, 1, 1, 0, 3, 1, 1, 0, 5, 7, 1, 1, 0, 13, 18, 9, 1, 1, 0, 31, 59, 29, 11, 1, 1, 0, 71, 193, 112, 38, 13, 1, 1, 0, 181, 616, 405, 163, 48, 15, 1, 1, 0, 447, 1955, 1514, 648, 220, 59, 17, 1, 1, 0, 1111, 6244, 5565, 2571, 925, 288, 71, 19, 1, 1]