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 A132055 #5 Oct 07 2019 14:10:12 %S A132055 1,165,16665,1349205,97026930,6526750230,423076603950,26922666320550, %T A132055 1702498733310375,107876426221438875,6888889247523458175, %U A132055 445180690239692281875,29198763785973826044000 %N A132055 Tenth column of triangle A035342. %C A132055 a(n), n>=10, enumerates unordered forests composed of nine plane ternary trees with n vertices. See A001147 (number of increasing ternary trees) and a D. Callan comment there. For a picture of some ternary trees see a W. Lang link under A001764. %C A132055 a(n), n>=10, enumerates unordered forests composed of ten plane increasing ternary trees with n vertices. See A001147 (number of increasing ternary trees) and a D. Callan comment there. For a picture of some ternary trees see a W. Lang link under A001764. %F A132055 E.g.f.: ((x*c(x/2)*(1-2*x)^(-1/2))^10)/10!, where c(x) = g.f. for Catalan numbers A000108, a(0) := 0. %F A132055 E.g.f.: (-1+(1-2*x)^(-1/2))^10/10!. %e A132055 a(11)=165=3*binomial(11,2) increasing ternary 10-forest with n=11 vertices: there are three 10-forests (nine one vertex trees together with any of the three different 2-vertex trees) each with binomial(11,2)= 55 increasing labelings. %Y A132055 Cf. A132054 (eighth column). %K A132055 nonn,easy %O A132055 10,2 %A A132055 _Wolfdieter Lang_ Sep 14 2007