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.

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

Table of values

n a(n)
0 1
1 11
2 101
3 929
4 8545
5 78599
6 722973
7 6650087
8 61169169
9 562649373
10 5175390189
11 47604538285
12 437878494689
13 4027716327495
14 37047945974857
15 340776308298291
16 3134546038698889
17 28832341420057365
18 265207115001514409
19 2439441626426418609
20 22438596523731989473

List of values

[1, 11, 101, 929, 8545, 78599, 722973, 6650087, 61169169, 562649373, 5175390189, 47604538285, 437878494689, 4027716327495, 37047945974857, 340776308298291, 3134546038698889, 28832341420057365, 265207115001514409, 2439441626426418609, 22438596523731989473]