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 A316471 #6 Jul 05 2018 02:30:18
%S A316471 1,1,1,2,3,6,11,21,43,89,185,391,840,1822,3975,8727,19280,42841,95661,
%T A316471 214490
%N A316471 Number of locally disjoint rooted identity trees with n nodes, meaning no branch overlaps any other branch of the same root.
%H A316471 Gus Wiseman, <a href="/A316471/a316471.png">The a(8) = 21 locally disjoint rooted identity trees.</a>
%e A316471 The a(7) = 11 locally disjoint rooted identity trees:
%e A316471 ((((((o))))))
%e A316471 ((((o(o)))))
%e A316471 (((o((o)))))
%e A316471 ((o(((o)))))
%e A316471 ((o(o(o))))
%e A316471 (((o)((o))))
%e A316471 (o((((o)))))
%e A316471 (o((o(o))))
%e A316471 (o(o((o))))
%e A316471 ((o)(((o))))
%e A316471 (o(o)((o)))
%t A316471 strut[n_]:=strut[n]=If[n===1,{{}},Select[Join@@Function[c,Union[Sort/@Tuples[strut/@c]]]/@IntegerPartitions[n-1],UnsameQ@@#&&Select[Tuples[#,2],UnsameQ@@#&&(Intersection@@#=!={})&]=={}&]];
%t A316471 Table[Length[strut[n]],{n,20}]
%Y A316471 Cf. A000081, A004111, A276625, A277098, A302696, A303362, A304713, A316467, A316471, A316473, A316474, A316494.
%K A316471 nonn,more
%O A316471 1,4
%A A316471 _Gus Wiseman_, Jul 04 2018