%I A034853
%S A034853 1,1,1,1,1,1,1,2,2,1,1,2,5,2,1,1,3,8,7,3,1,1,3,14,14,11,3,1,1,4,21,
%T A034853 32,29,14,4,1,1,4,32,58,74,42,19,4,1,1,5,45,110,167,128,66,23,5,1
%N A034853 Triangle giving number of trees with n >= 3 nodes and diameter d>=2.
%D A034853 J. Riordan, Enumeration of trees by height and diameter, IBM J. Res. 
               Dev. 4 (1960), 473-478.
%H A034853 <a href="Sindx_Tra.html#trees">Index entries for sequences related to 
               trees</a>
%F A034853 Reference gives recurrence.
%e A034853 1; 1 1; 1 1 1; 1 2 2 1; 1 2 5 2 1; ...
%Y A034853 Sequence in context: A104156 A070166 A131373 this_sequence A110283 A079692 
               A110269
%Y A034853 Adjacent sequences: A034850 A034851 A034852 this_sequence A034854 A034855 
               A034856
%K A034853 nonn,tabl,easy,nice
%O A034853 0,8
%A A034853 N. J. A. Sloane (njas(AT)research.att.com).