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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A226884 Number of n-length words w over a 5-ary alphabet {a1,a2,...,a5} such that #(w,a1) >= #(w,a2) >= ... >= #(w,a5) >= 1, where #(w,x) counts the letters x in word w 3

%I #8 Sep 26 2017 15:02:31

%S 120,360,2100,10080,58464,322560,1467840,7155720,36657192,179255076,

%T 933034830,4330631760,21529265392,105723750312,519686374512,

%U 2614195952160,12518753971164,61521911547096,302916858354682,1486023890700624,7449741849512920,35973707803032480

%N Number of n-length words w over a 5-ary alphabet {a1,a2,...,a5} such that #(w,a1) >= #(w,a2) >= ... >= #(w,a5) >= 1, where #(w,x) counts the letters x in word w

%H Alois P. Heinz, <a href="/A226884/b226884.txt">Table of n, a(n) for n = 5..1000</a>

%Y Column k=5 of A226874.

%K nonn

%O 5,1

%A _Alois P. Heinz_, Jun 21 2013

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 25 03:01 EDT 2024. Contains 375420 sequences. (Running on oeis4.)