%I A054760
%S A054760 3,4,4,5,6,5,6,8,10,6,7,10,19,14,7,8,12,30,26,24,8,9,14,40,42
%N A054760 Table T(n,k) = size of smallest (n,k)-cage, or n-regular graph of girth 
               k, n >= 2, k >= 3, read by antidiagonals.
%D A054760 P. R. Christopher, Degree monotonicity of cages, Graph Theory Notes of 
               New York, 38 (2000), 29-32.
%D A054760 M. Daven and C. A. Rodger, (k,g)-cages are 3-connected, Discr. Math., 
               199 (1999), 207-215.
%D A054760 P. K. Wong, Cages - a survey, J. Graph Theory 6 (1982), 1-22.
%H A054760 Gordon Royle, <a href="http://www.cs.uwa.edu.au/~gordon/cages/">Cubic 
               Cages</a>
%e A054760 Table begins
%e A054760 3 4 5 6 7 8 ...
%e A054760 4 6 10 14 24 ...
%e A054760 5 8 19 26 ?
%e A054760 6 10 30 42 ?
%Y A054760 Cf. A000066, A006787, A006856, A037233.
%Y A054760 Sequence in context: A082090 A133196 A059183 this_sequence A079107 A023963 
               A121500
%Y A054760 Adjacent sequences: A054757 A054758 A054759 this_sequence A054761 A054762 
               A054763
%K A054760 nonn,tabl,nice
%O A054760 0,1
%A A054760 N. J. A. Sloane (njas(AT)research.att.com), Apr 26 2000