Erdős-Selfridge function: a(n) is the least number m > n+1 such that the least prime factor of binomial(m, n) is > n.

A003458

Erdős-Selfridge function: a(n) is the least number m > n+1 such that the least prime factor of binomial(m, n) is > n.

Terms

    a(0) =3a(1) =6a(2) =7a(3) =7a(4) =23a(5) =62a(6) =143a(7) =44a(8) =159a(9) =46a(10) =47a(11) =174a(12) =2239a(13) =239a(14) =719a(15) =241a(16) =5849a(17) =2098a(18) =2099a(19) =43196a(20) =14871a(21) =19574a(22) =35423a(23) =193049a(24) =2105a(25) =36287a(26) =1119a(27) =284a(28) =240479a(29) =58782

External references