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.

A212384 Number of Dyck n-paths all of whose ascents have lengths equal to 1 (mod 4).

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 1
5 2
6 7
7 22
8 57
9 128
10 268
11 573
12 1343
13 3434
14 9038
15 23374
16 58649
17 144400
18 355992
19 892336
20 2280020
21 5892301
22 15253305
23 39347067
24 101177783
25 260255812
26 671941182
27 1743500452
28 4542147622
29 11858732144
30 30983904244
31 80982376879
32 211831943129
33 554905957520

List of values

[1, 1, 1, 1, 1, 2, 7, 22, 57, 128, 268, 573, 1343, 3434, 9038, 23374, 58649, 144400, 355992, 892336, 2280020, 5892301, 15253305, 39347067, 101177783, 260255812, 671941182, 1743500452, 4542147622, 11858732144, 30983904244, 80982376879, 211831943129, 554905957520]