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.

A213289 Number of 10-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 323
3 5168
4 37993
5 201975
6 916966
7 3771418
8 14486158
9 52359693
10 178880725
11 575581556
12 1731294863
13 4845394723
14 12619979568
15 30703918750
16 70168864396
17 151545355033
18 311129635863
19 610492421368
20 1150383157925
21 2090531036111
22 3677200683178
23 6280769764578

List of values

[0, 1, 323, 5168, 37993, 201975, 916966, 3771418, 14486158, 52359693, 178880725, 575581556, 1731294863, 4845394723, 12619979568, 30703918750, 70168864396, 151545355033, 311129635863, 610492421368, 1150383157925, 2090531036111, 3677200683178, 6280769764578]