cp's OEIS Frontend

A212627 Irregular triangle read by rows: T(n,k) is the number of maximal independent vertex subsets with k vertices of the rooted tree with Matula-Goebel number n (n>=1, k>=1).

%I A212627 #31 Jun 19 2024 09:35:24
%S A212627 1,2,1,1,1,1,0,3,0,3,1,0,1,1,0,1,0,3,1,0,3,1,0,3,1,0,1,2,0,1,2,0,1,2,
%T A212627 0,1,4,1,0,0,1,0,1,2,0,0,5,1,0,0,1,0,2,1,1,0,2,1,1,0,1,4,0,0,5,0,1,0,
%U A212627 2,0,0,6,1,0,0,5,0,0,7,1,0,0,2,1,0,2,1,1,0,0,4,2,0,1,4,1,0,0,0,1,0,0,6,1,0,2,1,1,0,1,1,3,0,0,1,4,0,1,0,2,0,1,0,2,0,0,4,2,0,2,0,1,1,0,0,5,0,0,2,3,0,0,2,1,0,1,1,3,0,0,3,6
%N A212627 Irregular triangle read by rows: T(n,k) is the number of maximal independent vertex subsets with k vertices of the rooted tree with Matula-Goebel number n (n>=1, k>=1).
%C A212627 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 A212627 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 A212627 Number of entries in row n is A212625(n).
%C A212627 Sum of entries in row n = A212628(n).
%C A212627 Sum(k*T(n,k), k>=1) = A212629(n).
%H A212627 É. 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 A212627 Emeric Deutsch, <a href="http://arxiv.org/abs/1111.4288">Rooted tree statistics from Matula numbers</a>, arXiv:1111.4288 [math.CO], 2001.
%H A212627 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 A212627 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 A212627 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 A212627 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 A212627 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 A212627 <a href="/index/Mat#matula">Index entries for sequences related to Matula-Goebel numbers</a>
%F A212627 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 of the r oo ted tree with Matula-Goebel number n, with respect to number of vertices, is P(n)=P(n,x)=A(n)+B(n). The Maple program is based on these relations.
%e A212627 Row 11 is 0, 3, 1 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}, i.e. none of size 1, three of size 2, and  one of size 3.
%e A212627 Triangle starts:
%e A212627   1;
%e A212627   2;
%e A212627   1,2;
%e A212627   1,1;
%e A212627   0,3;
%e A212627   ...
%p A212627 with(numtheory): P := proc (n) local r, s, A, B, C: r := proc (n) options operator, arrow: op(1, factorset(n)) end proc: s := proc (n) options operator, arrow: n/r(n) end proc: 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: for n to 12 do seq(coeff(P(n), x, j), j = 1 .. degree(P(n))) end do; # yields sequence in triangular form
%t A212627 r[n_] := FactorInteger[n][[1, 1]];
%t A212627 s[n_] := n/r[n];
%t A212627 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 A212627 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 A212627 c[n_] := Which[n == 1, 1, PrimeOmega[n] == 1, B[PrimePi[n]], True,  c[r[n]]*c[s[n]]];
%t A212627 P[n_] := A[n] + B[n];
%t A212627 T[n_] := Rest@CoefficientList[P[n], x];
%t A212627 Table[T[n], {n, 1, 50}] // Flatten (* _Jean-François Alcover_, Jun 19 2024, after Maple code *)
%Y A212627 Cf. A212618, A212619, A212620, A212621, A212622, A212623, A212624, A212625, A212626, A212628, A212629, A212630, A212631, A212632.
%K A212627 nonn,tabf
%O A212627 1,2
%A A212627 _Emeric Deutsch_, Jun 08 2012