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!)
 A226880 Number of n-length words w over a 10-ary alphabet {a1,a2,...,a10} such that #(w,a1) >= #(w,a2) >= ... >= #(w,a10) >= 0, where #(w,x) counts the letters x in word w. 3
 1, 1, 3, 10, 47, 246, 1602, 11481, 95503, 871030, 8879558, 58412751, 473076122, 3607903547, 29782240841, 241773783075, 2137404383423, 18482746670342, 173563010955990, 1554987178737075, 15169020662626702, 126731980207937625, 1160565179374262951 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 COMMENTS Differs from A005651 first at n=11: a(11) = 58412751 != A005651(11) = 98329551. LINKS Alois P. Heinz, Table of n, a(n) for n = 0..1000 MAPLE b:= proc(n, i, t) option remember;       `if`(t=1, 1/n!, add(b(n-j, j, t-1)/j!, j=i..n/t))     end: a:= n-> n!*b(n, 0, 10): seq(a(n), n=0..30); CROSSREFS Column k=10 of A226873. Sequence in context: A226877 A226878 A226879 * A005651 A249479 A236410 Adjacent sequences:  A226877 A226878 A226879 * A226881 A226882 A226883 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 June 7 04:32 EDT 2020. Contains 334836 sequences. (Running on oeis4.)