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 A094000 #22 Dec 17 2022 12:49:03
%S A094000 1,1,3,29,1015,126651,53354350,74698954306,350688201987402,
%T A094000 5624061753186933530,314512139441575825493524,
%U A094000 62498777166571927258267336860,44831219113504221199415663547412096
%N A094000 Number of n X n (0,1)-matrices with no zero rows or columns and with all rows distinct and all columns distinct, up to permutation of rows.
%C A094000 Main diagonal of A059202.
%D A094000 G. Kilibarda and V. Jovovic, "Enumeration of some classes of T_0-hypergraphs", in
%H A094000 G. C. Greubel, <a href="/A094000/b094000.txt">Table of n, a(n) for n = 0..59</a>
%H A094000 Goran Kilibarda and Vladeta Jovovic, <a href="https://arxiv.org/abs/1411.4187">Enumeration of some classes of T_0-hypergraphs</a>, arXiv:1411.4187 [math.CO], 2014.
%F A094000 a(n) = Sum_{k=0..n+1} Stirling1(n+1, k)*binomial(2^(k-1)-1, n).
%F A094000 a(n) ~ binomial(2^n,n). - _Vaclav Kotesovec_, Mar 18 2014
%t A094000 f[n_] := Sum[ StirlingS1[n + 1, k] Binomial[2^(k - 1) - 1, n], {k, 0, n + 1}]; Table[ f[n], {n, 0, 12}] (* _Robert G. Wilson v_, Jun 01 2004 *)
%o A094000 (PARI) a(n) = sum(k=0, n+1, stirling(n+1, k, 1)*binomial(2^(k-1)-1, n)); \\ _Michel Marcus_, Dec 17 2022
%Y A094000 Cf. A048291, A059202, A088309.
%Y A094000 Binary matrices with distinct rows and columns, various versions: A059202, A088309, A088310, A088616, A089673, A089674, A093466, A094000, A094223, A116532, A116539, A181230, A259763
%K A094000 nonn,easy
%O A094000 0,3
%A A094000 Goran Kilibarda and _Vladeta Jovovic_, May 30 2004
%E A094000 More terms from _Robert G. Wilson v_, Jun 01 2004