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.

A366920 a(n) is the number times a Dyck path in an m X m box of any size has area n, counted to the lower right.

Table of values

n a(n)
0 1
1 1
2 0
3 1
4 1
5 0
6 1
7 2
8 1
9 1
10 1
11 3
12 3
13 3
14 2
15 2
16 5
17 6
18 7
19 7
20 5
21 6
22 8
23 12
24 15
25 18
26 16
27 16
28 15
29 17
30 24
31 32
32 40
33 43
34 45
35 45
36 42
37 44
38 53
39 69
40 87
41 104
42 115
43 126
44 125
45 124
46 124
47 136
48 160
49 198
50 240
51 282
52 321
53 345
54 360
55 365
56 367
57 382
58 417
59 482
60 574
61 682
62 791
63 895
64 976

List of values

[1, 1, 0, 1, 1, 0, 1, 2, 1, 1, 1, 3, 3, 3, 2, 2, 5, 6, 7, 7, 5, 6, 8, 12, 15, 18, 16, 16, 15, 17, 24, 32, 40, 43, 45, 45, 42, 44, 53, 69, 87, 104, 115, 126, 125, 124, 124, 136, 160, 198, 240, 282, 321, 345, 360, 365, 367, 382, 417, 482, 574, 682, 791, 895, 976]