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.

This page as a plain text file.
%I A321845 #3 Nov 19 2018 18:04:47
%S A321845 362880,1814400,11642400,57879360,302856840,1452611160,7181851950,
%T A321845 34386725520,168206363745,815113118385,4018968988380,19841370665865,
%U A321845 99477246363495,502000638243720,2569888903846460,13275926076237132,69519580918458790,367795800026341605
%N 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.
%Y A321845 Column k=9 of A257783.
%K A321845 nonn
%O A321845 9,1
%A A321845 _Alois P. Heinz_, Nov 19 2018

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.