login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A006197 Least number not dividing binomial(2n,n).
(Formerly M2297)
1
3, 4, 3, 3, 5, 5, 5, 4, 3, 3, 5, 3, 3, 7, 7, 4, 7, 8, 9, 8, 7, 7, 7, 7, 5, 5, 3, 3, 9, 3, 3, 4, 8, 8, 5, 3, 3, 9, 3, 3, 13, 13, 13, 11, 11, 11, 11, 8, 7, 5, 5, 5, 13, 9, 5, 5, 5, 7, 7, 5, 5, 5, 7, 4, 7, 7, 9, 8, 13, 7, 7 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
All terms are prime powers (A246655). [Corrected by Amiram Eldar, May 27 2024]
REFERENCES
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
LINKS
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.
FORMULA
a(n) = A007978(A000984(n)). - Amiram Eldar, May 27 2024
MATHEMATICA
a[n_] := Module[{k = 1, b = Binomial[2*n, n]}, While[Divisible[b, k], k++]; k]; Array[a, 100] (* Amiram Eldar, May 27 2024 *)
CROSSREFS
Sequence in context: A322347 A373712 A073322 * A079404 A349945 A246820
KEYWORD
nonn
AUTHOR
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 15 20:25 EDT 2024. Contains 375955 sequences. (Running on oeis4.)