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