OFFSET
1,2
COMMENTS
We say that a rooted tree is lone-child-avoiding if no vertex has exactly one child.
The Matula-Goebel number of a rooted tree is the product of primes indexed by the Matula-Goebel numbers of its branches. This gives a bijective correspondence between positive integers and unlabeled rooted trees.
An alternative definition: n is in the sequence iff n is 1 or the product of two or more not necessarily distinct prime numbers whose prime indices already belong to the sequence. For example, 14 is in the sequence because 14 = prime(1) * prime(4) and 1 and 4 both already belong to the sequence.
LINKS
David Callan, A sign-reversing involution to count labeled lone-child-avoiding trees, arXiv:1406.7784 [math.CO], (30-June-2014).
EXAMPLE
The sequence of all lone-child-avoiding 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)
133: ((oo)(ooo))
152: (ooo(ooo))
172: (oo(o(oo)))
MATHEMATICA
nn=2000;
primeMS[n_]:=If[n===1, {}, Flatten[Cases[FactorInteger[n], {p_, k_}:>Table[PrimePi[p], {k}]]]];
srQ[n_]:=Or[n===1, With[{m=primeMS[n]}, And[Length[m]>1, And@@srQ/@m]]];
Select[Range[nn], srQ]
CROSSREFS
These trees are counted by A001678.
The case with more than two branches is A331490.
Unlabeled rooted trees are counted by A000081.
Topologically series-reduced rooted trees are counted by A001679.
Labeled lone-child-avoiding rooted trees are counted by A060356.
Labeled lone-child-avoiding unrooted trees are counted by A108919.
MG numbers of singleton-reduced rooted trees are A330943.
MG numbers of topologically series-reduced rooted trees are A331489.
KEYWORD
nonn
AUTHOR
Gus Wiseman, Aug 28 2017
EXTENSIONS
Updated with corrected terminology by Gus Wiseman, Jan 20 2020
STATUS
approved