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.
1, 1, 61, 61, 11371, 11371, 7392171, 168776043, 1584614377, 3804513348
1 seqfan posts
Fri Feb 26 21:19:01 CET 2010 [seqfan] Numbers-Of-Divisors Increasing/Decreasing