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.

A304777 Number of partitions p of n such that the sequence of level steps (when interpreted as ascents) and descents of p forms a Dyck path.

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 1
5 2
6 1
7 2
8 2
9 2
10 2
11 4
12 3
13 4
14 3
15 6
16 5
17 7
18 5
19 9
20 10
21 12
22 10
23 15
24 13
25 18
26 19
27 27
28 20
29 30
30 30
31 40
32 40
33 52
34 48
35 61
36 61
37 77
38 79
39 100
40 99
41 124
42 129
43 150
44 150
45 200
46 199
47 240
48 249
49 294
50 303
51 363
52 369
53 441
54 484
55 550
56 569
57 686
58 716
59 817
60 885
61 1003
62 1065

List of values

[1, 1, 1, 1, 1, 2, 1, 2, 2, 2, 2, 4, 3, 4, 3, 6, 5, 7, 5, 9, 10, 12, 10, 15, 13, 18, 19, 27, 20, 30, 30, 40, 40, 52, 48, 61, 61, 77, 79, 100, 99, 124, 129, 150, 150, 200, 199, 240, 249, 294, 303, 363, 369, 441, 484, 550, 569, 686, 716, 817, 885, 1003, 1065]