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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A059946 Number of 5-block bicoverings of an n-set. 2
0, 0, 0, 25, 472, 6185, 70700, 759045, 7894992, 80736625, 817897300, 8241325565, 82783813112, 830046591465, 8313655213500, 83215436364085, 832626645756832, 8329096006484705, 83307920631515300, 833180902353754605 (list; graph; refs; listen; history; internal format)
OFFSET

1,4

REFERENCES

I. P. Goulden and D. M. Jackson, Combinatorial Enumeration, John Wiley and Sons, N.Y., 1983.

FORMULA

a(n)=(1/5!)*(10^n-5*6^n-10*4^n+20*3^n+30*2^n-60). E.g.f. for m-block bicoverings of an n-set is exp(-x-1/2*x^2*(exp(y)-1))*Sum_{i=0..inf} x^i/i!*exp(binomial(i, 2)*y).

MATHEMATICA

With[{c=(1/5!)}, Table[c(10^n-5 6^n-10 4^n+20 3^n+30 2^n-60), {n, 20}]]  (* From Harvey P. Dale, Apr 21 2011 *)

CROSSREFS

Cf. A002718, A059443, A003462, A059945, A059947-A059951.

Sequence in context: A056069 A089386 A014927 * A118445 A000497 A028341

Adjacent sequences:  A059943 A059944 A059945 * A059947 A059948 A059949

KEYWORD

easy,nonn

AUTHOR

Vladeta Jovovic (vladeta(AT)eunet.rs), Feb 14 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 16 09:00 EST 2012. Contains 205904 sequences.