Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A060483
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A060483 Number of 5-block tricoverings of an n-set. +0
10
3, 57, 717, 7845, 81333, 825237, 8300757, 83202645, 832809813, 8331237717, 83324947797, 833299785045, 8333199127893, 83332796486997, 833331185898837, 8333324743497045, 83333298973791573, 833333195894773077 (list; graph; listen)
OFFSET

3,1

COMMENT

A covering of a set is a tricovering if every element of the set is covered by exactly three blocks of the covering.

FORMULA

a(n)=(1/5!)*(10^n-15*4^n+45*2^n-40); generally, 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).

CROSSREFS

Cf. A006095, A060484-A060487, A060090-A060095, A060069, A060070, A060051-A060053, A002718, A059443, A003462, A059945-A059951.

Sequence in context: A078728 A032696 A131466 this_sequence A139746 A053725 A053774

Adjacent sequences: A060480 A060481 A060482 this_sequence A060484 A060485 A060486

KEYWORD

nonn

AUTHOR

Vladeta Jovovic (vladeta(AT)Eunet.yu), Mar 20 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 August 29 17:54 EDT 2008. Contains 143238 sequences.


AT&T Labs Research