%I A034854
%S A034854 3,4,12,5,60,60,6,210,720,360,7,630,6090,7560,2520,8,1736,47040,112560,
%T A034854 80640,20160,9,4536,363384,1496880,1829520,907200,181440,10,11430,
%U A034854 2913120,19207440,36892800,28274400,10886400,1814400
%N A034854 Triangle giving number of rooted labeled trees with n >= 3 nodes and 
               diameter d>=2.
%D A034854 J. Riordan, Enumeration of trees by height and diameter, IBM J. Res. 
               Dev. 4 (1960), 473-478.
%H A034854 J. Riordan, <a href="http://www.research.ibm.com/journal/rd/045/ibmrd0405E.pdf">
               Enumeration of trees by height and diameter</a>, IBM J. Res. Dev. 
               4 (1960), 473-478.
%H A034854 <a href="Sindx_Tra.html#trees">Index entries for sequences related to 
               trees</a>
%F A034854 Reference gives recurrence.
%e A034854 3; 4 12; 5 60 60; 6 210 720 360; 7 630 6090 7560 2520; ...
%Y A034854 Sequence in context: A045826 A084200 A097850 this_sequence A164982 A081837 
               A101404
%Y A034854 Adjacent sequences: A034851 A034852 A034853 this_sequence A034855 A034856 
               A034857
%K A034854 nonn,tabl,easy,nice
%O A034854 0,1
%A A034854 N. J. A. Sloane (njas(AT)research.att.com).
%E A034854 More terms from Pab Ter (pabrlos(AT)yahoo.com), May 27 2004