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 A136285 #7 Aug 08 2015 23:47:43 %S A136285 0,0,0,23,515,10210,221130,5499165,158416629,5264924490,200122583760, %T A136285 8616774658305,416417619554365,22400104990385122,1331442091500919580, %U A136285 86886850043131597095,6189883012226095338135,478992622411196645778030 %N A136285 Number of graphs on n labeled nodes with maximal degree exactly 3. %D A136285 D. E. Knuth, The Art of Computer Programming, Vol. 4A, Section 7.1.4. %H A136285 Alois P. Heinz, <a href="/A136285/b136285.txt">Table of n, a(n) for n = 1..200</a> %F A136285 Equals A136282 - A136281. %Y A136285 Cf. A000085 (degree at most 1), A136281-A136286. %K A136285 nonn %O A136285 1,4 %A A136285 _Don Knuth_, Mar 31 2008 %E A136285 More terms from _Alois P. Heinz_, Sep 12 2008