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!)
A057964 Triangle T(n,k) of number of minimal 3-covers of a labeled n-set that cover k points of that set uniquely (k=3,..,n). 4
1, 16, 6, 160, 120, 25, 1280, 1440, 600, 90, 8960, 13440, 8400, 2520, 301, 57344, 107520, 89600, 40320, 9632, 966, 344064, 774144, 806400, 483840, 173376, 34776, 3025, 1966080, 5160960, 6451200, 4838400, 2311680, 695520, 121000, 9330 (list; table; graph; refs; listen; history; text; internal format)
OFFSET

3,2

COMMENTS

Row sums give A003468.

LINKS

Table of n, a(n) for n=3..38.

Eric Weisstein's World of Mathematics, Minimal cover

FORMULA

Number of minimal m-covers of a labeled n-set that cover k points of that set uniquely is C(n, k)*S(k, m)*(2^m-m-1)^(n-k), where S(k, m) are Stirling numbers of the second kind.

EXAMPLE

[1], [16, 6], [160, 120, 25], [1280, 1440, 600, 90], ...; There are 305=160+120+25 minimal 3-covers of a labeled 5-set.

CROSSREFS

Cf. A035347, A057669 (unlabeled case), A057963, A057965-A057968.

Sequence in context: A141078 A298830 A302215 * A302463 A303245 A216160

Adjacent sequences:  A057961 A057962 A057963 * A057965 A057966 A057967

KEYWORD

easy,nonn,tabl

AUTHOR

Vladeta Jovovic, Oct 17 2000

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 October 17 13:20 EDT 2021. Contains 348049 sequences. (Running on oeis4.)