A317713 -id:A317713 - cp's OEIS frontend

A324971 Number of rooted identity trees with n vertices whose non-leaf terminal subtrees are not all different.

0, 0, 0, 0, 0, 1, 4, 12, 31, 79, 192, 459, 1082, 2537, 5922, 13816, 32222, 75254, 176034, 412667, 969531, 2283278

Offset: 1

Gus Wiseman, Mar 21 2019

A rooted identity tree is an unlabeled rooted tree with no repeated branches directly under the same root.

			The a(6) = 1 through a(8) = 12 trees:
  ((o)((o)))  ((o)(o(o)))   (o(o)(o(o)))
              (o(o)((o)))   (((o))(o(o)))
              (((o)((o))))  (((o)(o(o))))
              ((o)(((o))))  ((o)((o(o))))
                            ((o)(o((o))))
                            ((o(o)((o))))
                            (o((o)((o))))
                            (o(o)(((o))))
                            ((((o)((o)))))
                            (((o))(((o))))
                            (((o)(((o)))))
                            ((o)((((o)))))

The Matula-Goebel numbers of these trees are given by A324970.

Cf. A000081, A004111, A290689, A317713, A324850, A324922, A324923, A324924, A324931, A324935, A324936, A324979.

rits[n_]:=Join@@Table[Select[Union[Sort/@Tuples[rits/@ptn]],UnsameQ@@#&],{ptn,IntegerPartitions[n-1]}];
Table[Length[Select[rits[n],!UnsameQ@@Cases[#,{},{0,Infinity}]&]],{n,10}]

A324978 Matula-Goebel numbers of rooted trees that are not identity trees but whose non-leaf terminal subtrees are all different.

Original entry on oeis.org

4, 7, 8, 12, 14, 16, 17, 19, 20, 21, 24, 28, 32, 34, 35, 37, 38, 40, 42, 43, 44, 48, 51, 52, 53, 56, 57, 59, 64, 67, 68, 70, 71, 73, 74, 76, 77, 80, 84, 85, 86, 88, 89, 91, 95, 96, 102, 104, 106, 107, 112, 114, 116, 118, 124, 128, 129, 131, 133, 134, 136, 139

Offset: 1

Gus Wiseman, Mar 21 2019

nonn

An unlabeled rooted tree is an identity tree if there are no repeated branches directly under the same root.

			The sequence of trees together with the Matula-Goebel numbers begins:
   4: (oo)
   7: ((oo))
   8: (ooo)
  12: (oo(o))
  14: (o(oo))
  16: (oooo)
  17: (((oo)))
  19: ((ooo))
  20: (oo((o)))
  21: ((o)(oo))
  24: (ooo(o))
  28: (oo(oo))
  32: (ooooo)
  34: (o((oo)))
  35: (((o))(oo))
  37: ((oo(o)))
  38: (o(ooo))
  40: (ooo((o)))
  42: (o(o)(oo))
  43: ((o(oo)))

Gus Wiseman, The first 36 trees together with their Matula-Goebel numbers.

Cf. A000081, A004111, A007097, A196050, A276625, A317713, A324850, A324923, A324935, A324936, A324968, A324969, A324970, A324971, A324979.

mgtree[n_]:=If[n==1,{},mgtree/@Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
Select[Range[100],And[!And@@Cases[mgtree[#],q:{}:>UnsameQ@@q,{0,Infinity}],UnsameQ@@Cases[mgtree[#],{},{0,Infinity}]]&]

Complement of A276625 in A324935.

A325543 Width (number of leaves) of the rooted tree with Matula-Goebel number n!.

Original entry on oeis.org

1, 1, 1, 2, 4, 5, 7, 9, 12, 14, 16, 17, 20, 22, 25, 27, 31, 33, 36, 39, 42, 45, 47, 49, 53, 55, 58, 61, 65, 67, 70, 71, 76, 78, 81, 84, 88, 91, 95, 98, 102, 104, 108, 111, 114, 117, 120, 122, 127, 131, 134, 137, 141, 145, 149, 151, 156, 160, 163, 165, 169, 172

Offset: 0

Gus Wiseman, May 09 2019

nonn

Also the multiplicity of q(1) in the factorization of n! into factors q(i) = prime(i)/i. For example, the factorization of 7! is q(1)^9 * q(2)^3 * q(3) * q(4), so a(7) = 9.

			Matula-Goebel trees of the first 9 factorial numbers are:
  0!: o
  1!: o
  2!: (o)
  3!: (o(o))
  4!: (ooo(o))
  5!: (ooo(o)((o)))
  6!: (oooo(o)(o)((o)))
  7!: (oooo(o)(o)((o))(oo))
  8!: (ooooooo(o)(o)((o))(oo))
The number of leaves is the number of o's, which are (1, 1, 1, 2, 4, 5, 7, 9, 12, ...), as required.

Cf. A000081, A001222, A056239, A324922, A324923, A324924.
Matula-Goebel numbers: A007097, A061775, A109082, A109129, A196050, A317713.
Factorial numbers: A000142, A011371, A022559, A071626, A076934, A115627, A325272, A325273, A325276, A325508, A325544.

mglv[n_]:=If[n==1,1,Total[Cases[FactorInteger[n],{p_,k_}:>mglv[PrimePi[p]]*k]]];
Table[mglv[n!],{n,0,100}]

For n > 1, a(n) = - 1 + Sum_{k = 1..n} A109129(k).

A325661 q-powerful numbers. Numbers whose factorization into factors prime(i)/i has no factor of multiplicity 1.

Original entry on oeis.org

1, 4, 8, 9, 16, 18, 25, 27, 32, 36, 49, 50, 54, 64, 72, 75, 81, 98, 100, 108, 121, 125, 128, 144, 150, 162, 169, 196, 200, 216, 225, 242, 243, 250, 256, 288, 289, 300, 324, 338, 343, 361, 363, 375, 392, 400, 432, 441, 450, 484, 486, 500, 507, 512, 529, 576

Offset: 1

Gus Wiseman, May 13 2019

nonn

First differs from A070003 in having 1 and lacking 147.
Every positive integer has a unique q-factorization (encoded by A324924) into factors q(i) = prime(i)/i, i > 0. For example:
   11 = q(1) q(2) q(3) q(5)
   50 = q(1)^3 q(2)^2 q(3)^2
  360 = q(1)^6 q(2)^3 q(3)
Also Matula-Goebel numbers of rooted trees with no terminal subtree appearing at only one place in the tree.

			The sequence of terms together with their q-signatures begins:
    1: {}
    4: {2}
    8: {3}
    9: {2,2}
   16: {4}
   18: {3,2}
   25: {2,2,2}
   27: {3,3}
   32: {5}
   36: {4,2}
   49: {4,2}
   50: {3,2,2}
   54: {4,3}
   64: {6}
   72: {5,2}
   75: {3,3,2}
   81: {4,4}
   98: {5,2}
  100: {4,2,2}

Charlie Neder, Table of n, a(n) for n = 1..1071 (Terms <= 100000)

Cf. A001222, A001221, A001694, A056239, A112798, A124010.
Matula-Goebel numbers: A007097, A061775, A109129, A196050, A317713.
q-factorization: A324922, A324923, A324924, A325615, A325660.

difac[n_]:=If[n==1,{},With[{i=PrimePi[FactorInteger[n][[1,1]]]},Sort[Prepend[difac[n*i/Prime[i]],i]]]];
Select[Range[100],Count[Length/@Split[difac[#]],1]==0&]

A318046 a(n) is the number of initial subtrees (subtrees emanating from the root) of the unlabeled rooted tree with Matula-Goebel number n.

Original entry on oeis.org

1, 2, 3, 2, 4, 3, 3, 2, 5, 4, 5, 3, 4, 3, 7, 2, 4, 5, 3, 4, 5, 5, 6, 3, 10, 4, 9, 3, 5, 7, 6, 2, 9, 4, 7, 5, 4, 3, 7, 4, 5, 5, 4, 5, 13, 6, 8, 3, 5, 10, 7, 4, 3, 9, 13, 3, 5, 5, 5, 7, 6, 6, 9, 2, 10, 9, 4, 4, 11, 7, 5, 5, 6, 4, 19, 3, 9, 7, 6, 4, 17, 5, 7, 5

Offset: 1

Gus Wiseman, Aug 13 2018

nonn

We require that an initial subtree contain either all or none of the branchings under any given node.

			70 is the Matula-Goebel number of the tree (o((o))(oo)), which has 7 distinct initial subtrees: {o, (ooo), (oo(oo)), (o(o)o), (o(o)(oo)), (o((o))o), (o((o))(oo))}. So a(70) = 7.

Index entries for sequences related to Matula-Goebel numbers

Cf. A000081, A007097, A007853, A049076, A061773, A061775, A076146, A109082, A109129, A206491, A303431, A316476, A317713.

si[n_]:=If[n==1,1,1+Product[si[PrimePi[b[[1]]]]^b[[2]],{b,FactorInteger[n]}]];
Array[si,100]

a(1) = 1 and if n > 1 has prime factorization n = prime(x_1)^y_1 * ... * prime(x_k)^y_k then a(n) = 1 + a(x_1)^y_1 * ... * a(x_k)^y_k.

A324933 Denominator in the division of n by the product of prime indices of n.

Original entry on oeis.org

1, 1, 2, 1, 3, 1, 4, 1, 4, 3, 5, 1, 6, 2, 2, 1, 7, 2, 8, 3, 8, 5, 9, 1, 9, 3, 8, 1, 10, 1, 11, 1, 10, 7, 12, 1, 12, 4, 4, 3, 13, 4, 14, 5, 4, 9, 15, 1, 16, 9, 14, 3, 16, 4, 3, 1, 16, 5, 17, 1, 18, 11, 16, 1, 18, 5, 19, 7, 6, 6, 20, 1, 21, 6, 6, 2, 20, 2, 22, 3

Offset: 1

Gus Wiseman, Mar 21 2019

A prime index of n is a number m such that prime(m) divides n. The multiset of prime indices of n is row n of A112798.

			The sequence of quotients n/A003963(n) begins: 1, 2, 3/2, 4, 5/3, 3, 7/4, 8, 9/4, 10/3, 11/5, 6, 13/6, 7/2, 5/2, 16, ...

Amiram Eldar, Table of n, a(n) for n = 1..10000

The numerators are A324932.

Cf. A003963, A109129, A120383, A196050, A317713, A324846, A324849, A324850, A324922, A324923, A324924, A324925, A324931, A324934.

Table[n/Times@@Cases[If[n==1,{},FactorInteger[n]],{p_,k_}:>PrimePi[p]^k],{n,100}]//Denominator

A325544 Number of nodes in the rooted tree with Matula-Goebel number n!.

Original entry on oeis.org

1, 1, 2, 4, 6, 9, 12, 15, 18, 22, 26, 30, 34, 38, 42, 47, 51, 55, 60, 64, 69, 74, 79, 84, 89, 95, 100, 106, 111, 116, 122, 127, 132, 138, 143, 149, 155, 160, 165, 171, 177, 182, 188, 193, 199, 206, 212, 218, 224, 230, 237, 243, 249, 254, 261, 268, 274, 280

Offset: 0

Gus Wiseman, May 09 2019

nonn

Also one plus the number of factors in the factorization of n! into factors q(i) = prime(i)/i. For example, the q-factorization of 7! is 7! = q(1)^9 * q(2)^3 * q(3) * q(4), with 14 = a(7) - 1 factors.

			Matula-Goebel trees of the first 9 factorial number are:
  0!: o
  1!: o
  2!: (o)
  3!: (o(o))
  4!: (ooo(o))
  5!: (ooo(o)((o)))
  6!: (oooo(o)(o)((o)))
  7!: (oooo(o)(o)((o))(oo))
  8!: (ooooooo(o)(o)((o))(oo))
The number of nodes is the number of o's plus the number of brackets, giving {1,1,2,4,6,9,12,15,18}, as required.

Cf. A000081, A001222, A056239, A324922, A324923, A324924.
Matula-Goebel numbers: A007097, A061775, A109082, A109129, A196050, A317713.
Factorial numbers: A000142, A011371, A022559, A071626, A076934, A115627, A325272, A325273, A325276, A325508, A325543.

mgwt[n_]:=If[n==1,1,1+Total[Cases[FactorInteger[n],{p_,k_}:>mgwt[PrimePi[p]]*k]]];
Table[mgwt[n!],{n,0,100}]

For n > 1, a(n) = 1 - n + Sum_{k = 1..n} A061775(k).

A325613 Full q-signature of n. Irregular triangle read by rows where T(n,k) is the multiplicity of q(k) in the q-factorization of n.

Original entry on oeis.org

1, 1, 1, 2, 1, 1, 1, 2, 1, 2, 0, 0, 1, 3, 2, 2, 2, 1, 1, 1, 1, 1, 0, 1, 3, 1, 2, 1, 0, 0, 0, 1, 3, 0, 0, 1, 2, 2, 1, 4, 2, 0, 0, 1, 0, 0, 1, 3, 2, 3, 0, 0, 0, 0, 0, 0, 1, 3, 1, 1, 3, 1, 0, 1, 2, 1, 1, 0, 1, 2, 2, 0, 0, 0, 0, 0, 0, 1, 4, 1, 2, 2, 2, 3, 1, 0, 0

Offset: 1

Gus Wiseman, May 12 2019

Every positive integer has a unique q-factorization (encoded by A324924) into factors q(i) = prime(i)/i, i > 0. For example:
   11 = q(1) q(2) q(3) q(5)
   50 = q(1)^3 q(2)^2 q(3)^2
  360 = q(1)^6 q(2)^3 q(3)
Also the number of terminal subtrees with Matula-Goebel number k of the rooted tree with Matula-Goebel number n.

			Triangle begins:
  {}
  1
  1 1
  2
  1 1 1
  2 1
  2 0 0 1
  3
  2 2
  2 1 1
  1 1 1 0 1
  3 1
  2 1 0 0 0 1
  3 0 0 1
  2 2 1
  4
  2 0 0 1 0 0 1
  3 2
  3 0 0 0 0 0 0 1
  3 1 1

Row lengths are A061395.
Row sums are A196050.
Row-maxima are A109129.
The number whose full prime signature is the n-th row is A324922(n).
Cf. A067255.
Matula-Goebel numbers: A007097, A061775, A109082, A317713.
q-factorization: A324923, A324924, A325613, A325614, A325615, A325660.

difac[n_]:=If[n==1,{},With[{i=PrimePi[FactorInteger[n][[1,1]]]},Sort[Prepend[difac[n*i/Prime[i]],i]]]];
qsig[n_]:=If[n==1,{},With[{ms=difac[n]},Table[Count[ms,i],{i,Max@@ms}]]];
Table[qsig[n],{n,30}]

A325609 Unsorted q-signature of n!. Irregular triangle read by rows where T(n,k) is the multiplicity of q(k) in the factorization of n! into factors q(i) = prime(i)/i.

Original entry on oeis.org

1, 2, 1, 4, 1, 5, 2, 1, 7, 3, 1, 9, 3, 1, 1, 12, 3, 1, 1, 14, 5, 1, 1, 16, 6, 2, 1, 17, 7, 3, 1, 1, 20, 8, 3, 1, 1, 22, 9, 3, 1, 1, 1, 25, 9, 3, 2, 1, 1, 27, 11, 4, 2, 1, 1, 31, 11, 4, 2, 1, 1, 33, 11, 4, 3, 1, 1, 1, 36, 13, 4, 3, 1, 1, 1, 39, 13, 4, 3, 1, 1, 1, 1

Offset: 1

Gus Wiseman, May 12 2019

Every positive integer has a unique q-factorization (encoded by A324924) into factors q(i) = prime(i)/i, i > 0. For example:
   11 = q(1) q(2) q(3) q(5)
   50 = q(1)^3 q(2)^2 q(3)^2
  360 = q(1)^6 q(2)^3 q(3)
Row n is the sequence of nonzero exponents in the q-factorization of n!.
Also the number of terminal subtrees with Matula-Goebel number k of the rooted tree with Matula-Goebel number n!.

			We have 10! = q(1)^16 q(2)^6 q(3)^2 q(4), so row n = 10 is (16,6,2,1).
Triangle begins:
  {}
   1
   2  1
   4  1
   5  2  1
   7  3  1
   9  3  1  1
  12  3  1  1
  14  5  1  1
  16  6  2  1
  17  7  3  1  1
  20  8  3  1  1
  22  9  3  1  1  1
  25  9  3  2  1  1
  27 11  4  2  1  1
  31 11  4  2  1  1
  33 11  4  3  1  1  1
  36 13  4  3  1  1  1
  39 13  4  3  1  1  1  1
  42 14  5  3  1  1  1  1

Row lengths are A000720.
Row sums are A325544(n) - 1.
Column k = 1 is A325543.
Cf. A056239, A067255, A112798, A118914, A124010.
Matula-Goebel numbers: A007097, A061775, A109129, A196050, A317713, A324935.
Factorial numbers: A000142, A011371, A022559, A071626, A115627, A325276.
q-factorization: A324922, A324923, A324924, A325614, A325615, A325660.

difac[n_]:=If[n==1,{},With[{i=PrimePi[FactorInteger[n][[1,1]]]},Sort[Prepend[difac[n*i/Prime[i]],i]]]];
Table[Length/@Split[difac[n!]],{n,20}]

A354322 Irregular triangle read by rows where row n lists the distinct Matula-Goebel numbers of terminal subtrees occurring in the tree with Matula-Goebel number n.

Original entry on oeis.org

1, 1, 2, 1, 2, 3, 1, 4, 1, 2, 3, 5, 1, 2, 6, 1, 4, 7, 1, 8, 1, 2, 9, 1, 2, 3, 10, 1, 2, 3, 5, 11, 1, 2, 12, 1, 2, 6, 13, 1, 4, 14, 1, 2, 3, 15, 1, 16, 1, 4, 7, 17, 1, 2, 18, 1, 8, 19, 1, 2, 3, 20, 1, 2, 4, 21, 1, 2, 3, 5, 22, 1, 2, 9, 23, 1, 2, 24, 1, 2, 3, 25

Offset: 1

Kevin Ryde, Jun 08 2022

A terminal subtree is a vertex and all its descendents.
Row n has length A317713(n).
Row n begins with 1 which is a singleton (single childless vertex), and ends with n itself which is the whole tree.
The second-last term in row n >= 1 is the largest (by tree number) child subtree of the root, which is A061395(n).
A factor of 2 in a tree number is a singleton child, and tree number 2^c is a vertex with c singleton children and no other children.
The second term in each row is T(n,2) = 2^c for the subtree with the fewest singleton children and no other children.
A rooted star is n = 2^c and these are the only rows of length 2.
A path of k vertices down is the prime-th recurrence n = A007097(k-1) and its subtrees are row(n) = A007097(0 .. k-1).

			Triangle begins:
      k=1  2  3  4
  n=1:  1,
  n=2:  1, 2,
  n=3:  1, 2, 3,
  n=4:  1, 4,
  n=5:  1, 2, 3, 5,
  n=6:  1, 2, 6,
  n=7:  1, 4, 7,
For n=78, tree 78 and its subtree numbers are
      78
    / | \
   1  2  6      distinct tree numbers
      |  | \    row(78) = {1, 2, 6, 78}
      1  1  2
            |
            1

Kevin Ryde, PARI/GP Code
Index entries for sequences related to Matula-Goebel numbers

Cf. A317713 (row lengths), A061395 (second last each row).

Cf. A007097 (path).

PARI
```
\\ See links.
```

row(n) = union of row(primepi(p)) for each p a prime factor of n, followed by n itself.

cp's OEIS Frontend

A324971 Number of rooted identity trees with n vertices whose non-leaf terminal subtrees are not all different.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A324978 Matula-Goebel numbers of rooted trees that are not identity trees but whose non-leaf terminal subtrees are all different.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

A325543 Width (number of leaves) of the rooted tree with Matula-Goebel number n!.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

A325661 q-powerful numbers. Numbers whose factorization into factors prime(i)/i has no factor of multiplicity 1.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A318046 a(n) is the number of initial subtrees (subtrees emanating from the root) of the unlabeled rooted tree with Matula-Goebel number n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

A324933 Denominator in the division of n by the product of prime indices of n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A325544 Number of nodes in the rooted tree with Matula-Goebel number n!.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

A325613 Full q-signature of n. Irregular triangle read by rows where T(n,k) is the multiplicity of q(k) in the q-factorization of n.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs