a(1) = 1, then a(n) = the smallest number k such that the number of divisors of the n numbers from k through k+n-1 are in strictly ascending order.

A075028

a(1) = 1, then a(n) = the smallest number k such that the number of divisors of the n numbers from k through k+n-1 are in strictly ascending order.

Terms

    a(0) =1a(1) =1a(2) =61a(3) =61a(4) =11371a(5) =11371a(6) =7392171a(7) =168776043a(8) =1584614377a(9) =38045133481

External references