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.

A006651 Number of graphs with n nodes, n+2 edges and no isolated vertices.

This page as a plain text file.
%I A006651 M3584 #15 Jul 08 2025 16:51:37
%S A006651 1,4,22,110,515,2272,9777,40752,166519,668134,2644988,10351321,
%T A006651 40150556,154591610,591780559,2254880616,8561287942,32418230925,
%U A006651 122522492807,462502319244,1744810912396,6581954720648,24839735669771
%N A006651 Number of graphs with n nodes, n+2 edges and no isolated vertices.
%D A006651 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 A006651 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%Y A006651 Cf. A048180.
%K A006651 nonn
%O A006651 4,2
%A A006651 _N. J. A. Sloane_
%E A006651 More terms from _Vladeta Jovovic_, Mar 02 2008