Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A094573
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A094573 Triangle T(n,k) giving number of (<=2)-covers of an n-set with k blocks. +0
2
1, 1, 1, 3, 1, 1, 12, 20, 7, 1, 39, 169, 186, 59, 3, 1, 120, 1160, 2755, 2243, 661, 55, 1, 363, 7381, 33270, 52060, 33604, 9167, 910, 15, 1, 1092, 45500, 367087, 988750, 1126874, 601262, 151726, 16401, 525, 1, 3279, 276529, 3873786, 17005149 (list; graph; listen)
OFFSET

0,4

COMMENT

Cover of a set is (<=2)-cover if every element of the set is covered with at most two blocks of the cover.

FORMULA

E.g.f.: exp(-x-x^2/2*(exp(y)-1))*Sum(exp(y*binomial(n+1, 2))*x^n/n!, n=0..infinity).

EXAMPLE

1; 1; 1,3,1; 1,12,20,7; 1,39,169,186,59,3; 1,120,1160,2755,2243,661,55; ...

CROSSREFS

Cf. A094574, A059443, A060052.

Sequence in context: A128592 A156584 A129619 this_sequence A055154 A015112 A156869

Adjacent sequences: A094570 A094571 A094572 this_sequence A094574 A094575 A094576

KEYWORD

nonn

AUTHOR

Goran Kilibarda, Vladeta Jovovic (vladeta(AT)eunet.rs), May 12 2004

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 December 20 13:54 EST 2009. Contains 171081 sequences.


AT&T Labs Research