Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #13 Jun 17 2017 02:11:34
%S 0,1,1,1,1,1,2,1,2,3,1,3,7,1,3,9,10,1,4,12,30,1,4,18,38,45,1,5,21,64,
%T 144,1,5,27,91,217,210
%N Irregular triangle read by rows: T(n,k) = number of trees on n nodes with load k, n>=1, 1 <= k <= floor(n/2).
%C The load of a tree is the maximal branch weight from the centroid.
%H Peter Steinbach, <a href="/A000055/a000055_8.pdf">Field Guide to Simple Graphs, Volume 3</a>, Part 8 (For Volumes 1, 2, 3, 4 of this book see A000088, A008406, A000055, A000664, respectively.)
%e Triangle begins:
%e 0,
%e 1,
%e 1,
%e 1, 1,
%e 1, 2,
%e 1, 2, 3,
%e 1, 3, 7,
%e 1, 3, 9, 10,
%e 1, 4, 12, 30,
%e 1, 4, 18, 38, 45,
%e 1, 5, 21, 64, 144,
%e 1, 5, 27, 91, 217, 210,
%e ...
%Y Cf. A283826.
%Y See also A000676, A000677, A027416, A102911.
%K nonn,tabf,more
%O 1,7
%A _N. J. A. Sloane_, Mar 19 2017