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.

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

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 1
5 1
6 2
7 8
8 29
9 85
10 211
11 464
12 943
13 1873
14 3914
15 9101
16 23298
17 61915
18 162283
19 409888
20 996456
21 2360486
22 5555333
23 13244114
24 32357022
25 80958851
26 205389082
27 522000262
28 1317987172
29 3297123652
30 8190326857
31 20302864970
32 50482613327
33 126318440989

List of values

[1, 1, 1, 1, 1, 1, 2, 8, 29, 85, 211, 464, 943, 1873, 3914, 9101, 23298, 61915, 162283, 409888, 996456, 2360486, 5555333, 13244114, 32357022, 80958851, 205389082, 522000262, 1317987172, 3297123652, 8190326857, 20302864970, 50482613327, 126318440989]