A060486 Tricoverings of an n-set.

1, 0, 0, 5, 205, 11301, 904580, 101173251, 15207243828, 2975725761202, 738628553556470, 227636079973503479, 85554823285296622543, 38621481302086460057613, 20669385794052533823555309, 12966707189875262685801947906, 9441485712482676603570079314728

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.

Links

Andrew Howroyd, Table of n, a(n) for n = 0..100

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

Row 3 of A188445.

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

Sequence in context: A232987 A012811 A186722 * A002438 A005333 A162087

Adjacent sequences: A060483 A060484 A060485 * A060487 A060488 A060489

Keyword

nonn

Author

Vladeta Jovovic, Mar 20 2001

Extensions

Terms a(11) and beyond from Andrew Howroyd, Dec 15 2018

Status

approved