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 A316475 #10 Sep 14 2018 02:48:58
%S A316475 1,1,2,3,5,7,14,25,50,101,207,426,902,1917,4108,8887,19335,42330,
%T A316475 93130,205894,456960,1018098,2275613,5102248,11471107,25856413
%N A316475 Number of locally stable rooted trees with n nodes, meaning no branch is a submultiset of any other (unequal) branch of the same root.
%H A316475 Gus Wiseman, <a href="/A316475/a316475.png">The a(8) = 25 locally stable rooted trees with 8 nodes.</a>
%e A316475 The a(6) = 7 locally stable rooted trees:
%e A316475 (((((o)))))
%e A316475 ((((oo))))
%e A316475 (((ooo)))
%e A316475 (((o)(o)))
%e A316475 ((oooo))
%e A316475 ((o)((o)))
%e A316475 (ooooo)
%t A316475 submultisetQ[M_,N_]:=Or[Length[M]==0,MatchQ[{Sort[List@@M],Sort[List@@N]},{{x_,Z___},{___,x_,W___}}/;submultisetQ[{Z},{W}]]]
%t A316475 strut[n_]:=strut[n]=If[n===1,{{}},Select[Join@@Function[c,Union[Sort/@Tuples[strut/@c]]]/@IntegerPartitions[n-1],Select[Tuples[#,2],UnsameQ@@#&&submultisetQ@@#&]=={}&]];
%t A316475 Table[Length[strut[n]],{n,15}]
%Y A316475 Cf. A000081, A285572, A285573, A303362, A304713, A316468, A316470, A316473, A316474.
%K A316475 nonn,more
%O A316475 1,3
%A A316475 _Gus Wiseman_, Jul 04 2018
%E A316475 a(21)-a(26) from _Robert Price_, Sep 13 2018