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.

A213287 Number of 8-length words w over n-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 0
1 1
2 91
3 869
4 4895
5 21562
6 83728
7 296268
8 977026
9 2990967
10 8418649
11 21740455
12 51758345
13 114517208
14 237528214
15 465636886
16 868918932
17 1553027197
18 2672453415
19 4447208761
20 7183467523
21 11298758534
22 17352329324
23 26081348272
24 38443650358
25 55667772435
26 79311064261

List of values

[0, 1, 91, 869, 4895, 21562, 83728, 296268, 977026, 2990967, 8418649, 21740455, 51758345, 114517208, 237528214, 465636886, 868918932, 1553027197, 2672453415, 4447208761, 7183467523, 11298758534, 17352329324, 26081348272, 38443650358, 55667772435, 79311064261]