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.

A287834 Number of words of length n over the alphabet {0,1,...,10} such that no two consecutive terms have distance 3.

Table of values

n a(n)
0 1
1 11
2 105
3 1005
4 9621
5 92105
6 881753
7 8441329
8 80811789
9 773639469
10 7406320733
11 70903294113
12 678781988705
13 6498216958121
14 62209699634757
15 595555173609653
16 5701457600593525
17 54582044135967257
18 522532964509030377
19 5002390498942001761
20 47889630709552579709

List of values

[1, 11, 105, 1005, 9621, 92105, 881753, 8441329, 80811789, 773639469, 7406320733, 70903294113, 678781988705, 6498216958121, 62209699634757, 595555173609653, 5701457600593525, 54582044135967257, 522532964509030377, 5002390498942001761, 47889630709552579709]