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.

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

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 1
5 1
6 1
7 1
8 1
9 1
10 1
11 2
12 13
13 79
14 365
15 1366
16 4369
17 12377
18 31825
19 75583
20 167961
21 352718
22 705466
23 1352585
24 2501205
25 4495351
26 7956391
27 14221936
28 26802361
29 56058016
30 133316626
31 350785307
32 967683665
33 2677259721
34 7246005881
35 18977267621
36 47931495649

List of values

[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 13, 79, 365, 1366, 4369, 12377, 31825, 75583, 167961, 352718, 705466, 1352585, 2501205, 4495351, 7956391, 14221936, 26802361, 56058016, 133316626, 350785307, 967683665, 2677259721, 7246005881, 18977267621, 47931495649]