Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A158007
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A158007 Number of simple connected noneulerian graphs on n nodes. +0
2
0, 1, 1, 5, 17, 104, 816, 10933, 259298, 11685545, 1005551939, 163973291348, 50323109433351, 28999867293155772, 31395440775755417399, 63967594175789887438112, 245868065133951888388878298 (list; graph; listen)
OFFSET

1,4

COMMENT

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

LINKS

Eric Weisstein's World of Mathematics, Noneulerian Graph

FORMULA

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

CROSSREFS

Cf. A007126, A001349, A003049.

Sequence in context: A076516 A145986 A034821 this_sequence A143562 A098028 A100301

Adjacent sequences: A158004 A158005 A158006 this_sequence A158008 A158009 A158010

KEYWORD

nonn

AUTHOR

E. W. Weisstein (eric(AT)weisstein.com), Mar 11, 2009

EXTENSIONS

More terms via inverse Euler transform of A007126 by R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Mar 29 2009

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research