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.

A321844 Number of words w of length n such that each letter of the octonary 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 A321844 #3 Nov 19 2018 18:04:28
%S A321844 40320,181440,1058400,4823280,23296680,103757940,478790130,2149170345,
%T A321844 9894491985,45282147720,211500002835,991730832582,4733756233145,
%U A321844 22787184211575,111475945291060,551049677448403,2764601557859302,14023910986706605,72114359742608090
%N A321844 Number of words w of length n such that each letter of the octonary 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 A321844 Column k=8 of A257783.
%K A321844 nonn
%O A321844 8,1
%A A321844 _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.