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 A054960 #20 Aug 15 2019 17:01:35
%S A054960 0,1,2,5,16,78,522,6168,137316,6002584,509498932,82545585936,
%T A054960 25251015681176,14527077828617744,15713242984902154384,
%U A054960 32000507852263778595584,122967932076766466336249888,893788862572805850273939095424,12318904626562502262191503745716384
%N A054960 Number of unlabeled graphs with n nodes and an odd number of edges.
%H A054960 Andrew Howroyd, <a href="/A054960/b054960.txt">Table of n, a(n) for n = 1..50</a>
%H A054960 V. A. Liskovets, <a href="http://www.cs.uwaterloo.ca/journals/JIS/VOL3/LISK/Derseq.html">Some easily derivable sequences</a>, J. Integer Sequences, 3 (2000), #00.2.2.
%F A054960 a(n) = (A000088(n) - A000171(n))/2.
%t A054960 Table[Total[Table[NumberOfGraphs[n,m],{m,1,Binomial[n,2],2}]],{n,1,15}] (* _Geoffrey Critzer_, Oct 20 2012 *)
%Y A054960 Cf. A000088, A000171.
%Y A054960 Cf. A007869 for graphs with an even number of edges.
%K A054960 nonn,easy
%O A054960 1,3
%A A054960 _N. J. A. Sloane_, May 24 2000
%E A054960 More terms from _Vladeta Jovovic_, Jul 19 2000
%E A054960 Terms a(18) and beyond from _Andrew Howroyd_, Sep 17 2018