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!)
 A157016 Number of graphs with n vertices such that a bipartite connected component doesn't exist. 2
 1, 0, 0, 1, 3, 16, 96, 812, 10957, 260494, 11713772, 1006689871, 164059928509, 50335918374222, 29003488479015273, 31397381309486933777, 63969560164056545231089, 245871831711240782887877980, 1787331725280384281389706209909, 24636021429463931875328533035140871, 645465483198968863672173418327800803328 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,5 LINKS FORMULA Euler transform of A157051. - Max Alekseyev, Feb 22 2009 A157015(n) + a(n) = A000088(n). MATHEMATICA cbs[g_] := Or @@ Map[BipartiteQ, Map[InduceSubgraph[g, # ] &, ConnectedComponents[g]]] Table[Count[Map[cbs, ListGraphs[n]], False], {n, 6}] Table[Count[Map[cbs, ListGraphs[n]], False], {n, 7}] (* Wouter Meeussen, Feb 21 2009 *) CROSSREFS Sequence in context: A000270 A157051 A000271 * A228792 A233203 A074553 Adjacent sequences:  A157013 A157014 A157015 * A157017 A157018 A157019 KEYWORD nonn AUTHOR Tanya Khovanova, Feb 21 2009 EXTENSIONS a(7) from Wouter Meeussen, Feb 21 2009 Formula and terms a(8)-a(17) from Max Alekseyev, Feb 22 2009 Corrected by Max Alekseyev and Vladeta Jovovic, May 02 2009 a(18)-a(20) from Max Alekseyev, Jun 24 2013 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.