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 A317787 #10 Sep 17 2018 03:16:52 %S A317787 1,1,2,4,8,18,40,95,227,557,1382,3485,8865,22790,59022,153972,404066, %T A317787 1066236,2826885,7527411,20121154 %N A317787 Number of locally nonintersecting rooted trees with n nodes. %C A317787 An unlabeled rooted tree is locally nonintersecting if there is no common subbranch to all branches directly under any given node. %e A317787 The a(6) = 18 locally nonintersecting rooted trees: %e A317787 (((((o))))) %e A317787 ((((oo)))) %e A317787 (((o(o)))) %e A317787 ((o((o)))) %e A317787 (o(((o)))) %e A317787 ((o)((o))) %e A317787 (((ooo))) %e A317787 ((o(oo))) %e A317787 ((oo(o))) %e A317787 (o((oo))) %e A317787 (o(o(o))) %e A317787 (oo((o))) %e A317787 (o(o)(o)) %e A317787 ((oooo)) %e A317787 (o(ooo)) %e A317787 (oo(oo)) %e A317787 (ooo(o)) %e A317787 (ooooo) %e A317787 Missing from this list are (((o)(o))) and ((o)(oo)). %t A317787 rurt[n_]:=If[n==1,{{}},Join@@Table[Select[Union[Sort/@Tuples[rurt/@ptn]],Or[Length[#]==1,Intersection@@#=={}]&],{ptn,IntegerPartitions[n-1]}]]; %t A317787 Table[Length[rurt[n]],{n,10}] %Y A317787 Cf. A000081, A276625, A301700, A316473, A316475, A316501, A316502, A317708, A317785, A317789. %K A317787 nonn,more %O A317787 1,3 %A A317787 _Gus Wiseman_, Aug 07 2018 %E A317787 a(16)-a(21) from _Robert Price_, Sep 16 2018