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.

A212367 Number of Dyck n-paths all of whose ascents and descents have lengths equal to 1 (mod 8).

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 2
10 4
11 7
12 11
13 16
14 22
15 29
16 37
17 47
18 62
19 87
20 129
21 197
22 302
23 457
24 677
25 980
26 1392
27 1957
28 2752
29 3907
30 5630
31 8237
32 12187
33 18123
34 26927
35 39810
36 58472
37 85381
38 124234
39 180677
40 263375
41 385538
42 567036
43 837306
44 1239408
45 1835867
46 2717386
47 4016173

List of values

[1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 4, 7, 11, 16, 22, 29, 37, 47, 62, 87, 129, 197, 302, 457, 677, 980, 1392, 1957, 2752, 3907, 5630, 8237, 12187, 18123, 26927, 39810, 58472, 85381, 124234, 180677, 263375, 385538, 567036, 837306, 1239408, 1835867, 2717386, 4016173]