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 A034800 #15 Jul 08 2025 21:27:26 %S A034800 1,1,1,1,2,3,2,4,9,16,3,9,26,67,125,6,20,75,251,680,1296,11,48,214, %T A034800 888,3135,8716,16807,23,115,612,3023,13155,47787,134960,262144,47,286, %U A034800 1747,10038,51873,232154,858578,2450309,4782969,106,719,4995,32722,195821 %N A034800 Triangle of number of node labeled trees by number of nodes and number of labels. %C A034800 Essentially the same as A034799, but omitting the last value from each row. - _Sean A. Irvine_, Sep 04 2020 %D A034800 J. Riordan, An Introduction to Combinatorial Analysis, p. 138. %H A034800 <a href="/index/Tra#trees">Index entries for sequences related to trees</a> %F A034800 Reference gives generating function. %e A034800 Triangle begins: %e A034800 1; %e A034800 1, 1; %e A034800 1, 2, 3; %e A034800 2, 4, 9, 16; %e A034800 3, 9, 26, 67, 125; %e A034800 ... %Y A034800 Cf. A034799. %K A034800 nonn,tabl %O A034800 1,5 %A A034800 _N. J. A. Sloane_ %E A034800 Offset 1 and more terms from _Sean A. Irvine_, Sep 04 2020