|
Search: id:A129488
|
|
|
| A129488 |
|
Smallest odd prime dividing binomial(2n,n). |
|
+0
3
|
|
| 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; listen)
|
|
|
OFFSET
|
2,1
|
|
|
COMMENT
|
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.
|
|
REFERENCES
|
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.
|
|
LINKS
|
T. D. Noe, Table of n, a(n) for n=2..5000
|
|
MATHEMATICA
|
Table[Transpose[FactorInteger[Binomial[2n, n]]][[1, 2]], {n, 2, 150}]
|
|
CROSSREFS
|
Cf. A030979 (n such that g(n)=11).
Adjacent sequences: A129485 A129486 A129487 this_sequence A129489 A129490 A129491
Sequence in context: A019944 A110551 A141334 this_sequence A053670 A085963 A119280
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
T. D. Noe (noe(AT)sspectra.com), Apr 17 2007
|
|
|
Search completed in 0.002 seconds
|
