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 A210345 #16 Apr 08 2012 09:04:08
%S A210345 1,1,2,3,7,14,36,74,201,425,1178,2515,7063,15209,43088,93382,266236,
%T A210345 579950,1661548,3634062,10451798,22935259,66170288,145601216,
%U A210345 421164456,928875440,2692737120,5950570725,17282501978,38257352346,111292168834,246730727752,718763328317,1595578916923,4653944394630
%N A210345 The number of degree sequences of simple graphs with n vertices with all even degrees.
%C A210345 a(2n) = A210346(n). For even n, the complementary sequence has all odd degrees.
%e A210345 For n=3, there are only two degree sequences with all even terms are possible: {0,0,0} and {2,2,2}. Thus, a(3)=2.
%Y A210345 Cf. A210346, A049339
%K A210345 nonn
%O A210345 1,3
%A A210345 _Tanya Khovanova_ and Dai Yang, Mar 20 2012
%E A210345 a(13)-a(35) from _Robert Gerbicz_, Apr 08 2012