%I A129488
%S A129488 3,5,5,3,3,3,3,5,11,3,7,5,3,3,3,3,3,3,3,3,3,3,3,3,3,7,5,3,7,7,3,3,3,3,
               7,
%T A129488 7,3,5,5,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,
%U A129488 3,3,3,3,3,3,3,3,3,5,5,3,5,5,3,3,3,3,5,5,3,5,5,3,3,3,3,3,3,3,3,3,3,3,3
%N A129488 Smallest odd prime dividing binomial(2n,n).
%C A129488 The Erdos paper calls this function g(n) and states that it not known 
               whether it is bounded. Currently, g(3160)=13 is the greatest known 
               value of g. See A129489.
%D A129488 P. Erdos, R. L. Graham, I. Z. Russa and E. G. Straus, On the prime factors 
               of C(2n,n), Math. Comp. 29 (1975), 83-92.
%H A129488 T. D. Noe, <a href="b129488.txt">Table of n, a(n) for n=2..5000</a>
%t A129488 Table[Transpose[FactorInteger[Binomial[2n,n]]][[1,2]], {n,2,150}]
%Y A129488 Cf. A030979 (n such that g(n)=11).
%Y A129488 Sequence in context: A019944 A110551 A141334 this_sequence A053670 A085963 
               A153098
%Y A129488 Adjacent sequences: A129485 A129486 A129487 this_sequence A129489 A129490 
               A129491
%K A129488 easy,nonn
%O A129488 2,1
%A A129488 T. D. Noe (noe(AT)sspectra.com), Apr 17 2007