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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A320220 Number of multisets of nonempty words with a total of n letters over denary alphabet such that all letters occur at least once in the multiset. 3
 58941091, 4143348470, 162731313045, 4718107140980, 112729591991185, 2351902614090062, 44373396691290660, 774761803780874980, 12721776529833584465, 198768703664184994530, 2981185419002290273673, 43212794112241851734090, 608596903477972496493095 (list; graph; refs; listen; history; text; internal format)
 OFFSET 10,1 LINKS Alois P. Heinz, Table of n, a(n) for n = 10..975 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))(10): seq(a(n), n=10..25); CROSSREFS Column k=10 of A257740. Cf. A320211. Sequence in context: A015355 A321496 A320211 * A034644 A269925 A288281 Adjacent sequences: A320217 A320218 A320219 * A320221 A320222 A320223 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified July 17 21:15 EDT 2024. Contains 374377 sequences. (Running on oeis4.)