Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A088888
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A088888 Number of intersecting T_0-hypergraphs on a labeled n-set. +0
1
2, 4, 26, 1190, 1302204, 912799349556, 291201248247281713961832 (list; graph; listen)
OFFSET

1,1

COMMENT

Intersecting hypergraph is intersecting T_0-hypergraph if for every two distinct nodes there exists a hyperedge containing one but not the other node.

CROSSREFS

Cf. A051185, A059083.

Sequence in context: A019034 A091759 A032076 this_sequence A102996 A095182 A104465

Adjacent sequences: A088885 A088886 A088887 this_sequence A088889 A088890 A088891

KEYWORD

hard,nonn

AUTHOR

Goran Kilibarda, Vladeta Jovovic (vladeta(AT)Eunet.yu), Nov 28 2003

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 25 07:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research