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.

A321846 Number of words w of length n such that each letter of the denary 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)
10 3628800
11 19958400
12 139708800
13 752431680
14 4239995760
15 21789167400
16 114909631200
17 584574333840
18 3027714547410
19 15487149249315
20 80380034496675
21 416678817402540
22 2188661321134365
23 11547842522164410
24 61697603618819175
25 332093455309359975
26 1809348373235738090

List of values

[3628800, 19958400, 139708800, 752431680, 4239995760, 21789167400, 114909631200, 584574333840, 3027714547410, 15487149249315, 80380034496675, 416678817402540, 2188661321134365, 11547842522164410, 61697603618819175, 332093455309359975, 1809348373235738090]