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!)
 A320219 Number of multisets of nonempty words with a total of n letters over nonary alphabet such that all letters occur at least once in the multiset. 3
 4596553, 267009498, 8759066967, 214009517289, 4341556649997, 77402791217151, 1254856577798877, 18917548771779954, 269340155175667401, 3662449762145471938, 47963634774469915293, 608844238997012412552, 7528868495379885600462, 91056717786483891773442 (list; graph; refs; listen; history; text; internal format)
 OFFSET 9,1 LINKS Alois P. Heinz, Table of n, a(n) for n = 9..1000 MAPLE b:= proc(n, k) option remember; `if`(n=0, 1, add(add(       d*k^d, d=numtheory[divisors](j))*b(n-j, k), j=1..n)/n)     end: a:= n-> (k-> add(b(n, k-i)*(-1)^i*binomial(k, i), i=0..k))(9): seq(a(n), n=9..25); CROSSREFS Column k=9 of A257740. Cf. A320210. Sequence in context: A129931 A206195 A320210 * A265448 A272701 A083605 Adjacent sequences:  A320216 A320217 A320218 * A320220 A320221 A320222 KEYWORD nonn AUTHOR Alois P. Heinz, Oct 07 2018 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 May 30 19:03 EDT 2020. Contains 334728 sequences. (Running on oeis4.)