cp's OEIS Frontend

A054932 Number of unlabeled connected digraphs up to complementarity.

%I A054932 #24 Sep 01 2019 04:00:03
%S A054932 1,1,7,95,4628,760731,439476534,895794710762,6512183359880844,
%T A054932 170617184427498641390,16261113406024864291983616,
%U A054932 5683340191820651519596089554647,7334531479545984537334675978032833750,35157813638509073199087893774184443496308877
%N A054932 Number of unlabeled connected digraphs up to complementarity.
%H A054932 Andrew Howroyd, <a href="/A054932/b054932.txt">Table of n, a(n) for n = 1..50</a>
%H A054932 V. A. Liskovets, <a href="http://www.cs.uwaterloo.ca/journals/JIS/VOL3/LISK/Derseq.html">Some easily derivable sequences</a>, J. Integer Sequences, 3 (2000), #00.2.2.
%F A054932  a(n) = A003085(n) - (A000273(n)-A003086(n))/2. - _Andrew Howroyd_, Sep 17 2018
%p A054932 A054932 := proc(n)
%p A054932     A003085(n)-(A000273(n)-A003086(n))/2 ;
%p A054932 end proc:
%p A054932 seq(A054932(n),n=1..13) ; # _R. J. Mathar_, Mar 04 2018
%t A054932 A000273 = Cases[Import["https://oeis.org/A000273/b000273.txt", "Table"], {_, _}][[All, 2]];
%t A054932 A003085 = Cases[Import["https://oeis.org/A003085/b003085.txt", "Table"], {_, _}][[All, 2]];
%t A054932 A003086 = Cases[Import["https://oeis.org/A003086/b003086.txt", "Table"], {_, _}][[All, 2]];
%t A054932 a[n_] := A003085[[n]] - (A000273[[n + 1]] - A003086[[n]])/2;
%t A054932 Array[a, 50] (* _Jean-François Alcover_, Sep 01 2019 *)
%Y A054932 Cf. A000273, A003085, A003086, A054931.
%K A054932 nonn,easy
%O A054932 1,3
%A A054932 _N. J. A. Sloane_, May 24 2000
%E A054932 Terms a(14) and beyond from _Andrew Howroyd_, Sep 17 2018