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 A001436 M3583 N1453 #21 May 05 2021 18:00:08 %S A001436 0,0,0,1,4,22,107,486,2075,8548,33851,130365,489387,1799700,6499706, %T A001436 23118465,81134475,281454170,966388692,3288208176,11098235911, %U A001436 37188198356,123800999503,409715126169,1348690034859,4417932007626,14407260221164 %N A001436 Number of connected graphs with n nodes, n+2 edges. %D A001436 N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence). %D A001436 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence). %H A001436 Sean A. Irvine, <a href="/A001436/b001436.txt">Table of n, a(n) for n = 1..40</a> %H A001436 M. L. Stein and P. R. Stein, <a href="http://dx.doi.org/10.2172/4180737">Enumeration of Linear Graphs and Connected Linear Graphs up to p = 18 Points</a>. Report LA-3775, Los Alamos Scientific Laboratory of the University of California, Los Alamos, NM, Oct 1967. %Y A001436 A diagonal of A054923. %K A001436 nonn %O A001436 1,5 %A A001436 _N. J. A. Sloane_ %E A001436 Description corrected Aug 02 1996. %E A001436 More terms from _Sean A. Irvine_, Jul 23 2012