login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A358650
Matula-Goebel tree number of the binomial tree of n vertices.
1
1, 2, 4, 6, 12, 18, 42, 78, 156, 234, 546, 1014, 2886, 4758, 14118, 30966, 61932, 92898, 216762, 402558, 1145742, 1888926, 5604846, 12293502, 28210026, 45860646, 121727346, 249864654, 813198126, 1423166394, 4740553974, 11234495766, 22468991532, 33703487298
OFFSET
1,2
COMMENTS
The top-down definition of the binomial tree suits Matula-Goebel numbering: The tree of n = 2^k + r vertices, for 1 <= r <= 2^k is the binomial tree of 2^k vertices and a child subtree under the root which is the binomial tree of r vertices.
In the tree of n vertices, adding a new singleton child under each vertex gives the tree of 2*n vertices, so that a(2*n) = A348067(a(n)).
FORMULA
a(2^k + r) = a(2^k) * prime(a(r)) for 1 <= r <= 2^k.
a(2^k) = A076146(k+1), being a tree of order k.
EXAMPLE
The tree of n=13 vertices numbered 0..12 is
0
| \ \ \
1 2 4 8
| | \ | \ \
3 5 6 9 10 12
| |
7 11
Vertices 0..7 are the binomial tree of 2^k = 8 vertices, and vertices 8..12 are the binomial tree of 5 vertices.
Using the recurrence, a(13) = a(8 + 5) = a(8) * prime(a(5)) = 78*37 = 2886.
PROG
(PARI) \\ See links.
CROSSREFS
Sequence in context: A243543 A094769 A068018 * A357546 A294918 A347474
KEYWORD
nonn,easy,changed
AUTHOR
Kevin Ryde, Nov 25 2022
STATUS
approved