Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A059201
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A059201 Number of T_0-covers of a labeled n-set. +0
4
1, 1, 4, 96, 31692, 2147001636, 9223371991763269704, 170141183460469231473432887375376674952, 57896044618658097711785492504343953920509909728243389682424010192567186540224 (list; graph; listen)
OFFSET

0,3

COMMENT

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: A111637 A027872 A098695 this_sequence A027638 A041275 A024384

Adjacent sequences: A059198 A059199 A059200 this_sequence A059202 A059203 A059204

KEYWORD

easy,nonn

AUTHOR

Vladeta Jovovic, Goran Kilibarda (vladeta(AT)Eunet.yu), Jan 16 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 July 4 18:25 EDT 2008. Contains 140886 sequences.


AT&T Labs Research