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.

A321845 Number of words w of length n such that each letter of the nonary alphabet is used at least once and 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)
9 362880
10 1814400
11 11642400
12 57879360
13 302856840
14 1452611160
15 7181851950
16 34386725520
17 168206363745
18 815113118385
19 4018968988380
20 19841370665865
21 99477246363495
22 502000638243720
23 2569888903846460
24 13275926076237132
25 69519580918458790
26 367795800026341605

List of values

[362880, 1814400, 11642400, 57879360, 302856840, 1452611160, 7181851950, 34386725520, 168206363745, 815113118385, 4018968988380, 19841370665865, 99477246363495, 502000638243720, 2569888903846460, 13275926076237132, 69519580918458790, 367795800026341605]