Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A092918
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A092918 Number of connected hypergraphs(without multiple edges and without empty edges)on n labeled vertices. +0
1
2, 4, 96, 31840, 2147156736, 9223372011084915712, 170141183460469231602560095199828453376, 57896044618658097711785492504343953923912733397452774312021795134847892828160 (list; graph; listen)
OFFSET

1,1

REFERENCES

G. Kilibarda and V. Jovovic, "Enumeration of some classes of T_0-hypergraphs", in preparation, 2004.

FORMULA

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

CROSSREFS

Sequence in context: A018410 A007534 A009379 this_sequence A018428 A128773 A101068

Adjacent sequences: A092915 A092916 A092917 this_sequence A092919 A092920 A092921

KEYWORD

nonn

AUTHOR

Goran Kilibarda, Vladeta Jovovic (vladeta(AT)Eunet.yu), Apr 16 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 July 23 17:35 EDT 2008. Contains 142285 sequences.


AT&T Labs Research