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.

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

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 2
11 4
12 7
13 11
14 16
15 22
16 29
17 37
18 46
19 57
20 73
21 99
22 142
23 211
24 317
25 473
26 694
27 997
28 1402
29 1937
30 2648
31 3614
32 4967
33 6917
34 9782
35 14023
36 20284
37 29438
38 42647
39 61457
40 87963
41 125093
42 177074
43 250157
44 353692
45 501658
46 714768
47 1023296
48 1470843

List of values

[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 4, 7, 11, 16, 22, 29, 37, 46, 57, 73, 99, 142, 211, 317, 473, 694, 997, 1402, 1937, 2648, 3614, 4967, 6917, 9782, 14023, 20284, 29438, 42647, 61457, 87963, 125093, 177074, 250157, 353692, 501658, 714768, 1023296, 1470843]