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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A059951 10-block bicoverings of an n-set. 29
0, 0, 0, 0, 0, 0, 420, 154637, 20368816, 1775801814, 124151410020, 7596257673279, 426319554841752, 22564352299016528, 1146221298547133380, 56531610963314602401, 2728475248127447671008, 129586638359127411410442 (list; graph; refs; listen; history; internal format)
OFFSET

1,7

REFERENCES

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

FORMULA

a(n)=(1/10!)*(45^n-10*36^n-45*29^n+90*28^n+360*22^n-480*21^n+630*17^n-2520*16^n+2100*15^n-3780*12^n+10080*11^n-6552*10^n-3150*9^n+18900*8^n-31500*7^n+28560*6^n-46620*5^n+27720*4^n+85560*3^n-146160*2^n+83520). 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).

CROSSREFS

Cf. A002718, A059443, A003462, A059945-A059950.

Sequence in context: A135380 A035846 A046167 * A028683 A198163 A014890

Adjacent sequences:  A059948 A059949 A059950 * A059952 A059953 A059954

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 14 08:06 EST 2012. Contains 205604 sequences.