cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A235112 a(n) = the largest of the M-indices of the trees with n vertices.

Original entry on oeis.org

1, 2, 3, 7, 16, 32, 64, 152, 361, 1273, 4489, 22177, 109561, 735151
Offset: 1

Views

Author

Emeric Deutsch, Jan 03 2014

Keywords

Comments

We define the M-index of a tree T to be the smallest of the Matula numbers of the rooted trees isomorphic (as a tree) to T. Example. The path tree P[5] = ABCDE has M-index 9. Indeed, there are 3 rooted trees isomorphic to P[5]: rooted at A, B, and C, respectively. Their Matula numbers are 11, 10, and 9, respectively. Consequently, the M-index of P[5] is 9.
a(n) = largest (= last) entry in row n of A235111.
It is conjectured that for n>=7 one has a(n) = A235120(n-6).
These numbers can be useful, for example, in the following situation. We intend to identify all trees that have 10 vertices and satisfy a certain property. Instead of scanning all rooted trees with Matula numbers from A005517(10)=125 to A005518(10)=219613, we do the scanning only for Matula numbers between 125 and a(10)=1273.

Examples

			a(4)=7. Indeed, there are 2 trees with 4 vertices: the path P[4] and the star S[3] with 3 edges. There are two rooted trees isomorphic to P[4]; they have Matula numbers 5 and 6; so the M-index is 5. There are two rooted trees isomorphic to S[3]; they have Matula numbers 7 and 8; so the M-index is 7. Max(5,7) = 7.
		

Crossrefs

Formula

a(n) = A235111(n,A000055(n)).

Extensions

a(13) from Emeric Deutsch, Feb 16 2014
a(14) from Emeric Deutsch, Mar 12 2014