A350914 - OEIS

%I #9 Jan 29 2022 22:31:33

%S 1,0,1,0,0,3,0,0,2,8,0,0,0,12,27,0,0,0,10,68,91,0,0,0,4,127,395,350,0,

%T 0,0,0,144,1144,2170,1376,0,0,0,0,107,2393,9139,11934,5743,0,0,0,0,50,

%U 3767,28606,67104,64892,24635,0,0,0,0,12,4500,71583,288331,468702,352286,108968

%N Triangle read by rows: T(n,k) is the number of unlabeled weakly connected oriented graphs with n arcs and k vertices, k = 1..n+1.

%H Andrew Howroyd, <a href="/A350914/b350914.txt">Table of n, a(n) for n = 0..1325</a> (rows 0..50)

%e Triangle begins:

%e   1;

%e   0, 1;

%e   0, 0, 3;

%e   0, 0, 2,  8;

%e   0, 0, 0, 12,  27;

%e   0, 0, 0, 10,  68,   91;

%e   0, 0, 0,  4, 127,  395,  350;

%e   0, 0, 0,  0, 144, 1144, 2170, 1376;

%e   ...

%o (PARI) \\ See A350734 for G, InvEulerMTS.

%o T(n)={my(p=InvEulerMTS(sum(i=0, n, G(i, y+O(y^n))*x^i, O(x*x^n)))); vector(n, n, Vec(O(x^n)+polcoef(p,n-1,y)/x, -n))}

%o { my(A=T(10)); for(n=1, #A, print(A[n])) }

%Y Row sums are A350915.

%Y Column sums are A086345.

%Y Cf. A350734 (transpose), A350789 (digraphs).

%K nonn,tabl

%O 0,6

%A _Andrew Howroyd_, Jan 29 2022