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.

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

Table of values

n a(n)
0 1
1 11
2 115
3 1205
4 12625
5 132275
6 1385875
7 14520125
8 152130625
9 1593906875
10 16699721875
11 174966753125
12 1833166140625
13 19206495171875
14 201230782421875
15 2108340300078125
16 22089556912890625
17 231437270629296875
18 2424820490857421875
19 25405391261720703125

List of values

[1, 11, 115, 1205, 12625, 132275, 1385875, 14520125, 152130625, 1593906875, 16699721875, 174966753125, 1833166140625, 19206495171875, 201230782421875, 2108340300078125, 22089556912890625, 231437270629296875, 2424820490857421875, 25405391261720703125]

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

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