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 A259873 #9 Jun 29 2017 17:49:02 %S A259873 1,0,2,0,1,4,0,1,4,7,0,0,4,9,11,0,0,2,11,15,17,0,0,1,11,22,25,25,0,0, %T A259873 1,9,26,38,37,36,0,0,0,7,29,49,58,55,50,0,0,0,5,29,63,81,87,77,70 %N A259873 Triangle read by rows: T(n,k) (n >= 3, 3 <= k <= n) = number of possible graphical partitions for simple graphs with n non-isolated nodes and k edges. %D A259873 P. R. Stein, On the number of graphical partitions, pp. 671-684 of Proc. 9th S-E Conf. Combinatorics, Graph Theory, Computing, Congr. Numer. 21 (1978). Contains table for n <= 27. %H A259873 P. R. Stein, <a href="/A004250/a004250.pdf">On the number of graphical partitions</a>, pp. 671-684 of Proc. 9th S-E Conf. Combinatorics, Graph Theory, Computing, Congr. Numer. 21 (1978). [Annotated scanned copy] %e A259873 Triangle begins: %e A259873 1, %e A259873 0,2, %e A259873 0,1,4, %e A259873 0,1,4,7, %e A259873 0,0,4,9,11, %e A259873 0,0,2,11,15,17, %e A259873 0,0,1,11,22,25,25, %e A259873 0,0,1,9,26,38,37,36, %e A259873 0,0,0,7,29,49,58,55,50, %e A259873 0,0,0,5,29,63,81,87,77,70, %e A259873 ... %Y A259873 A004250 is a diagonal. Cf. A000088, A004251. %K A259873 nonn,tabl,more %O A259873 3,3 %A A259873 _N. J. A. Sloane_, Jul 09 2015