Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
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
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
KEYWORD
nonn
STATUS
approved