This site is supported by donations to The OEIS Foundation.

 Annual appeal: Please make a donation to keep the OEIS running! Over 6000 articles have referenced us, often saying "we discovered this result with the help of the OEIS". Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A210346 The number of degree sequences of simple graphs with 2n vertices with all odd degrees. 2
 1, 3, 14, 74, 425, 2515, 15209, 93382, 579950, 3634062, 22935259, 145601216, 928875440, 5950570725, 38257352346, 246730727752, 1595578916923 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 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. LINKS EXAMPLE 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 Cf. A210345, A182012. Sequence in context: A080238 A213228 A277939 * A074549 A245246 A126122 Adjacent sequences:  A210343 A210344 A210345 * A210347 A210348 A210349 KEYWORD nonn,more AUTHOR Tanya Khovanova and Dai Yang, Mar 20 2012 EXTENSIONS a(7)-a(17) from Robert Gerbicz, Apr 08 2012 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.

Last modified November 19 11:04 EST 2017. Contains 294936 sequences.