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.

A212369 Number of Dyck n-paths all of whose ascents and descents 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 4
13 7
14 11
15 16
16 22
17 29
18 37
19 46
20 56
21 68
22 85
23 112
24 156
25 226
26 333
27 490
28 712
29 1016
30 1421
31 1949
32 2630
33 3512
34 4676
35 6256
36 8464
37 11620
38 16187
39 22811
40 32366
41 46005
42 65225
43 91967
44 128786
45 179140
46 247861
47 341885
48 471332
49 651041
50 902679

List of values

[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 4, 7, 11, 16, 22, 29, 37, 46, 56, 68, 85, 112, 156, 226, 333, 490, 712, 1016, 1421, 1949, 2630, 3512, 4676, 6256, 8464, 11620, 16187, 22811, 32366, 46005, 65225, 91967, 128786, 179140, 247861, 341885, 471332, 651041, 902679]