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.
%I A321846 #3 Nov 19 2018 18:05:07 %S A321846 3628800,19958400,139708800,752431680,4239995760,21789167400, %T A321846 114909631200,584574333840,3027714547410,15487149249315, %U A321846 80380034496675,416678817402540,2188661321134365,11547842522164410,61697603618819175,332093455309359975,1809348373235738090 %N 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. %Y A321846 Column k=10 of A257783. %K A321846 nonn %O A321846 10,1 %A A321846 _Alois P. Heinz_, Nov 19 2018