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 A001431 M1382 N0540 #32 Jul 29 2024 12:36:30
%S A001431 0,0,1,1,2,5,10,24,63,165,467,1405,4435,14775,51814,190443,732472,
%T A001431 2939612,12277230,53233295,239083372,1109921554,5316143531,
%U A001431 26225625392,133050795412,693227353094,3704785464812,20285853687809,113690627637475,651559904414667
%N A001431 Number of graphs with n nodes and n-3 edges.
%D A001431 J. Riordan, An Introduction to Combinatorial Analysis, Wiley, 1958, p. 146.
%D A001431 N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
%D A001431 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H A001431 Sean A. Irvine, <a href="/A001431/b001431.txt">Table of n, a(n) for n = 1..40</a>
%H A001431 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.
%t A001431 (* first do *) Needs["Combinatorica`"] (* then *) Table[ NumberOfGraphs[n, n-3], {n, 3, 27}] (* _Robert G. Wilson v_ *)
%Y A001431 Cf. A008406.
%K A001431 nonn,easy
%O A001431 1,5
%A A001431 _N. J. A. Sloane_
%E A001431 More terms from _Vladeta Jovovic_, Jan 12 2000