%I
%S 0,1,2,3,4,5,7,9,11,13,16,21,26,31,36,45
%N Largest order of a tree that does not contain a caterpillar subtree of order n.
%H Stephan Brandt, Janina MÃ¼ttel, Dieter Rautenbach, <a href="http://dx.doi.org/10.1007/s0049301428994">The circumference of the square of a connected graph</a>, Combinatorica 34 (2014), no. 5, 547559. MR3276436.
%F See page 553 of Brandt et al. (2014).
%Y Cf. A253062.
%K nonn,more
%O 1,3
%A _N. J. A. Sloane_, Jan 21 2015
