38045133481domain: NAppears in sequencesa(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.at n=9A075028a(n) is the minimum number that is the first of n consecutive integers with an increasing number of divisors.at n=9A284596