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.

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

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 1
5 1
6 1
7 1
8 2
9 10
10 46
11 166
12 496
13 1288
14 3004
15 6437
16 12895
17 24583
18 45799
19 87211
20 180235
21 420547
22 1087220
23 2941931
24 7927664
25 20705636
26 51886966
27 124660576
28 288445186
29 648173927
30 1431655546
31 3156274456
32 7062245781
33 16256654077
34 38704049941
35 94853117381

List of values

[1, 1, 1, 1, 1, 1, 1, 1, 2, 10, 46, 166, 496, 1288, 3004, 6437, 12895, 24583, 45799, 87211, 180235, 420547, 1087220, 2941931, 7927664, 20705636, 51886966, 124660576, 288445186, 648173927, 1431655546, 3156274456, 7062245781, 16256654077, 38704049941, 94853117381]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.