login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo

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 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A158007 Number of simple connected noneulerian graphs on n nodes. 1
0, 1, 1, 5, 17, 104, 816, 10933, 259298, 11685545, 1005551939, 163973291348, 50323109433351, 28999867293155772, 31395440775755417399, 63967594175789887438112, 245868065133951888388878298 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,4

COMMENTS

Euler transform of a(n) gives A007126(n+1). [From Vladeta Jovovic, Mar 17 2009]

LINKS

Table of n, a(n) for n=1..17.

Eric Weisstein's World of Mathematics, Noneulerian Graph

FORMULA

a(n) = A001349(n) - A003049(n). [From Vladeta Jovovic, Mar 17 2009]

CROSSREFS

Cf. A007126, A001349, A003049.

Sequence in context: A145986 A200992 A034821 * A349011 A143562 A261425

Adjacent sequences: A158004 A158005 A158006 * A158008 A158009 A158010

KEYWORD

nonn

AUTHOR

Eric W. Weisstein, Mar 11, 2009

EXTENSIONS

More terms via inverse Euler transform of A007126 by R. J. Mathar, Mar 29 2009

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 1 18:55 EST 2022. Contains 358475 sequences. (Running on oeis4.)