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 A056885 #8 May 13 2022 00:05:01 %S A056885 1,0,1,0,0,2,0,0,1,3,0,0,1,3,5,0,0,1,5,8,7,0,0,1,8,19,17,11,0,0,1,12, %T A056885 45,56,35,15,0,0,1,17,107,194,151,65,22,0,0,1,24,244,713,728,365,118, %U A056885 30,0,0,1,32,547,2697,3996,2413,835,203,42,0,0,1,42,1173,10356,24446 %N A056885 Triangle T(n,k) = number of minimal covers of an unlabeled n-set that cover k points of that set uniquely, k=0..n. %C A056885 Row sums give A048194. %H A056885 Sean A. Irvine, <a href="https://github.com/archmageirvine/joeis/blob/master/src/irvine/oeis/a056/A056885.java">Java program</a> (github) %H A056885 V. Jovovic, <a href="/A056885/a056885.pdf">Formula for T(n,k).</a> %e A056885 [1], [0,1], [0,0,2], [0,0,1,3], [0,0,1,3,5], [0,0,1,5,8,7], ...; There are 21=1+5+8+7 minimal covers of an unlabeled 5-set. %Y A056885 Cf. A035347 for labeled case. %K A056885 nonn,tabl,nice %O A056885 0,6 %A A056885 _Vladeta Jovovic_, Sep 04 2000