%I #7 Jan 04 2016 22:33:31
%S 7,13,18,29,39,61,82,125
%N Smallest number of vertices in bi-regular ({3,4};n) graph with girth (shortest cycle) = n.
%Y Cf. A000066, A266730.
%K nonn,more
%O 4,1
%A _N. J. A. Sloane_, Jan 04 2016
