|
|
A358577
|
|
Matula-Goebel numbers of "square" rooted trees, i.e., whose height equals their number of leaves.
|
|
25
|
|
|
1, 4, 12, 14, 18, 19, 21, 27, 40, 52, 60, 68, 70, 74, 78, 86, 89, 90, 91, 92, 95, 100, 102, 105, 107, 111, 117, 119, 122, 129, 130, 134, 135, 138, 146, 150, 151, 153, 161, 163, 169, 170, 175, 176, 181, 183, 185, 195, 201, 206, 207, 215, 219, 221, 225, 227, 230
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
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
|
|
|
FORMULA
|
|
|
EXAMPLE
|
The terms together with their corresponding rooted trees begin:
1: o
4: (oo)
12: (oo(o))
14: (o(oo))
18: (o(o)(o))
19: ((ooo))
21: ((o)(oo))
27: ((o)(o)(o))
40: (ooo((o)))
52: (oo(o(o)))
60: (oo(o)((o)))
68: (oo((oo)))
70: (o((o))(oo))
74: (o(oo(o)))
78: (o(o)(o(o)))
86: (o(o(oo)))
89: ((ooo(o)))
90: (o(o)(o)((o)))
|
|
MATHEMATICA
|
MGTree[n_]:=If[n==1, {}, MGTree/@Flatten[Cases[FactorInteger[n], {p_, k_}:>Table[PrimePi[p], {k}]]]];
Select[Range[100], Count[MGTree[#], {}, {0, Infinity}]==Depth[MGTree[#]]-1&]
|
|
CROSSREFS
|
A034781 counts trees by nodes and height.
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|