cp's OEIS Frontend

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.

A006650 Number of graphs with n nodes, n+1 edges and no isolated vertices.

This page as a plain text file.
%I A006650 M3903 #14 Jul 08 2025 16:51:32
%S A006650 1,5,20,73,271,974,3507,12487,44475,157814,559952,1985053,7040855,
%T A006650 24986930,88782435,315911844,1126178655,4023135764,14406870196,
%U A006650 51728509807,186275015554,672886200335
%N A006650 Number of graphs with n nodes, n+1 edges and no isolated vertices.
%D A006650 W. L. Kocay, Some new methods in reconstruction theory, pp. 89 - 114 of Combinatorial Mathematics IX. Proc. Ninth Australian Conference (Brisbane, August 1981). Ed. E. J. Billington, S. Oates-Williams and A. P. Street. Lecture Notes Math., 952. Springer-Verlag, 1982.
%D A006650 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%Y A006650 Cf. A048179, A048180.
%K A006650 nonn
%O A006650 4,2
%A A006650 _N. J. A. Sloane_
%E A006650 More terms from _Vladeta Jovovic_, Mar 02 2008