|
%I #4 Jun 14 2013 10:41:15
%S 0,1,1,5,17,104,816,10933,259298,11685545,1005551939,163973291348,
%T 50323109433351,28999867293155772,31395440775755417399,
%U 63967594175789887438112,245868065133951888388878298
%N Number of simple connected noneulerian graphs on n nodes.
%C Euler transform of a(n) gives A007126(n+1). [From _Vladeta Jovovic_, Mar 17 2009]
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/NoneulerianGraph.html">Noneulerian Graph</a>
%F a(n) = A001349(n) - A003049(n). [From _Vladeta Jovovic_, Mar 17 2009]
%Y Cf. A007126, A001349, A003049.
%K nonn
%O 1,4
%A _Eric W. Weisstein_, Mar 11, 2009
%E More terms via inverse Euler transform of A007126 by _R. J. Mathar_, Mar 29 2009
|
