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!)
A223889 The number of connected components of size > 1 over all simple labeled graphs on n nodes. 0

%I #12 Mar 29 2013 12:33:00

%S 0,0,1,7,66,1078,33812,2124864,269617328,68809824944,35197776962400,

%T 36032789666289920,73789365506598519808,302234307608870314427904,

%U 2475886847109430725963593728,40564851077856428731075010538496

%N The number of connected components of size > 1 over all simple labeled graphs on n nodes.

%F E.g.f.: (A(x) - x - 1)*B(x) where A(x) is the e.g.f. for A001187 and B(x) is the e.g.f. for A006125.

%t nn=15;g=Sum[2^Binomial[n,2]x^n/n!,{n,0,nn}];Range[0,nn]!CoefficientList[Series[(Log[g]-x)g,{x,0,nn}],x]

%Y Cf. A125207

%K nonn

%O 0,4

%A _Geoffrey Critzer_, Mar 28 2013

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 16 04:02 EDT 2024. Contains 371696 sequences. (Running on oeis4.)