|
%I #11 Jan 09 2022 12:57:55
%S 1,1,4,24,267,5647,237317,20035307,3404385285,1162502511721,
%T 796392234736238,1093228137893084112,3004752537725051647790,
%U 16527844667281561960220731,181891583847006693859132403681,4004313473818592854334088690859030
%N Number of weakly connected acyclic digraphs on n unlabeled nodes.
%C The multiset transformation gives the number acyclic digraphs on n unlabeled nodes with k components:
%C 1 ;
%C 1 , 1 ;
%C 4 , 1 , 1 ;
%C 24 , 5 , 1 , 1 ;
%C 267 , 28 , 5 , 1 , 1 ;
%C 5647 , 301 , 29 , 5 , 1 , 1 ;
%C 237317 , 6010 , 305 , 29 , 5 , 1 , 1 ; _R. J. Mathar_, Mar 21 2019
%H Andrew Howroyd, <a href="/A101228/b101228.txt">Table of n, a(n) for n = 1..50</a>
%Y Row sums of A350449.
%Y Column sums of A350450.
%Y Cf. A003087 (Euler trans.), A082402, A350451.
%K nonn
%O 1,3
%A _Vladeta Jovovic_, Jan 22 2005
|
