The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A226883 Number of n-length words w over a 4-ary alphabet {a1,a2,...,a4} such that #(w,a1) >= #(w,a2) >= ... >= #(w,a4) >= 1, where #(w,x) counts the letters x in word w. 3
 24, 60, 300, 1260, 6496, 20916, 95640, 353760, 1600104, 5626764, 23844002, 88442445, 387629456, 1389902524, 5788974504, 21752247660, 93252286444, 340374221376, 1409907258122, 5335751835865, 22620834658096, 83728749708760, 345377277971570, 1315699675342065 (list; graph; refs; listen; history; text; internal format)
 OFFSET 4,1 LINKS Alois P. Heinz, Table of n, a(n) for n = 4..1000 MATHEMATICA Table[Sum[n!/Product[IntegerPartitions[n, {4}][[k, j]]!, {j, 1, 4}], {k, 1, Length[ IntegerPartitions[n, {4}]]}], {n, 4, 20}] (* Vaclav Kotesovec, Jul 01 2013 *) CROSSREFS Column k=4 of A226874. Sequence in context: A185445 A321840 A052759 * A304547 A045558 A022761 Adjacent sequences:  A226880 A226881 A226882 * A226884 A226885 A226886 KEYWORD nonn AUTHOR Alois P. Heinz, Jun 21 2013 STATUS approved

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

Last modified November 28 06:42 EST 2021. Contains 349401 sequences. (Running on oeis4.)