A235120 -id:A235120 - cp's OEIS frontend

A057452 Prime recurrence: a(1)=8, a(n+1) = a(n)-th prime.

8, 19, 67, 331, 2221, 19577, 219613, 3042161, 50728129, 997525853, 22742734291, 592821132889, 17461204521323, 575411103069067, 21034688742654437, 846729487306354343

Offset: 1

Robert G. Wilson v, Sep 26 2000

Lubomir Alexandrov informs me that he studied this sequence in his 1965 notebook. - N. J. A. Sloane, May 23 2008

a(n) = the Matula number of the rooted tree Q(n) obtained by attaching 3 pendant edges at one of the endpoints of the path-tree P(n) (on n vertices); the root is the other endpoint. - Emeric Deutsch, Jan 18 2014

Lubomir Alexandrov, Prime Number Sequences And Matrices Generated By Counting Arithmetic Functions, Communications of the Joint Institute of Nuclear Research, E5-2002-55, Dubna, 2002.
E. Deutsch, Tree statistics from Matula numbers, arXiv preprint arXiv:1111.4288 [math.CO], 2011.
E. Deutsch, Rooted tree statistics from Matula numbers, Discrete Appl. Math., 160, 2012, 2314-2322.
F. Goebel, On a 1-1-correspondence between rooted trees and natural numbers, J. Combin. Theory, B 29 (1980), 141-143.
I. Gutman and A. Ivic, On Matula numbers, Discrete Math., 150, 1996, 131-142.
I. Gutman and Yeong-Nan Yeh, Deducing properties of trees from their Matula numbers, Publ. Inst. Math., 53 (67), 1993, 17-22.
D. Matula, A natural rooted tree enumeration by prime factorization, SIAM Rev. 10 (1968) 273.

Cf. A007097, A235120. Apart from initial terms, probably same as A005518.

a := proc (n) option remember: if n = 1 then 8 else ithprime(a(n-1)) end if end proc: seq(a(n), n = 1 .. 9); # Emeric Deutsch, Jan 18 2014

Mathematica
```
NestList[ Prime, 8, 12 ]
```

More references and links from Emeric Deutsch, Jan 18 2014

a(14)-a(16) from Robert G. Wilson v, Mar 07 2017 using Kim Walisch's primecount

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

Emeric Deutsch, Jan 03 2014

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.

			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.

E. Deutsch, Tree statistics from Matula numbers, arXiv preprint arXiv:1111.4288, 2011.
E. Deutsch, Rooted tree statistics from Matula numbers, Discrete Appl. Math., 160, 2012, 2314-2322.
F. Goebel, On a 1-1-correspondence between rooted trees and natural numbers, J. Combin. Theory, B 29 (1980), 141-143.
I. Gutman and A. Ivic, On Matula numbers, Discrete Math., 150, 1996, 131-142.
I. Gutman and Yeong-Nan Yeh, Deducing properties of trees from their Matula numbers, Publ. Inst. Math., 53 (67), 1993, 17-22.
I. Gutman, W. Linert, I. Lukovits, and Z. Tomovic, The multiplicative version of the Wiener index, J. Chem. Inf. Comput. Sci., 40, 2000, 113-116.
I. Gutman, W. Linert, I. Lukovits, and Z. Tomovic, On the multiplicative Wiener index and its possible chemical applications, Monatshefte f. Chemie, 131, 2000, 421-427.
D. W. Matula, A natural rooted tree enumeration by prime factorization, SIAM Rev. 10 (1968) 273.
Index entries for sequences related to Matula-Goebel numbers

Cf. A235111, A005518.

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

a(13) from Emeric Deutsch, Feb 16 2014

a(14) from Emeric Deutsch, Mar 12 2014

cp's OEIS Frontend

A057452 Prime recurrence: a(1)=8, a(n+1) = a(n)-th prime.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Maple

Mathematica

Extensions