|
|
A317713
|
|
Number of distinct terminal subtrees of the rooted tree with Matula-Goebel number n.
|
|
36
|
|
|
1, 2, 3, 2, 4, 3, 3, 2, 3, 4, 5, 3, 4, 3, 4, 2, 4, 3, 3, 4, 4, 5, 4, 3, 4, 4, 3, 3, 5, 4, 6, 2, 5, 4, 5, 3, 4, 3, 4, 4, 5, 4, 4, 5, 4, 4, 5, 3, 3, 4, 5, 4, 3, 3, 5, 3, 4, 5, 5, 4, 4, 6, 4, 2, 5, 5, 4, 4, 4, 5, 5, 3, 5, 4, 4, 3, 6, 4, 6, 4, 3, 5, 5, 4, 6, 4, 5, 5, 4, 4, 5, 4, 6, 5, 5, 3, 5, 3, 5, 4, 5, 5, 4, 4, 5, 3, 4, 3
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
20 is the Matula-Goebel number of the tree (oo((o))), which has 4 distinct terminal subtrees: {(oo((o))), ((o)), (o), o}. So a(20) = 4.
|
|
MATHEMATICA
|
ids[n_]:=Union@@FixedPointList[Union@@(Cases[If[#==1, {}, FactorInteger[#]], {p_, _}:>PrimePi[p]]&/@#)&, {n}];
Table[Length[ids[n]], {n, 100}]
|
|
PROG
|
(PARI)
A006530(n) = if(1==n, n, my(f=factor(n)); f[#f~, 1]);
A324923(n) = { my(lista = List([]), gpf, i); while(n > 1, gpf=A006530(n); i = primepi(gpf); n /= gpf; n *= i; listput(lista, i)); #Set(lista); }; \\ Antti Karttunen, Oct 23 2023
|
|
CROSSREFS
|
Cf. A000081, A007097, A049076, A061773, A061775, A076146, A109082, A109129, A206491, A303431, A316476.
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|