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.

A212388 Number of Dyck n-paths all of whose ascents 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 11
11 56
12 221
13 716
14 2003
15 5006
16 11441
17 24312
18 48648
19 92721
20 170811
21 311886
22 589590
23 1220979
24 2864973
25 7450852
26 20309628
27 55305706
28 146505451
29 373452808
30 913836082
31 2150455648
32 4887179761
33 10794337952
34 23375638064
35 50219351232

List of values

[1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 11, 56, 221, 716, 2003, 5006, 11441, 24312, 48648, 92721, 170811, 311886, 589590, 1220979, 2864973, 7450852, 20309628, 55305706, 146505451, 373452808, 913836082, 2150455648, 4887179761, 10794337952, 23375638064, 50219351232]