OFFSET
1,2
COMMENTS
First differs from A331871 in lacking 1589.
Lone-child-avoiding means there are no unary branchings.
The Matula-Goebel number of a rooted tree is the product of primes indexed by the Matula-Goebel numbers of the branches of its root, which gives a bijective correspondence between positive integers and unlabeled rooted trees.
LINKS
EXAMPLE
The sequence of rooted trees together with their Matula-Goebel numbers begins:
1: o
4: (oo)
8: (ooo)
14: (o(oo))
16: (oooo)
28: (oo(oo))
32: (ooooo)
38: (o(ooo))
49: ((oo)(oo))
56: (ooo(oo))
64: (oooooo)
76: (oo(ooo))
86: (o(o(oo)))
98: (o(oo)(oo))
106: (o(oooo))
112: (oooo(oo))
128: (ooooooo)
152: (ooo(ooo))
172: (oo(o(oo)))
196: (oo(oo)(oo))
MATHEMATICA
primeMS[n_]:=If[n==1, {}, Flatten[Cases[FactorInteger[n], {p_, k_}:>Table[PrimePi[p], {k}]]]]
hmakQ[n_]:=And[!PrimeQ[n], SameQ@@DeleteCases[primeMS[n], 1], And@@hmakQ/@primeMS[n]]; Select[Range[1000], hmakQ[#]&]
CROSSREFS
The same-tree version is A291441.
Not requiring lone-child-avoidance gives A320230.
The enumeration of these trees by vertices is A320268.
The semi-lone-child-avoiding version is A331936.
If the non-leaf branches are all different instead of equal we get A331965.
The fully-achiral case is A331967.
Achiral rooted trees are counted by A003238.
MG-numbers of lone-child-avoiding rooted trees are A291636.
KEYWORD
nonn
AUTHOR
Gus Wiseman, Oct 08 2018
EXTENSIONS
Updated with corrected terminology by Gus Wiseman, Feb 06 2020
STATUS
approved