|
%I #10 Jan 09 2022 22:22:00
%S 1,0,1,0,0,1,1,0,0,0,1,4,4,1,0,0,0,0,1,9,25,32,22,8,1,0,0,0,0,0,1,17,
%T 92,259,441,496,379,195,66,13,1,0,0,0,0,0,0,1,28,259,1286,4026,8754,
%U 13930,16686,15289,10785,5842,2397,722,151,19,1
%N Triangle read by rows: T(n,k) is the number of acyclic digraphs on n unlabeled nodes with k arcs and a global source and sink, n >= 1, k = 0..n*(n-1)/2.
%H Andrew Howroyd, <a href="/A350491/b350491.txt">Table of n, a(n) for n = 1..1350</a> (rows 1..20)
%e Triangle begins:
%e [1] 1;
%e [2] 0, 1;
%e [3] 0, 0, 1, 1;
%e [4] 0, 0, 0, 1, 4, 4, 1;
%e [5] 0, 0, 0, 0, 1, 9, 25, 32, 22, 8, 1;
%e [6] 0, 0, 0, 0, 0, 1, 17, 92, 259, 441, 496, 379, 195, 66, 13, 1;
%e ...
%o (PARI) \\ See PARI link in A122078 for program code.
%o { my(A=A350491rows(7)); for(i=1, #A, print(A[i])) }
%Y Row sums are A345258.
%Y Column sums are A350492.
%Y Cf. A122078, A350447, A350449, A350488.
%K nonn,tabf
%O 1,12
%A _Andrew Howroyd_, Jan 08 2022
|
