Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A134954
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A134954 Number of "hyperforests" on n labeled nodes, i.e. hypergraphs that have no cycles, assuming that each edge contains at least two vertices. +0
4
1, 1, 2, 8, 55, 562, 7739, 134808, 2846764, 70720278, 2021462055, 65365925308, 2359387012261, 94042995460130, 4102781803365418, 194459091322828280, 9950303194613104995, 546698973373090998382, 32101070021048906407183 (list; graph; listen)
OFFSET

0,3

LINKS

N. J. A. Sloane, Transforms

FORMULA

Exponential transform of A030019. - njas, Jan 30 2008

CROSSREFS

Cf. A030019 (hypertrees), A134955 (unlabeled case), A134956.

Sequence in context: A005155 A005440 A139016 this_sequence A087422 A081667 A117496

Adjacent sequences: A134951 A134952 A134953 this_sequence A134955 A134956 A134957

KEYWORD

nonn

AUTHOR

D. E. Knuth, Jan 26 2008

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 24 12:00 EDT 2008. Contains 142294 sequences.


AT&T Labs Research