OFFSET
1,1
COMMENTS
Each positive integer n corresponds to a unique rooted tree via the Matula-Goebel correspondence.
If an integer k belongs to the sequence, the prime number with index k is also a member of the sequence.
LINKS
Michel Marcus, Table of n, a(n) for n = 1..311
Zizhen Chen, Matula number generator.
Sean A. Irvine, Java program (github)
Dominique Manchon, Une remarque sur l'arborification de Matula, arXiv:2602.03150 [math.NT], 2026, see p. 6.
Dominique Manchon, Une remarque sur l'arborification de Matula, hal-05493935, 2026, see p. 6.
D. W. Matula, A natural rooted tree enumeration by prime factorization, SIAM Rev. vol. 10, 1968, p. 273.
EXAMPLE
a(1) = 4 = 2*2, the Matula-Goebel number of the V-shaped tree [..] with three vertices and one root.
a(2) = 6 = 2*3 = 2*prime(2), the Matula-Goebel number of the four-vertex rooted tree[[.].] obtained by grafting the forest [.]. on a common root.
a(3) = 7 = prime(4), the Matula-Goebel number of the Y-shaped tree [[..]].
a(17) = 59 = prime^3(4), the Matula-Goebel number of the tall Y-shaped tree [[[[..]]]].
PROG
(PARI) lista(nn) = my(list1 = List(), k=1); while(k<nn, k = prime(k); if (k<nn, listput(list1, k))); my(s = select(x->(x<nn), setbinop((x, y)->x*y, Vec(list1))), list = List()); while(#s, for (i=1, #s, listput(list, s[i])); s = select(x->(x<nn), apply(prime, s)); ); Vec(vecsort(list)); \\ Michel Marcus, Mar 13 2026
CROSSREFS
KEYWORD
nonn
AUTHOR
Dominique Manchon, Feb 22 2026
STATUS
approved
