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 A210346 #15 Apr 08 2012 09:06:44
%S A210346 1,3,14,74,425,2515,15209,93382,579950,3634062,22935259,145601216,
%T A210346 928875440,5950570725,38257352346,246730727752,1595578916923
%N A210346 The number of degree sequences of simple graphs with 2n vertices with all odd degrees.
%C A210346 The graphs with an odd number of vertices can't have all odd degrees.
%C A210346 a(n) = A210345(2n). The complementary sequence has all even degrees.
%e A210346 For 4 vertices, there are three degree sequences with all terms odd: {3,3,3,3}, {3,1,1,1}, {1,1,1,1}. Thus a(2) = 3.
%Y A210346 Cf. A210345, A182012.
%K A210346 nonn,more
%O A210346 1,2
%A A210346 _Tanya Khovanova_ and Dai Yang, Mar 20 2012
%E A210346 a(7)-a(17) from _Robert Gerbicz_, Apr 08 2012