login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A320211 Number of sets of nonempty words with a total of n letters over denary alphabet such that all letters occur at least once in the set. 3
58941091, 4097382940, 159454061270, 4587784661870, 108909499300650, 2259736176893470, 42433681634931005, 737876928284127870, 12073172284265618005, 188049325030487680920, 2812707955072045999940, 40672129029056125818340, 571583937930987524954470 (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

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))(10):

seq(a(n), n=10..25);

CROSSREFS

Column k=10 of A319501.

Cf. A320220.

Sequence in context: A034612 A015355 A321496 * A320220 A034644 A269925

Adjacent sequences:  A320208 A320209 A320210 * A320212 A320213 A320214

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified February 21 20:46 EST 2020. Contains 332111 sequences. (Running on oeis4.)