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!)
A226885 Number of n-length words w over a 6-ary alphabet {a1,a2,...,a6} such that #(w,a1) >= #(w,a2) >= ... >= #(w,a6) >= 1, where #(w,x) counts the letters x in word w. 2

%I #8 Sep 26 2017 14:57:40

%S 720,2520,16800,90720,584640,3548160,25098480,125456760,778065288,

%T 4353689340,26986202880,151871712720,970831418976,5215235977368,

%U 31594145929440,180858169411920,1087286184860568,6173944667695728,38303414229539712,212004108343328400

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

%H Alois P. Heinz, <a href="/A226885/b226885.txt">Table of n, a(n) for n = 6..1000</a>

%Y Column k=6 of A226874.

%K nonn

%O 6,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 April 24 20:08 EDT 2024. Contains 371963 sequences. (Running on oeis4.)