login
This site is supported by donations to The OEIS Foundation.

 

Logo

The OEIS is looking to hire part-time people to help edit core sequences, upload scanned documents, process citations, fix broken links, etc. - Neil Sloane, njasloane@gmail.com

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 * A143562 A261425 A235871

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 | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified May 28 16:19 EDT 2017. Contains 287241 sequences.