The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A213871 Number of words w where each letter of the 9-ary alphabet occurs n times 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. 1

%I

%S 1,362880,34459425,1035588754375,256653852463806955,

%T 224909472938181653263446,468682891926540940991787213006,

%U 1850042480471503379038420801262526759,11963401430840044468894095677711389363239184,114752550881830601773639529476205016572641397025904

%N Number of words w where each letter of the 9-ary alphabet occurs n times 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.

%e a(0) = 1: the empty word.

%e a(1) = 362880: all permutations of 9 letters.

%Y Column k=9 of A213275.

%K nonn

%O 0,2

%A _Alois P. Heinz_, Jun 23 2012

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified June 27 19:07 EDT 2022. Contains 354897 sequences. (Running on oeis4.)