|
%I #9 Jun 29 2017 17:49:02
%S 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 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 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 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 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 Triangle begins:
%e 1,
%e 0,2,
%e 0,1,4,
%e 0,1,4,7,
%e 0,0,4,9,11,
%e 0,0,2,11,15,17,
%e 0,0,1,11,22,25,25,
%e 0,0,1,9,26,38,37,36,
%e 0,0,0,7,29,49,58,55,50,
%e 0,0,0,5,29,63,81,87,77,70,
%e ...
%Y A004250 is a diagonal. Cf. A000088, A004251.
%K nonn,tabl,more
%O 3,3
%A _N. J. A. Sloane_, Jul 09 2015
|
