cp's OEIS Frontend

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.

A283827 Irregular triangle read by rows: T(n,k) = number of trees on n nodes with load k, n>=1, 1 <= k <= floor(n/2).

This page as a plain text file.
%I A283827 #13 Jun 17 2017 02:11:34
%S A283827 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 A283827 144,1,5,27,91,217,210
%N A283827 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 A283827 The load of a tree is the maximal branch weight from the centroid.
%H A283827 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 A283827 Triangle begins:
%e A283827   0,
%e A283827   1,
%e A283827   1,
%e A283827   1, 1,
%e A283827   1, 2,
%e A283827   1, 2,  3,
%e A283827   1, 3,  7,
%e A283827   1, 3,  9, 10,
%e A283827   1, 4, 12, 30,
%e A283827   1, 4, 18, 38,  45,
%e A283827   1, 5, 21, 64, 144,
%e A283827   1, 5, 27, 91, 217, 210,
%e A283827   ...
%Y A283827 Cf. A283826.
%Y A283827 See also A000676, A000677, A027416, A102911.
%K A283827 nonn,tabf,more
%O A283827 1,7
%A A283827 _N. J. A. Sloane_, Mar 19 2017