login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A006651 Number of graphs with n nodes, n+2 edges and no isolated vertices.
(Formerly M3584)
1

%I M3584 #11 May 10 2013 12:43:49

%S 1,4,22,110,515,2272,9777,40752,166519,668134,2644988,10351321,

%T 40150556,154591610,591780559,2254880616,8561287942,32418230925,

%U 122522492807,462502319244,1744810912396,6581954720648,24839735669771

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

%D 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 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

%Y Cf. A048180.

%K nonn

%O 4,2

%A _N. J. A. Sloane_.

%E More terms from _Vladeta Jovovic_, Mar 02 2008

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 03:15 EDT 2024. Contains 371964 sequences. (Running on oeis4.)