This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A309895 #11 Sep 05 2019 08:38:19 %S A309895 2,2,3,4,11,34,2136,7013320,29281354514767168, %T A309895 234431745534048922731115555415680, %U A309895 1994324729203114587259985605157804740271034553359179870979936357974016 %N A309895 Number of floor(n/2)-uniform hypergraphs on n unlabeled nodes. %C A309895 A hypergraph is called k-uniform if all hyperedges have the same cardinality k. %H A309895 Alois P. Heinz, <a href="/A309895/b309895.txt">Table of n, a(n) for n = 0..14</a> %H A309895 Wikipedia, <a href="https://en.wikipedia.org/wiki/Hypergraph">Hypergraph</a> %F A309895 a(n) = A309858(n,floor(n/2)) = A309865(n,floor(n/2)). %Y A309895 Cf. A309858, A309865. %K A309895 nonn %O A309895 0,1 %A A309895 _Alois P. Heinz_, Aug 21 2019