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”).

A317718
Number of uniform relatively prime rooted trees with n nodes.
11
1, 1, 2, 4, 7, 13, 27, 55, 125, 278, 650, 1510, 3624, 8655, 21017, 51212, 125857, 310581, 770767, 1920226
OFFSET
1,3
COMMENTS
An unlabeled rooted tree is uniform and relatively prime iff either it is a single node or a single node with a single uniform relatively prime branch, or the branches of the root have empty intersection (relatively prime) and equal multiplicities (uniform) and are themselves uniform relatively prime trees.
LINKS
A. David Christopher and M. Davamani Christober, Relatively Prime Uniform Partitions, Gen. Math. Notes, Vol. 13, No. 2, December, 2012, pp. 1-12.
EXAMPLE
The a(6) = 13 uniform relatively prime rooted trees:
(((((o)))))
((((oo))))
(((o(o))))
(((ooo)))
((o((o))))
((o(oo)))
((oooo))
(o(((o))))
(o((oo)))
(o(o(o)))
(o(ooo))
((o)((o)))
(ooooo)
MATHEMATICA
purt[n_]:=purt[n]=If[n==1, {{}}, Join@@Table[Select[Union[Sort/@Tuples[purt/@ptn]], Or[Length[#]==1, And[SameQ@@Length/@Split[#], Intersection@@#=={}]]&], {ptn, IntegerPartitions[n-1]}]];
Table[Length[purt[n]], {n, 20}]
KEYWORD
nonn,more
AUTHOR
Gus Wiseman, Aug 05 2018
STATUS
approved