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

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A309895 Number of floor(n/2)-uniform hypergraphs on n unlabeled nodes. 1
2, 2, 3, 4, 11, 34, 2136, 7013320, 29281354514767168, 234431745534048922731115555415680, 1994324729203114587259985605157804740271034553359179870979936357974016 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,1

COMMENTS

A hypergraph is called k-uniform if all hyperedges have the same cardinality k.

LINKS

Alois P. Heinz, Table of n, a(n) for n = 0..14

Wikipedia, Hypergraph

FORMULA

a(n) = A309858(n,floor(n/2)) = A309865(n,floor(n/2)).

CROSSREFS

Cf. A309858, A309865.

Sequence in context: A307891 A205118 A022405 * A270744 A093927 A067088

Adjacent sequences:  A309892 A309893 A309894 * A309896 A309897 A309898

KEYWORD

nonn

AUTHOR

Alois P. Heinz, Aug 21 2019

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 14 22:42 EST 2019. Contains 329987 sequences. (Running on oeis4.)