S000275


Least integer c such that binomial(c,n) has n prime factors greater than n.

2, 6, 15, 22, 59, 70, 119, 143, 159, 187, 374, 377, 538, 564, 565, 566, 908, 909, 1273, 1351, 1646, 1647, 2335, 2336, 2337, 2338, 2339, 2429, 3296, 3297, 4091, 4192, 4193, 4194, 4195, 4196, 5562, 5563, 5564, 5565, 5993, 5999, 9718, 9719, 10523, 9727, 12227

1

S000275

This function is not monotonic.

T. D. Noe, Plot of 100 terms

T. D. Noe, Table of 100 terms

MathOverflow, Prime divisors of the respectively minimal binomial coefficients

(Mma) Table[b = n + 1; While[Length[Select[Transpose[FactorInteger[Binomial[b, n]]][[1]], # > n &]] != n, b++]; b, {n, 50}]

Cf. A005733.

nonn,hard

T. D. Noe, Oct 06 2014

© Tony D Noe 2014-2015