This site is supported by donations to The OEIS Foundation.

 Annual appeal: Please make a donation to keep the OEIS running! Over 6000 articles have referenced us, often saying "we discovered this result with the help of the OEIS". Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A129488 Smallest odd prime dividing binomial(2n,n). 4
 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, 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, 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 (list; graph; refs; listen; history; text; internal format)
 OFFSET 2,1 COMMENTS The Erdős 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. LINKS T. D. Noe, Table of n, a(n) for n = 2..5000 P. Erdős, R. L. Graham, I. Z. Russa and E. G. Straus, On the prime factors of C(2n,n), Math. Comp. 29 (1975), 83-92. MATHEMATICA Table[Transpose[FactorInteger[Binomial[2n, n]]][[1, 2]], {n, 2, 150}] PROG (PARI) a(n)=my(k); forprime(p=3, default(primelimit), k=1; while((k*=p)<=2*n, if(n/k-n\k>1/2, return(p)))) \\ Charles R Greathouse IV, Dec 19 2011 CROSSREFS Cf. A030979 (n such that g(n)>=11), A129489, A266366. Sequence in context: A110551 A141334 A199614 * A211023 A279494 A053670 Adjacent sequences:  A129485 A129486 A129487 * A129489 A129490 A129491 KEYWORD nonn AUTHOR T. D. Noe, Apr 17 2007 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.