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 A236525 #30 Jan 04 2022 21:55:44 %S A236525 0,0,1,4,21,121,956,12043,273549,11999689,1018965561,165090921457, %T A236525 50502028840240,29054155623249635,31426485969192461828, %U A236525 64001015704512693244004,245935864153532444460997784,1787577725145611678835828915650,24637809253125004523074706811821299 %N A236525 Number of simple non-bipartite graphs on n nodes. %H A236525 Andrew Howroyd, <a href="/A236525/b236525.txt">Table of n, a(n) for n = 1..50</a> %F A236525 a(n) = A000088(n) - A033995(n). %e A236525 a(3) = 1 since the only non-bipartite graph on 3 vertices is the triangle. %o A236525 (Sage) def a(n): return len([G for G in graphs(n) if not G.is_bipartite()]) %Y A236525 Cf. A000088, A033995. %K A236525 nonn %O A236525 1,4 %A A236525 _Jernej Azarija_, Jan 29 2014 %E A236525 More terms from _Joerg Arndt_, Feb 01 2014