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 A048179 #25 Jan 09 2024 16:55:45 %S A048179 1,6,24,97,402,1637,6759,28259,119890,517121,2271860,10176660, %T A048179 46541024,217511951,1039651295,5084972068,25458149446,130480742790, %U A048179 684550272269,3675258986639,20184618368312,113340974676578,650343587802644 %N A048179 Number of graphs with n nodes and n+1 edges. %D A048179 J. Riordan, An Introduction to Combinatorial Analysis, Wiley, 1958, p. 146. %H A048179 Andrew Howroyd, <a href="/A048179/b048179.txt">Table of n, a(n) for n = 4..50</a> (terms 4..37 from Sean A. Irvine) %H A048179 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. %F A048179 a(n) = A008406(n, n+1). - _Andrew Howroyd_, Jan 09 2024 %o A048179 (PARI) a(n) = polcoef(G(n, O(x^(n+2))), n+1) \\ G defined in A008406. - _Andrew Howroyd_, Jan 09 2024 %Y A048179 Cf. A008406. %K A048179 nonn,easy,nice %O A048179 4,2 %A A048179 _N. J. A. Sloane_ %E A048179 More terms from _Vladeta Jovovic_, Jan 07 2000 %E A048179 More terms from _Sean A. Irvine_, Jun 06 2017