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.

A287847 Number A(n,k) of Dyck paths of semilength n such that no level has more than k peaks; square array A(n,k), n >= 0, k >= 0, read by descending antidiagonals.

Table of values

n a(n)
0 1
1 1
2 0
3 1
4 1
5 0
6 1
7 1
8 1
9 0
10 1
11 1
12 2
13 3
14 0
15 1
16 1
17 2
18 4
19 5
20 0
21 1
22 1
23 2
24 5
25 12
26 13
27 0
28 1
29 1
30 2
31 5
32 13
33 31
34 31
35 0
36 1
37 1
38 2
39 5
40 14
41 40
42 90
43 71
44 0
45 1
46 1
47 2
48 5
49 14
50 41
51 119
52 264
53 181
54 0
55 1
56 1
57 2
58 5
59 14
60 42
61 130
62 376
63 797
64 447
65 0
66 1
67 1
68 2
69 5
70 14
71 42
72 131
73 414
74 1202
75 2402
76 1111
77 0

List of values

[1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 2, 3, 0, 1, 1, 2, 4, 5, 0, 1, 1, 2, 5, 12, 13, 0, 1, 1, 2, 5, 13, 31, 31, 0, 1, 1, 2, 5, 14, 40, 90, 71, 0, 1, 1, 2, 5, 14, 41, 119, 264, 181, 0, 1, 1, 2, 5, 14, 42, 130, 376, 797, 447, 0, 1, 1, 2, 5, 14, 42, 131, 414, 1202, 2402, 1111, 0]