login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A309895 Number of floor(n/2)-uniform hypergraphs on n unlabeled nodes. 1

%I

%S 2,2,3,4,11,34,2136,7013320,29281354514767168,

%T 234431745534048922731115555415680,

%U 1994324729203114587259985605157804740271034553359179870979936357974016

%N Number of floor(n/2)-uniform hypergraphs on n unlabeled nodes.

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

%H Alois P. Heinz, <a href="/A309895/b309895.txt">Table of n, a(n) for n = 0..14</a>

%H Wikipedia, <a href="https://en.wikipedia.org/wiki/Hypergraph">Hypergraph</a>

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

%Y Cf. A309858, A309865.

%K nonn

%O 0,1

%A _Alois P. Heinz_, Aug 21 2019

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 January 20 08:18 EST 2020. Contains 331081 sequences. (Running on oeis4.)