Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A059946
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A059946 Number of 5-block bicoverings of an n-set. +0
3
0, 0, 0, 25, 472, 6185, 70700, 759045, 7894992, 80736625, 817897300, 8241325565, 82783813112, 830046591465, 8313655213500, 83215436364085, 832626645756832, 8329096006484705, 83307920631515300, 833180902353754605 (list; graph; listen)
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).

CROSSREFS

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

Sequence in context: A056069 A089386 A014927 this_sequence A118445 A000497 A028341

Adjacent sequences: A059943 A059944 A059945 this_sequence A059947 A059948 A059949

KEYWORD

easy,nonn

AUTHOR

Vladeta Jovovic (vladeta(AT)eunet.rs), Feb 14 2001

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research