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 A318234 #5 Aug 23 2018 09:05:28 %S A318234 1,1,2,5,13,34,87 %N A318234 Number of inequivalent leaf-colorings of totally transitive rooted trees with n nodes. %C A318234 A rooted tree is totally transitive if every branch of the root is totally transitive and every branch of a branch of the root is also a branch of the root. %e A318234 Inequivalent representatives of the a(6) = 34 leaf-colorings: %e A318234 (11(11)) (11111) (111(1)) (1(111)) (1(1)(1)) %e A318234 (11(12)) (11112) (111(2)) (1(112)) (1(1)(2)) %e A318234 (11(22)) (11122) (112(1)) (1(122)) (1(2)(2)) %e A318234 (11(23)) (11123) (112(2)) (1(123)) (1(2)(3)) %e A318234 (12(11)) (11223) (112(3)) (1(222)) %e A318234 (12(12)) (11234) (123(1)) (1(223)) %e A318234 (12(13)) (12345) (123(4)) (1(234)) %e A318234 (12(33)) %e A318234 (12(34)) %Y A318234 Cf. A000081, A001190, A001678, A003238, A004111, A290689, A318185, A304486, A318186, A318187. %Y A318234 Cf. A318226, A318227, A318228, A318229, A318230, A318231. %K A318234 nonn,more %O A318234 1,3 %A A318234 _Gus Wiseman_, Aug 21 2018