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.

A210346 The number of degree sequences of simple graphs with 2n vertices with all odd degrees.

Original entry on oeis.org

1, 3, 14, 74, 425, 2515, 15209, 93382, 579950, 3634062, 22935259, 145601216, 928875440, 5950570725, 38257352346, 246730727752, 1595578916923
Offset: 1

Views

Author

Tanya Khovanova and Dai Yang, Mar 20 2012

Keywords

Comments

The graphs with an odd number of vertices can't have all odd degrees.
a(n) = A210345(2n). The complementary sequence has all even degrees.

Examples

			For 4 vertices, there are three degree sequences with all terms odd: {3,3,3,3}, {3,1,1,1}, {1,1,1,1}. Thus a(2) = 3.
		

Crossrefs

Extensions

a(7)-a(17) from Robert Gerbicz, Apr 08 2012