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!)
 A320218 Number of multisets of nonempty words with a total of n letters over octonary alphabet such that all letters occur at least once in the multiset. 3
 394353, 18536744, 498516252, 10092149744, 171141602198, 2569517304288, 35303763087512, 453509029790240, 5527943088161719, 64619198312435832, 730123641203028584, 8021699561768649792, 86097120229812852336, 906057856878889742408, 9376575130404097999848 (list; graph; refs; listen; history; text; internal format)
 OFFSET 8,1 LINKS Alois P. Heinz, Table of n, a(n) for n = 8..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))(8): seq(a(n), n=8..25); CROSSREFS Column k=8 of A257740. Cf. A320209. Sequence in context: A171439 A210162 A320209 * A230792 A131277 A250453 Adjacent sequences:  A320215 A320216 A320217 * A320219 A320220 A320221 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 11 16:45 EDT 2021. Contains 343804 sequences. (Running on oeis4.)