|
%I #16 Dec 05 2018 16:01:44
%S 1,0,1,0,3,4,0,19,84,38,0,195,2470,3140,728,0,3031,108390,307390,
%T 186360,26704,0,67263,7192444,42747460,52630060,18926544,1866256,0,
%U 2086099,726782784,9030799218,20784069600,14401134944,3463311488,251548592
%N Triangle read by rows: T(n,k) is the number of k-colored connected graphs on n labeled nodes up to permutation of the colors.
%C Equivalently, the number of ways to choose a stable partition of a simple connected graph on n labeled nodes with k parts. See A322064 for the definition of stable partition.
%H Andrew Howroyd, <a href="/A322278/b322278.txt">Table of n, a(n) for n = 1..1275</a>
%F T(n,k) = (1/k!)*Sum_{j=0..k} (-1)^(k-j)*binomial(k,j)*A322279(n,j).
%e Triangle begins:
%e 1;
%e 0, 1;
%e 0, 3, 4;
%e 0, 19, 84, 38;
%e 0, 195, 2470, 3140, 728;
%e 0, 3031, 108390, 307390, 186360, 26704;
%e 0, 67263, 7192444, 42747460, 52630060, 18926544, 1866256;
%e ...
%o (PARI)
%o M(n, K=n)={
%o my(p=sum(j=0, n, x^j/(j!*2^binomial(j, 2))) + O(x*x^n));
%o my(q=sum(j=0, n, x^j*2^binomial(j, 2)) + O(x*x^n));
%o my(W=vector(K, k, Col(serlaplace(log(serconvol(q, p^k))))));
%o Mat(vector(K, k, sum(i=1, k, (-1)^(k-i)*binomial(k,i)*W[i])/k!));
%o }
%o my(T=M(7)); for(n=1, #T, print(T[n, 1..n]))
%Y Row sums are A322064.
%Y Columns k=2..4 are A001832(for n > 1), A322330, A322331.
%Y Right diagonal is A001187.
%Y Cf. A058843, A058875, A322279, A322280.
%K nonn,tabl
%O 1,5
%A _Andrew Howroyd_, Dec 01 2018
|
