|
%I #13 Sep 06 2018 04:45:13
%S 1,0,0,1,3,16,96,812,10957,260494,11713772,1006689871,164059928509,
%T 50335918374222,29003488479015273,31397381309486933777,
%U 63969560164056545231089,245871831711240782887877980,1787331725280384281389706209909,24636021429463931875328533035140871,645465483198968863672173418327800803328
%N Number of graphs with n vertices such that a bipartite connected component doesn't exist.
%H Andrew Howroyd, <a href="/A157016/b157016.txt">Table of n, a(n) for n = 0..50</a>
%F Euler transform of A157051. - _Max Alekseyev_, Feb 22 2009
%F A157015(n) + a(n) = A000088(n).
%t cbs[g_] := Or @@ Map[BipartiteQ, Map[InduceSubgraph[g, # ] &, ConnectedComponents[g]]] Table[Count[Map[cbs, ListGraphs[n]], False], {n, 6}]
%t Table[Count[Map[cbs, ListGraphs[n]], False], {n,7}] (* _Wouter Meeussen_, Feb 21 2009 *)
%Y Cf. A000088, A157015, A157051.
%K nonn
%O 0,5
%A _Tanya Khovanova_, Feb 21 2009
%E a(7) from _Wouter Meeussen_, Feb 21 2009
%E Formula and terms a(8)-a(17) from _Max Alekseyev_, Feb 22 2009
%E Corrected by _Max Alekseyev_ and _Vladeta Jovovic_, May 02 2009
%E a(18)-a(20) from _Max Alekseyev_, Jun 24 2013
|
