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!)
A215853 Number of simple labeled graphs on n nodes with exactly 3 connected components that are trees or cycles. 3

%I #15 Apr 01 2017 19:01:17

%S 1,6,55,540,6412,90734,1515097,29368155,649910349,16178495157,

%T 447436384356,13607804913248,451277483034618,16204761730619392,

%U 626327433705523558,25924177756443661632,1144012780063556028591,53615833082093775740400,2659498185704802765924159

%N Number of simple labeled graphs on n nodes with exactly 3 connected components that are trees or cycles.

%H Alois P. Heinz, <a href="/A215853/b215853.txt">Table of n, a(n) for n = 3..145</a>

%F a(n) ~ c * n^(n-2), where c = 0.130848879059... . - _Vaclav Kotesovec_, Sep 07 2014

%e a(4) = 6:

%e .1-2. .1 2. .1 2. .1 2. .1 2. .1 2.

%e . . . |. . . .| . . \ . . / .

%e .4 3. .4 3. .4-3. .4 3. .4 3. .4 3.

%p T:= proc(n, k) option remember; `if`(k<0 or k>n, 0,

%p `if`(n=0, 1, add(binomial(n-1, i)*T(n-1-i, k-1)*

%p `if`(i<2, 1, i!/2 +(i+1)^(i-1)), i=0..n-k)))

%p end:

%p a:= n-> T(n, 3):

%p seq(a(n), n=3..25);

%t T[n_, k_] := T[n, k] = If[k<0 || k>n, 0, If[n == 0, 1, Sum[Binomial[n-1, i]*T[n-1-i, k-1]*If[i<2, 1, i!/2 + (i+1)^(i-1)], {i, 0, n-k}]]];

%t a[n_] := T[n, 3];

%t Table[a[n], {n, 3, 25}] (* _Jean-François Alcover_, Apr 01 2017, translated from Maple *)

%Y Column k=3 of A215861.

%Y The unlabeled version is A215983.

%K nonn

%O 3,2

%A _Alois P. Heinz_, Aug 25 2012

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 March 29 04:23 EDT 2024. Contains 371264 sequences. (Running on oeis4.)