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 A059048 #10 Jan 29 2023 19:42:48
%S A059048 1,1,1,2,1,0,0,1,2,1,0,0,0,2,13,26,22,8,1,0,0,0,0,25,354,1798,4822,
%T A059048 8028,9044,7240,4224,1808,560,120,16,1,0,0,0,0,30,2086,45512,461236,
%U A059048 2797785,11669660,36369970,89356260,179461250,302225100,43458923,0
%N A059048 Triangle A(n,m) of numbers of n-element ordered T_0-antichains on an unlabeled m-set or numbers of T_1-hypergraphs on n labeled nodes with m (not necessarily empty) distinct hyperedges (m=0,1,...,2^n).
%C A059048 An antichain on a set is a T_0-antichain if for every two distinct points of the set there exists a member of the antichain containing one but not the other point. T_1-hypergraph is a hypergraph which for every ordered pair (u,v) of distinct nodes has a hyperedge containing u but not v.
%D A059048 V. Jovovic and G. Kilibarda, On the number of Boolean functions in the Post classes F^{mu}_8, Diskretnaya Matematika, 11 (1999), no. 4, 127-138 (translated in Discrete Mathematics and Applications, 9, (1999), no. 6)
%D A059048 V. Jovovic, G. Kilibarda, On enumeration of the class of all monotone Boolean functions, in preparation.
%H A059048 V. Jovovic, <a href="/A059048/a059048.pdf">3-element unlabeled ordered T_0-antichains"</a>
%H A059048 V. Jovovic, <a href="/A059048/a059048a.pdf">Number A(m,n) of m-element ordered T_0-antichains on an unlabeled n-set</a>
%e A059048 [1, 1], [1, 2, 1], [0, 0, 1, 2, 1], [0, 0, 0, 2, 13, 26, 22, 8, 1], .... There are 72 3-element unlabeled ordered T_0-antichains: 2 on 3-set, 13 on 4-set, 26 on 5-set, 22 on 6-set, 8 on 7-set and 1 on 8-set.
%Y A059048 Cf. A059049-A059052.
%K A059048 nonn
%O A059048 0,4
%A A059048 _Vladeta Jovovic_, Goran Kilibarda, Dec 19 2000