cp's OEIS Frontend

A212629 Number of vertices in all maximal independent vertex subsets in the rooted tree with Matula-Goebel number n.

%I A212629 #27 Jun 20 2024 07:57:47
%S A212629 1,2,3,3,6,6,4,4,9,9,9,8,8,8,14,5,8,15,5,11,11,14,15,10,22,15,25,10,
%T A212629 11,20,14,6,22,11,17,19,10,10,20,13,15,18,10,17,33,25,20,12,13,28,17,
%U A212629 18,6,36,32,12,13,20,11,24,19,22,29,7,31,31,10,13,33,24,13,23,18,19,45,12,26,32
%N A212629 Number of vertices in all maximal independent vertex subsets in the rooted tree with Matula-Goebel number n.
%C A212629 A vertex subset in a tree is said to be independent if no pair of vertices is connected by an edge. The empty set is considered to be independent. An independent vertex subset S of a tree is said to be maximal if  every vertex that is not in S is joined by an edge to at least one vertex of S.
%C A212629 The Matula-Goebel number of a rooted tree can be defined in the following recursive manner: to the one-vertex tree there corresponds the number 1; to a tree T with root degree 1 there corresponds the t-th prime number, where t is the Matula-Goebel number of the tree obtained from T by deleting the edge emanating from the root; to a tree T with root degree m>=2 there corresponds the product of the Matula-Goebel numbers of the m branches of T.
%C A212629 Let A(n)=A(n,x), B(n)=B(n,x), C(n)=C(n,x) be the generating polynomial with respect to size of the maximal independent sets that contain the root, the maximal independent sets that do not contain the root, and the independent sets which are not maximal but become maximal if the root is removed, respectively. We have: A(1)=x, B(1)=0, C(1)=1, A(t-th prime) = x[B(t) + C(t)], B(t-th prime) = A(t), C(t-th prime)=B(t), A(rs)=A(r)A(s)/x, B(rs)=B(r)B(s)+B(r)C(s)+B(s)C(r), C(rs)=C(r)C(s) (r,s>=2). The generating polynomial of the maximal independent vertex subsets with respect to size is P(n, x)=A(n,x)+B(n,x). Then a(n)=subs(x=1, dP(n,x)/dx). The Maple program is based on these relations.
%H A212629 É. Czabarka, L. Székely, and S. Wagner, <a href="https://doi.org/10.1016/j.dam.2009.07.004">The inverse problem for certain tree parameters</a>, Discrete Appl. Math., 157, 2009, 3314-3319.
%H A212629 Emeric Deutsch, <a href="http://arxiv.org/abs/1111.4288"> Rooted tree statistics from Matula numbers</a>, arXiv:1111.4288 [math.CO], 2011.
%H A212629 F. Goebel, <a href="http://dx.doi.org/10.1016/0095-8956(80)90049-0">On a 1-1-correspondence between rooted trees and natural numbers</a>, J. Combin. Theory, B 29 (1980), 141-143.
%H A212629 I. Gutman and A. Ivic, <a href="http://dx.doi.org/10.1016/0012-365X(95)00182-V">On Matula numbers</a>, Discrete Math., 150, 1996, 131-142.
%H A212629 I. Gutman and Yeong-Nan Yeh, <a href="http://www.emis.de/journals/PIMB/067/3.html">Deducing properties of trees from their Matula numbers</a>, Publ. Inst. Math., 53 (67), 1993, 17-22.
%H A212629 D. W. Matula, <a href="http://www.jstor.org/stable/2027327">A natural rooted tree enumeration by prime factorization</a>, SIAM Rev. 10 (1968) 273.
%H A212629 H. S. Wilf, <a href="https://www.math.upenn.edu/~wilf/website/Maximal%20independent%20sets%20in%20a%20tree.pdf">The number of maximal independent sets in a tree</a>, SIAM J. Alg. Disc. Math., 7, 1986, 125-130.
%H A212629 <a href="/index/Mat#matula">Index entries for sequences related to Matula-Goebel numbers</a>
%F A212629 a(n) = Sum(k*A212627(n,k), k>=1).
%e A212629 a(11)=9 because the rooted tree with Matula-Goebel number 11 is the path tree on 5 vertices R - A - B - C - D; the maximal independent vertex subsets are {R,C}, {A,C}, {A,D}, and {R,B,D}.
%p A212629 with(numtheory): P := proc (n) local r, s, A, B, C: r := n-> op(1, factorset(n)): s := n-> n/r(n): A := proc (n) if n = 1 then x elif bigomega(n) = 1 then x*(B(pi(n))+C(pi(n))) else A(r(n))*A(s(n))/x end if end proc: B := proc (n) if n = 1 then 0 elif bigomega(n) = 1 then A(pi(n)) else sort(expand(B(r(n))*B(s(n))+B(r(n))*C(s(n))+B(s(n))*C(r(n)))) end if end proc: C := proc (n) if n = 1 then 1 elif bigomega(n) = 1 then B(pi(n)) else expand(C(r(n))*C(s(n))) end if end proc: if n = 1 then x else sort(expand(A(n)+B(n))) end if end proc: seq(subs(x = 1, diff(P(n), x)), n = 1 .. 120);
%t A212629 r[n_] := FactorInteger[n][[1, 1]];
%t A212629 s[n_] := n/r[n];
%t A212629 A[n_] := Which[n == 1, x, PrimeOmega[n] == 1, x*(B[PrimePi[n]] + c[PrimePi[n]]), True, A[r[n]]*A[s[n]]/x];
%t A212629 B[n_] := Which[n == 1, 0, PrimeOmega[n] == 1, A[PrimePi[n]], True, B[r[n]]*B[s[n]] + B[r[n]]*c[s[n]] + B[s[n]]*c[r[n]]];
%t A212629 c[n_] := Which[n == 1, 1, PrimeOmega[n] == 1, B[PrimePi[n]], True, c[r[n]]*c[s[n]]];
%t A212629 P[n_] := A[n] + B[n];
%t A212629 a[n_] := D[P[n], x] /. x -> 1;
%t A212629 Table[a[n], {n, 1, 120}] (* _Jean-François Alcover_, Jun 20 2024, after Maple code *)
%Y A212629 Cf. A206499, A212627, A212618-A212632.
%K A212629 nonn
%O A212629 1,2
%A A212629 _Emeric Deutsch_, Jun 08 2012
%E A212629 Sequences A212618-A212632 edited by M. Marcus and _M. F. Hasler_, Jan 06 2013