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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A059201 Number of T_0-covers of a labeled n-set. 4
1, 1, 4, 96, 31692, 2147001636, 9223371991763269704, 170141183460469231473432887375376674952, 57896044618658097711785492504343953920509909728243389682424010192567186540224 (list; graph; refs; listen; history; internal format)
OFFSET

0,3

COMMENTS

A cover of a set is a T_0-cover if for every two distinct points of the set there exists a member (block) of the cover containing one but not the other point.

LINKS

Vladeta Jovovic, T_0-covers of a labeled 3-set

FORMULA

a(n)=Sum_{i=0..n+1} stirling1(n+1, i)*2^(2^(i-1)-1).

CROSSREFS

Cf. A003465, row sums of A059202, A059203, A059084-A059089.

Sequence in context: A146514 A181335 A098695 * A027638 A041275 A024384

Adjacent sequences:  A059198 A059199 A059200 * A059202 A059203 A059204

KEYWORD

easy,nonn

AUTHOR

Vladeta Jovovic, Goran Kilibarda (vladeta(AT)eunet.rs), Jan 16 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 07:14 EST 2012. Contains 205586 sequences.