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!)
 A182012 Number of graphs on 2n unlabeled nodes all having odd degree. 4
 1, 3, 16, 243, 33120, 87723296, 3633057074584, 1967881448329407496, 13670271807937483065795200, 1232069666043220685614640133362240, 1464616584892951614637834432454928487321792, 23331378450474334173960358458324497256118170821672192, 5051222500253499871627935174024445724071241027782979567759187712 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS As usual, "graph" means "simple graph, without self-loops or multiple edges". The graphs on 2n vertices all having odd degrees are just the complements of those having all even degrees. That's why the property of all odd degrees is seldom mentioned. Therefore this sequence is just every second term of A002854. - Brendan McKay, Apr 08 2012 LINKS Sequence Fans Mailing List, Discussion, April 2012. N. J. A. Sloane, The 16 graphs on 6 nodes FORMULA a(n) = A002854(2n). EXAMPLE The 3 graphs on 4 vertices are [(0, 3), (1, 3), (2, 3)], [(0, 2), (1, 3)], [(0, 1), (0, 2), (0, 3), (1, 2), (1, 3), (2, 3)]: the tree with root of order 3, the disconnected graph consisting of two complete 2-vertex graphs, and the complete graph. PROG (Sage) def graphsodddegree(MAXN=5):     """     requires optional package "nauty"     """     an=[]     for n in xrange(1, MAXN+1):         gn=graphs.nauty_geng("%s"%(2*n))         cac={}         a=0         for G in gn:             d=G.degree_sequence()             v=uniq([i%2 for i in d])             if v==[1]:                 a += 1         print 'a(%s)=%s'%(n, a)         an += [a]     return an CROSSREFS Cf. A210345, A210346, A000088. Bisection of A002854. Sequence in context: A113597 A000273 A071897 * A272385 A013923 A053466 Adjacent sequences:  A182009 A182010 A182011 * A182013 A182014 A182015 KEYWORD nonn,easy AUTHOR Georgi Guninski, Apr 06 2012 EXTENSIONS Terms from a(6) on added from A002854. - N. J. A. Sloane, 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.