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.

A212366 Number of Dyck n-paths all of whose ascents and descents 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 4
10 7
11 11
12 16
13 22
14 29
15 38
16 52
17 76
18 117
19 184
20 288
21 442
22 662
23 972
24 1414
25 2063
26 3047
27 4572
28 6952
29 10645
30 16303
31 24857
32 37672
33 56821
34 85541
35 128948
36 195103
37 296548
38 452501
39 692053
40 1058990
41 1619311
42 2473171
43 3773889
44 5757885
45 8791090

List of values

[1, 1, 1, 1, 1, 1, 1, 1, 2, 4, 7, 11, 16, 22, 29, 38, 52, 76, 117, 184, 288, 442, 662, 972, 1414, 2063, 3047, 4572, 6952, 10645, 16303, 24857, 37672, 56821, 85541, 128948, 195103, 296548, 452501, 692053, 1058990, 1619311, 2473171, 3773889, 5757885, 8791090]