This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A284596 #19 Apr 29 2019 02:43:35 %S A284596 2,1,73,61,35521,11371,7392171,168776043,1584614377,38045133481 %N A284596 a(n) is the minimum number that is the first of n consecutive integers with an increasing number of divisors. %C A284596 Comment from _Giovanni Resta_, Apr 02 2017: (Start) %C A284596 In A075028 the chain has to be at least of length k, whereas here it has to be of length exactly k. %C A284596 Here a(2) = 1, because d(1)=1, d(2)=2, d(3)=2, so the first chain of 2 starts at 1. %C A284596 (End) %C A284596 Calculated with a brute force C++ program. %C A284596 a(11) > 10^13. - _Giovanni Resta_, Apr 14 2017 %e A284596 61 => 61^1 => 2 divisors %e A284596 62 => 2^1 * 31^1 => 4 divisors %e A284596 63 => 3^2 * 7 => 6 divisors %e A284596 64 => 2^6 => 7 divisors %e A284596 65 => 5^1 * 13^1 => 4 divisors. %e A284596 So 61 is the first of four consecutive numbers with an increasing number of divisors. 65 breaks that chain. 61 is the minimum such number so it is the 4th number in the sequence. %Y A284596 See A075028 for another version. %K A284596 hard,more,nonn %O A284596 1,1 %A A284596 _Fred Schneider_, Mar 29 2017 %E A284596 Name clarified by _Jon E. Schoenfield_, Apr 28 2019