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.

A212389 Number of Dyck n-paths all of whose ascents 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 12
12 67
13 287
14 1002
15 3004
16 8009
17 19449
18 43759
19 92380
20 184787
21 353137
22 650497
23 1170632
24 2110021
25 3977161
26 8271836
27 19536661
28 51111062
29 140210129
30 385123916
31 1032218316
32 2670065961
33 6645249777
34 15922990909
35 36823807747
36 82485177457

List of values

[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 12, 67, 287, 1002, 3004, 8009, 19449, 43759, 92380, 184787, 353137, 650497, 1170632, 2110021, 3977161, 8271836, 19536661, 51111062, 140210129, 385123916, 1032218316, 2670065961, 6645249777, 15922990909, 36823807747, 82485177457]