login
A358580
Difference between the number of leaves and the number of internal (non-leaf) nodes in the rooted tree with Matula-Goebel number n.
19
1, 0, -1, 1, -2, 0, 0, 2, -1, -1, -3, 1, -1, 1, -2, 3, -1, 0, 1, 0, 0, -2, -2, 2, -3, 0, -1, 2, -2, -1, -4, 4, -3, 0, -1, 1, 0, 2, -1, 1, -2, 1, 0, -1, -2, -1, -3, 3, 1, -2, -1, 1, 2, 0, -4, 3, 1, -1, -2, 0, -1, -3, 0, 5, -2, -2, 0, 1, -2, 0, -1, 2, -1, 1, -3
OFFSET
1,5
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.
FORMULA
a(n) = A109129(n) - A342507(n).
EXAMPLE
The Matula-Goebel number of ((ooo(o))) is 89, and it has 4 leaves and 3 internal nodes, so a(89) = 1.
MATHEMATICA
MGTree[n_]:=If[n==1, {}, MGTree/@Flatten[Cases[FactorInteger[n], {p_, k_}:>Table[PrimePi[p], {k}]]]];
Table[Count[MGTree[n], {}, {0, Infinity}]-Count[MGTree[n], _[__], {0, Infinity}], {n, 100}]
CROSSREFS
Zeros are A358578, counted by A185650 (ordered A358579).
Positions of positive terms are counted by A358581, negative A358582.
Positions of nonnegative terms are counted by A358583, nonpositive A358584.
A000081 counts rooted trees, ordered A000108.
A034781 counts trees by nodes and height.
A055277 counts trees by nodes and leaves, ordered A001263.
Sequence in context: A280912 A332662 A364036 * A029303 A361163 A361500
KEYWORD
sign
AUTHOR
Gus Wiseman, Nov 25 2022
STATUS
approved