|
%I #8 Mar 16 2023 19:46:40
%S 1,0,1,0,1,2,0,5,5,6,0,83,62,42,31,0,5048,2494,1172,592,302,0,1047008,
%T 330063,103961,38312,15616,5984,0,705422362,137934757,28095923,
%U 7243110,2297690,795930,243668,0,1580348371788,184557780045,23226116293,3951426731,914429926,261269562,79512478,20286025
%N Triangle read by rows: T(n,k) is the number of digraphs on n unlabeled nodes with k strongly connected components.
%H Wikipedia, <a href="https://en.wikipedia.org/wiki/Strongly_connected_component">Strongly connected component</a>.
%e Triangle begins:
%e 1;
%e 0, 1;
%e 0, 1, 2;
%e 0, 5, 5, 6;
%e 0, 83, 62, 42, 31;
%e 0, 5048, 2494, 1172, 592, 302;
%e 0, 1047008, 330063, 103961, 38312, 15616, 5984;
%e ...
%o (PARI) \\ See PARI link in A350794 for program code.
%o { my(A=A361582triang(6)); for(n=1, #A, print(A[n])) }
%Y Column k=1 is A035512.
%Y Main diagonal is A003087.
%Y Row sums are A000273.
%Y The labeled version is A361455.
%Y Cf. A106238, A350794, A361587, A361588.
%K nonn,tabl
%O 0,6
%A _Andrew Howroyd_, Mar 16 2023
|
