login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A060486 Tricoverings of an n-set. 3
1, 0, 0, 5, 205, 11301, 904580, 101173251, 15207243828, 2975725761202, 738628553556470 (list; graph; refs; listen; history; internal format)
OFFSET

0,4

COMMENTS

A covering of a set is a tricovering if every element of the set is covered by exactly three blocks of the covering.

FORMULA

E.g.f. for k-block tricoverings of an n-set is exp(-x+x^2/2+(exp(y)-1)*x^3/3)*Sum_{k=0..inf}x^k/k!*exp(-1/2*x^2*exp(k*y))*exp(binomial(k, 3)*y).

EXAMPLE

There are 1 4-block tricovering, 3 5-block tricoverings and 1 6-block tricovering of a 3-set,(cf. A060487), so a(3)=5.

CROSSREFS

Cf. A006095, A060483-A060485, (row sums of) A060487, A060090-A060095, A060069, A060070, A060051-A060053, A002718, A059443, A003462, A059945-A059951.

Sequence in context: A128678 A012811 A186722 * A002438 A005333 A162087

Adjacent sequences:  A060483 A060484 A060485 * A060487 A060488 A060489

KEYWORD

more,nonn

AUTHOR

Vladeta Jovovic (vladeta(AT)eunet.rs), Mar 20 2001

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 18:57 EST 2012. Contains 206074 sequences.