This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A079565 #18 Sep 18 2019 04:56:26
%S A079565 1,1,2,6,16,49,129,481,1845,9506,57896,463909,4769436,65179170,
%T A079565 1187099045,29082860878,960963147303,42920936851975,2594399793419459,
%U A079565 212465886865393053,23596018831885668391,3557502387712889568013,728850489548729072323085
%N A079565 Number of unlabeled and connected graphs on n vertices which are either bipartite or co-bipartite.
%C A079565 G is bipartite iff the vertices can be partitioned into two sets such that all the edges in the graph go from one of these sets to the other. G is cobipartite iff the complement of G is bipartite.
%C A079565 For n >= 5, no graph can be both bipartite and co-bipartite. - _Falk Hüffner_, Jan 22 2016
%H A079565 Andrew Howroyd, <a href="/A079565/b079565.txt">Table of n, a(n) for n = 1..50</a>
%F A079565 For n >= 5, a(n) = A079571(n) + A005142(n). - _Falk Hüffner_, Jan 22 2016
%e A079565 Let G be a graph with 5 vertices, 4 of which form a path and the 5th adjacent only to the two vertices in the middle of the path. Then G is not bipartite nor cobipartite because there is a triangle in both G and its complement.
%t A079565 A005142 = Import["https://oeis.org/A005142/b005142.txt", "Table"][[All, 2]];
%t A079565 A033995 = Import["https://oeis.org/A033995/b033995.txt", "Table"][[All, 2]];
%t A079565 a[n_] := If[n<5, {1, 1, 2, 6}[[n]], A005142[[n+1]] + A033995[[n+1]] - Floor[n/2]];
%t A079565 a /@ Range[1, 50] (* _Jean-François Alcover_, Sep 17 2019 *)
%Y A079565 Cf. A005142, A079571.
%K A079565 nonn
%O A079565 1,3
%A A079565 _Jim Nastos_, Jan 24 2003
%E A079565 More terms using formula by _Falk Hüffner_, Jan 22 2016
%E A079565 Terms a(21) and beyond from _Andrew Howroyd_, Sep 05 2018