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 A064782 #15 Mar 24 2023 09:04:29 %S A064782 7776,117649,1071904,7601777,46205469,252620693,1277843841,6088987597, %T A064782 27669884619,120970585689,512143134419,2110092318654,8493720340735, %U A064782 33506301271642,129860760881905,495506657571553,1864611086321279 %N A064782 Number of partially labeled rooted trees with n nodes (6 of which are labeled). %D A064782 J. Riordan, An Introduction to Combinatorial Analysis, Wiley, 1958, p. 134. %F A064782 G.f.: A(x) = B(x)^6*(7776-14543*B(x) +11758*B(x)^2 -5126*B(x)^3 +1200*B(x)^4 -120*B(x)^5)/(1-B(x))^11, where B(x) is g.f. for rooted trees with n nodes, cf. A000081. %Y A064782 Column k=6 of A008295. %Y A064782 Cf. A042977. %K A064782 nonn %O A064782 6,1 %A A064782 _Vladeta Jovovic_, Oct 19 2001