cp's OEIS Frontend

A101228 Number of weakly connected acyclic digraphs on n unlabeled nodes.

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