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.

A242633 Number of n-length words w over a 10-ary alphabet {a_1,...,a_10} such that w contains never more than j consecutive letters a_j (for 1<=j<=10).

Table of values

n a(n)
0 1
1 10
2 99
3 980
4 9700
5 96011
6 950319
7 9406280
8 93103581
9 921541438
10 9121438862
11 90284216730
12 893635304019
13 8845223290551
14 87550228496839
15 866574224082841
16 8577372083864876
17 84899030943287514
18 840332608243515705
19 8317631952113371291
20 82328117000511661919

List of values

[1, 10, 99, 980, 9700, 96011, 950319, 9406280, 93103581, 921541438, 9121438862, 90284216730, 893635304019, 8845223290551, 87550228496839, 866574224082841, 8577372083864876, 84899030943287514, 840332608243515705, 8317631952113371291, 82328117000511661919]