login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A042996
Numbers k such that binomial(k, floor(k/2)) is divisible by k.
4
1, 2, 3, 5, 7, 9, 11, 12, 13, 15, 17, 19, 21, 23, 25, 27, 29, 30, 31, 33, 35, 37, 39, 41, 43, 45, 47, 49, 51, 53, 55, 56, 57, 59, 61, 63, 65, 67, 69, 71, 73, 75, 77, 79, 81, 83, 84, 85, 87, 89, 90, 91, 93, 95, 97, 99, 101, 103, 105, 107, 109, 111, 113, 115, 117, 119, 121
OFFSET
1,2
COMMENTS
All the odd numbers are terms. - Amiram Eldar, Aug 24 2024
LINKS
EXAMPLE
For n = 12, binomial(12,6) = 924 = 12*77 is divisible by 12, so 12 is in the sequence.
For n = 13, binomial(13,6) = 1716 = 13*132 is divisible by 13, so 13 is in the sequence.
From David A. Corneth, Apr 22 2018: (Start)
For n = 20, we wonder if 20 = 2^2 * 5 divides binomial(20, 10) = 20! / (10!)^2.
The exponent of 2 in the prime factorization of 20! is 10 + 5 + 2 + 1 = 18.
The exponent of 2 in the prime factorization of 10! is 5 + 2 + 1 = 8.
Therefore, the exponent of 2 in binomial(20, 10) is 18 - 2*8 = 2.
The exponent of 5 in the prime factorization of 20! is 4.
The exponent of 5 in the prime factorization of 10! is 2.
Therefore, exponent of 5 in binomial(20, 10) is 4 - 2*2 = 0.
So binomial(20, 10) is not divisible by 20, and 20 is not in the sequence. (End)
MATHEMATICA
Select[Range[150], Divisible[Binomial[#, Floor[#/2]], #]&] (* Harvey P. Dale, Sep 15 2011 *)
PROG
(PARI) isok(n) = (binomial(n, n\2) % n) == 0; \\ Michel Marcus, Apr 22 2018
CROSSREFS
Cf. A001405, A020475, A067315 (complement).
Sequence in context: A092875 A155498 A069149 * A073040 A087268 A106765
KEYWORD
nonn
AUTHOR
STATUS
approved