%I #5 Dec 18 2016 23:20:41
%S 1,0,1,0,1,1,0,1,3,1,0,1,9,6,1,0,1,27,36,10,1,0,1,81,216,100,15,1,0,1,
%T 243,1296,1000,225,21,1,0,1,729,7776,10000,3375,441,28,1,0,1,2187,
%U 46656,100000,50625,9261,784,36,1,0,1,6561,279936,1000000,759375
%N Table of multigraphs (by antidiagonals) with n (>=1) nodes and k (>=0) edges. Each type of object labeled from its own label set.
%D F. Bergeron, G. Labelle and P. Leroux, Combinatorial Species and Tree-Like Structures, Cambridge, 1998, p. 114 (2.4.44).
%F a(n, k) = binomial(n, 2)^k.
%e 1 0 0 0 0 ...
%e 1 1 1 1 1 ...
%e 1 3 9 27 81 ...
%e 1 6 36 216 1296 ...
%e 1 10 100 1000 10000 ...
%Y Columns 0-8: A000012, A000217(n-1), A000537(n-1), A059827(n-1), A059977(n-1), A059860(n-1), A059978(n-1), A059979(n-1), A059980(n-1).
%Y Rows 1-10: A000007, A000012, A000244, A000400, A011557, A001024, A009965, A009972, A009980, A009989.
%Y Cf. A091478.
%K nonn,tabl
%O 1,9
%A _Christian G. Bower_, Jan 13 2004