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.

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

Table of values

n a(n)
0 1
1 11
2 103
3 967
4 9079
5 85243
6 800351
7 7514541
8 70554457
9 662439857
10 6219685951
11 58396989455
12 548292695881
13 5147951686649
14 48334414751849
15 453814602701801
16 4260891430727991
17 40005754941255473
18 375616336261903907
19 3526683405274793053
20 33112233522155404139

List of values

[1, 11, 103, 967, 9079, 85243, 800351, 7514541, 70554457, 662439857, 6219685951, 58396989455, 548292695881, 5147951686649, 48334414751849, 453814602701801, 4260891430727991, 40005754941255473, 375616336261903907, 3526683405274793053, 33112233522155404139]