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 A316474 #6 Jul 05 2018 02:30:32
%S A316474 1,1,1,1,1,2,3,5,8,14,23,42,73,133,241,442,812,1508,2802,5247,9842,
%T A316474 18554,35045,66453,126249
%N A316474 Number of locally stable rooted identity trees with n nodes, meaning no branch is a subset of any other branch of the same root.
%H A316474 Gus Wiseman, <a href="/A316474/a316474.png">The a(10) = 14 locally stable rooted identity trees with 10 nodes.</a>
%e A316474 The a(9) = 8 locally stable rooted identity trees:
%e A316474 ((((((((o))))))))
%e A316474 (((((o)((o))))))
%e A316474 ((((o)(((o))))))
%e A316474 (((o)((((o))))))
%e A316474 ((((o))(((o)))))
%e A316474 ((o)(((((o))))))
%e A316474 ((o)((o)((o))))
%e A316474 (((o))((((o)))))
%t A316474 strut[n_]:=strut[n]=If[n===1,{{}},Select[Join@@Function[c,Union[Sort/@Tuples[strut/@c]]]/@IntegerPartitions[n-1],UnsameQ@@#&&Select[Tuples[#,2],UnsameQ@@#&&Complement@@#=={}&]=={}&]];
%t A316474 Table[Length[strut[n]],{n,20}]
%Y A316474 Cf. A000081, A004111, A276625, A277098, A285572, A285573, A303362, A304713, A316467, A316471, A316471, A316475.
%K A316474 nonn,more
%O A316474 1,6
%A A316474 _Gus Wiseman_, Jul 04 2018