|
Search: id:A157016
|
|
|
| A157016 |
|
Number of graphs with n vertices such that a bipartite connected component doesn't exist. |
|
+0
3
|
|
| 1, 0, 0, 1, 3, 16, 96, 812, 10957, 260494, 11713772, 1006689871, 164059928509, 50335918374222, 29003488479015273, 31397381309486933777, 63969560164056545231089, 245871831711240782887877980
(list; graph; listen)
|
|
|
OFFSET
|
0,5
|
|
|
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 this_sequence A074553 A091641 A137572
Adjacent sequences: A157013 A157014 A157015 this_sequence A157017 A157018 A157019
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Tanya Khovanova (tanyakh(AT)yahoo.com), Feb 21 2009
|
|
EXTENSIONS
|
a(7) from Wouter Meeussen, Feb 21 2009
Formula and terms from a(8) onwards from Max Alekseyev, Feb 22 2009
Corrected by Max Alekseyev and Vladeta Jovovic (vladeta(AT)eunet.yu), May 02 2009
|
|
|
Search completed in 0.002 seconds
|
