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 A064781 #14 Mar 24 2023 09:04:18 %S A064781 625,7776,60387,373895,2019348,9941905,45765687,200160586,840783867, %T A064781 3418136039,13525307849,52314181361,198451152867,740283848220, %U A064781 2721325964209,9875523648986,35429691205221,125814678386528 %N A064781 Number of partially labeled rooted trees with n nodes (5 of which are labeled). %D A064781 J. Riordan, An Introduction to Combinatorial Analysis, Wiley, 1958, p. 134. %F A064781 G.f.: A(x) = B(x)^5*(625-974*B(x)+622*B(x)^2-192*B(x)^3+24*B(x)^4)/(1-B(x))^9, where B(x) is g.f. for rooted trees with n nodes, cf. A000081. %Y A064781 Column k=5 of A008295. %Y A064781 Cf. A042977. %K A064781 nonn %O A064781 5,1 %A A064781 _Vladeta Jovovic_, Oct 19 2001