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.

A213297 Number of n-length words w over 9-ary alphabet such that for every prefix z of w we have #(z,a_i) = 0 or #(z,a_i) >= #(z,a_j) for all j>i and #(z,a_i) counts the occurrences of the i-th letter in z.

Table of values

n a(n)
0 1
1 9
2 81
3 621
4 4293
5 26061
6 140517
7 676155
8 2990967
9 12602451
10 52359693
11 216954441
12 901911273
13 3778512489
14 16012113225
15 68739345546
16 299377174968
17 1323228682218
18 5939020708851
19 27063683050245
20 125241936884631
21 588324477445971
22 2805460966739493

List of values

[1, 9, 81, 621, 4293, 26061, 140517, 676155, 2990967, 12602451, 52359693, 216954441, 901911273, 3778512489, 16012113225, 68739345546, 299377174968, 1323228682218, 5939020708851, 27063683050245, 125241936884631, 588324477445971, 2805460966739493]