%I #10 Jan 28 2020 15:01:26
%S 1,2,0,4,13,98,748,9982,205290,6546960,352371887,29668304472,
%T 4303531187466,985391751078694,391866509275972993,
%U 248491878411568471280,274544424465100159954078,488310442484985365942048784,1513516279388226593561422201905
%N Number of connected edge-self-dual nets with n nodes.
%H Edward A. Bender and E. Rodney Canfield, <a href="https://doi.org/10.1016/0095-8956(83)90040-0">Enumeration of connected invariant graphs</a>, Journal of Combinatorial Theory, Series B 34.3 (1983): 268-278. See p. 275.
%H Andrew Howroyd, <a href="/A320491/a320491.txt">PARI Program</a>
%F a(2*n-1) = b(2*n-1), a(2*n) = b(2*n) - (A320489(n) - a(n))/2 where b is the Inverse Euler transform of A004106.
%o (PARI) \\ See link for program.
%o A320491seq(20) \\ _Andrew Howroyd_, Jan 28 2020
%Y Cf. A004103 (nets), A004106 (edge-self-dual), A320489 (connected nets).
%K nonn
%O 0,2
%A _N. J. A. Sloane_, Oct 25 2018
%E Dead sequence restored, corrected and extended by _Andrew Howroyd_, Jan 28 2020