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!)
 A320209 Number of sets of nonempty words with a total of n letters over octonary alphabet such that all letters occur at least once in the set. 3
 394353, 18235680, 484092688, 9697863856, 163046201132, 2430540970008, 33194557467204, 424251626739144, 5148887208055692, 59963231946871288, 675318621308265328, 7398542789316786184, 79210967706138213860, 831754864387299725168, 8590788276593760698232 (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 h:= proc(n, i, k) option remember; `if`(n=0, 1, `if`(i<1, 0,       add(h(n-i*j, i-1, k)*binomial(k^i, j), j=0..n/i)))     end: a:= n-> (k-> add((-1)^i*binomial(k, i)*h(n\$2, k-i), i=0..k))(8): seq(a(n), n=8..25); CROSSREFS Column k=8 of A319501. Cf. A320218. Sequence in context: A204628 A171439 A210162 * A320218 A230792 A131277 Adjacent sequences:  A320206 A320207 A320208 * A320210 A320211 A320212 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 8 02:26 EDT 2021. Contains 343652 sequences. (Running on oeis4.)