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.
%I A319271 #6 Sep 17 2018 08:34:13 %S A319271 1,1,0,1,1,3,3,9,12,27,42,91,151,312,550,1099,2026,3999,7527,14804, %T A319271 28336,55641,107737,211851,413508,814971,1600512,3162761,6241234 %N A319271 Number of series-reduced locally non-intersecting aperiodic rooted trees with n nodes. %C A319271 A rooted tree is series-reduced if every non-leaf node has at least two branches, and aperiodic if the multiplicities in the multiset of branches directly under any given node are relatively prime, and locally non-intersecting if the branches directly under any given node with more than one branch have empty intersection. %e A319271 The a(8) = 9 rooted trees: %e A319271 (o(o(o(o)))) %e A319271 (o(o(o)(o))) %e A319271 (o(ooo(o))) %e A319271 (oo(oo(o))) %e A319271 (o(o)(o(o))) %e A319271 (ooo(o(o))) %e A319271 (o(o)(o)(o)) %e A319271 (ooo(o)(o)) %e A319271 (ooooo(o)) %t A319271 btrut[n_]:=btrut[n]=If[n===1,{{}},Select[Join@@Function[c,Union[Sort/@Tuples[btrut/@c]]]/@IntegerPartitions[n-1],And[Intersection@@#=={},GCD@@Length/@Split[#]==1]&]]; %t A319271 Table[Length[btrut[n]],{n,30}] %Y A319271 Cf. A000081, A000837, A007562, A289509, A301700, A303431, A316470, A316473, A316475, A316495, A319270. %K A319271 nonn,more %O A319271 1,6 %A A319271 _Gus Wiseman_, Sep 16 2018