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.

A212383 Number of Dyck n-paths all of whose ascents have lengths equal to 1 (mod 3).

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 2
5 6
6 16
7 37
8 83
9 199
10 512
11 1343
12 3488
13 9011
14 23488
15 62094
16 165738
17 444160
18 1193146
19 3216436
20 8709766
21 23683846
22 64611879
23 176730460
24 484593740
25 1332018207
26 3669981318
27 10133197561
28 28032766982
29 77688769031
30 215665451243
31 599644845226

List of values

[1, 1, 1, 1, 2, 6, 16, 37, 83, 199, 512, 1343, 3488, 9011, 23488, 62094, 165738, 444160, 1193146, 3216436, 8709766, 23683846, 64611879, 176730460, 484593740, 1332018207, 3669981318, 10133197561, 28032766982, 77688769031, 215665451243, 599644845226]