|
%I #15 Dec 18 2020 11:55:55
%S 1,1,3,6,12,23,47,92,189,401,869,1949,4475,10520,25183,61366,151555,
%T 379164,958555,2446746,6296819,16326996,42613240,111889355,295372835,
%U 783598713,2088175182,5587741350,15009229137,40458659246,109416872688,296810505298
%N Number of simple unlabeled graphs on n nodes with exactly 3 connected components that are trees or cycles.
%H Alois P. Heinz, <a href="/A215983/b215983.txt">Table of n, a(n) for n = 3..650</a>
%F a(n) ~ c * d^n / n^(5/2), where d = A051491 = 2.9557652856519949747148..., c = 0.13932434077355395... . - _Vaclav Kotesovec_, Sep 07 2014
%e a(5) = 3: .o o-o. .o o-o. .o o o.
%e . |/ . . | . .| | .
%e .o o . .o o . .o o .
%p with(numtheory):
%p b:= proc(n) option remember; local d, j; `if`(n<=1, n,
%p (add(add(d*b(d), d=divisors(j)) *b(n-j), j=1..n-1))/(n-1))
%p end:
%p g:= proc(n) option remember; local k; `if`(n>2, 1, 0)+ b(n)-
%p (add(b(k)*b(n-k), k=0..n) -`if`(irem(n, 2)=0, b(n/2), 0))/2
%p end:
%p p:= proc(n, i, t) option remember; `if`(n<t, 0, `if`(n=t, 1,
%p `if`(min(i, t)<1, 0, add(binomial(g(i)+j-1, j)*
%p p(n-i*j, i-1, t-j), j=0..min(n/i,t)))))
%p end:
%p a:= n-> p(n, n, 3):
%p seq(a(n), n=3..40);
%t b[n_] := b[n] = If[n <= 1, n, Sum[Sum[d*b[d], {d, Divisors[j]}]*b[n - j], {j, 1, n - 1}]/(n - 1)];
%t g[n_] := g[n] = If[n > 2, 1, 0] + b[n] - (Sum[b[k]*b[n - k], {k, 0, n}] - If[Mod[n, 2] == 0, b[n/2], 0])/2;
%t p[n_, i_, t_] := p[n, i, t] = If[n < t, 0, If[n == t, 1, If[Min[i, t] < 1, 0, Sum[Binomial[g[i] + j - 1, j]*p[n - i*j, i - 1, t - j], {j, 0, Min[n/i, t]}]]]];
%t a[n_] := p[n, n, 3];
%t a /@ Range[3, 40] (* _Jean-François Alcover_, Dec 18 2020, after _Alois P. Heinz_ *)
%Y Column k=3 of A215977.
%Y The labeled version is A215853.
%K nonn
%O 3,3
%A _Alois P. Heinz_, Aug 29 2012
|
