login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A055969
Number of unlabeled digraphs with n nodes and an odd number of arcs.
2
0, 1, 6, 104, 4736, 770112, 440994608, 896679244544, 6513978322585408, 170630215971902124288, 16261454692523251085611648, 5683372715412699486531047331840, 7334542846356464931239079919515090432, 35157828307617499760690834338506768579289088
OFFSET
1,3
LINKS
FORMULA
a(n) = (A000273(n)-A003086(n))/2.
MATHEMATICA
A000273 = Cases[Import["https://oeis.org/A000273/b000273.txt", "Table"], {_, _}][[All, 2]];
A003086 = Cases[Import["https://oeis.org/A003086/b003086.txt", "Table"], {_, _}][[All, 2]];
a[n_] := (A000273[[n + 1]] - A003086[[n]])/2;
Array[a, 50] (* Jean-François Alcover, Sep 12 2019, after Andrew Howroyd *)
CROSSREFS
KEYWORD
easy,nonn
AUTHOR
Vladeta Jovovic, Jul 19 2000
EXTENSIONS
Terms a(14) and beyond from Andrew Howroyd, Sep 17 2018
STATUS
approved