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 A001437 M1538 N0601 #25 Jul 08 2025 16:26:27 %S A001437 1,1,2,5,22,138,1579,33366,1348674,105925685,15968704512, %T A001437 4520384306832,2402814904220039,2425664021535713098, %U A001437 4647586298937784001491,16787189663016572148130262,114716901953374968257425111039 %N A001437 Number of connected graphs with n nodes and ceiling(n(n-1)/4) edges. %D A001437 N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence). %D A001437 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence). %H A001437 Sean A. Irvine, <a href="/A001437/b001437.txt">Table of n, a(n) for n = 2..40</a> %H A001437 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 A001437 Largest entries in the rows of the table in A054924. %K A001437 nonn,nice %O A001437 2,3 %A A001437 _N. J. A. Sloane_ %E A001437 More terms from _Sean A. Irvine_, Jul 24 2012