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

 


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A331233 Number of unlabeled rooted trees with n vertices and more than two branches of the root. 4

%I #25 May 20 2021 04:08:53

%S 0,0,0,1,2,5,12,30,75,194,501,1317,3485,9302,24976,67500,183290,

%T 500094,1369939,3766831,10391722,28756022,79794407,221987348,

%U 619019808,1729924110,4844242273,13590663071,38195831829,107523305566,303148601795,855922155734,2419923253795

%N Number of unlabeled rooted trees with n vertices and more than two branches of the root.

%H Alois P. Heinz, <a href="/A331233/b331233.txt">Table of n, a(n) for n = 1..1000</a> (first 500 terms from Andrew Howroyd)

%F For n > 1, a(n) = Sum_{k > 2} A033185(n - 1, k).

%F G.f.: f(x) - x*(1 + f(x) + (f(x)^2 + f(x^2))/2) where f(x) is the g.f. of A000081. - _Andrew Howroyd_, Jan 22 2020

%e The a(4) = 1 through a(7) = 12 rooted trees:

%e (ooo) (oooo) (ooooo) (oooooo)

%e (oo(o)) (oo(oo)) (oo(ooo))

%e (ooo(o)) (ooo(oo))

%e (o(o)(o)) (oooo(o))

%e (oo((o))) (o(o)(oo))

%e (oo((oo)))

%e (oo(o)(o))

%e (oo(o(o)))

%e (ooo((o)))

%e ((o)(o)(o))

%e (o(o)((o)))

%e (oo(((o))))

%p g:= proc(n, i, t) option remember; `if`(n=0, `if`(t=0, 1, 0),

%p `if`(i<1, 0, add(binomial(g(i-1$2, 0)+j-1, j)*

%p g(n-i*j, i-1, max(0, t-j)), j=0..n/i)))

%p end:

%p a:= n-> g(n-1$2, 3):

%p seq(a(n), n=1..40); # _Alois P. Heinz_, Jan 22 2020

%t urt[n_]:=Join@@Table[Union[Sort/@Tuples[urt/@ptn]],{ptn,IntegerPartitions[n-1]}];

%t Table[Length[Select[urt[n],Length[#]>2&]],{n,10}]

%t (* Second program: *)

%t g[n_, i_, t_] := g[n, i, t] = If[n == 0, If[t == 0, 1, 0],

%t If[i < 1, 0, Sum[Binomial[g[i - 1, i - 1, 0] + j - 1, j]*

%t g[n - i*j, i - 1, Max[0, t - j]], {j, 0, n/i}]]];

%t a[n_] := g[n-1, n-1, 3];

%t Array[a, 40] (* _Jean-François Alcover_, May 20 2021, after _Alois P. Heinz_ *)

%o (PARI) \\ TreeGf gives gf of A000081.

%o TreeGf(N)={my(A=vector(N, j, 1)); for (n=1, N-1, A[n+1] = 1/n * sum(k=1, n, sumdiv(k, d, d*A[d]) * A[n-k+1] ) ); x*Ser(A)}

%o seq(n)={my(g=TreeGf(n)); Vec(g - x*(1 + g + (g^2 + subst(g, x, x^2))/2), -n)} \\ _Andrew Howroyd_, Jan 22 2020

%Y The Matula-Goebel numbers of these trees are given by A033942.

%Y The series-reduced case is A331488.

%Y The lone-child-avoiding case is (also) A331488.

%Y The labeled version is A331577.

%Y Unlabeled rooted trees are counted by A000081.

%Y Cf. A001678, A001679, A004111, A033185, A060313, A206429, A331490, A331578.

%K nonn

%O 1,5

%A _Gus Wiseman_, Jan 21 2020

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | 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 September 19 12:50 EDT 2024. Contains 376012 sequences. (Running on oeis4.)