cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A158007 Number of simple connected noneulerian graphs on n nodes.

This page as a plain text file.
%I A158007 #11 Jun 29 2025 21:57:10
%S A158007 0,1,1,5,17,104,816,10933,259298,11685545,1005551939,163973291348,
%T A158007 50323109433351,28999867293155772,31395440775755417399,
%U A158007 63967594175789887438112,245868065133951888388878298
%N A158007 Number of simple connected noneulerian graphs on n nodes.
%C A158007 Euler transform of a(n) gives A007126(n+1). [From _Vladeta Jovovic_, Mar 17 2009]
%H A158007 Chai Wah Wu, <a href="/A158007/b158007.txt">Table of n, a(n) for n = 1..82</a>
%H A158007 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/NoneulerianGraph.html">Noneulerian Graph</a>
%F A158007 a(n) = A001349(n) - A003049(n). [From _Vladeta Jovovic_, Mar 17 2009]
%Y A158007 Cf. A007126, A001349, A003049.
%K A158007 nonn
%O A158007 1,4
%A A158007 _Eric W. Weisstein_, Mar 11 2009
%E A158007 More terms via inverse Euler transform of A007126 by _R. J. Mathar_, Mar 29 2009