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.

Showing 1-1 of 1 results.

A158007 Number of simple connected noneulerian graphs on n nodes.

Original entry on oeis.org

0, 1, 1, 5, 17, 104, 816, 10933, 259298, 11685545, 1005551939, 163973291348, 50323109433351, 28999867293155772, 31395440775755417399, 63967594175789887438112, 245868065133951888388878298
Offset: 1

Views

Author

Eric W. Weisstein, Mar 11 2009

Keywords

Comments

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

Links

Crossrefs

Cf. A007126, A001349, A003049.

Formula

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

Extensions

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

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.