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 A152562 #11 Jun 05 2022 08:27:53 %S A152562 2,5,20,104,936,13842,188424,3249576,81239400,2388809736,59720243400 %N A152562 Smallest number m such that sigma(m) has exactly n distinct prime factors. %C A152562 a(12) <= 4440632687496. - _Donovan Johnson_, Mar 31 2013 %C A152562 From _Daniel Suteu_, May 24 2022: (Start) %C A152562 a(12) <= 2571228006912, %C A152562 a(13) <= 85266458294400, %C A152562 a(14) <= 4638227848902900, %C A152562 a(15) <= 209103527633041800, %C A152562 a(16) <= 10931190635671518600, %C A152562 a(17) <= 545209768960172964900, %C A152562 a(18) <= 34893425213451069753600, %C A152562 a(19) <= 2000640771807316185690000. (End) %F A152562 a(n) <= A153076(n), for n >= 2. - _Daniel Suteu_, May 24 2022 %e A152562 a(9) = 81239400; sigma(81239400) = 300690390 = 2*3*5*7*11*13*17*19*31 (9 distinct prime factors). %o A152562 (PARI) v=vector(9); for(m=2, 81239400, n=omega(sigma(m)); if(v[n]==0, v[n]=m; print(n " " v[n]))) /* _Donovan Johnson_, Mar 31 2013 */ %Y A152562 Cf. A000203, A001221, A153076. %K A152562 nonn,more %O A152562 1,1 %A A152562 _Donovan Johnson_, Dec 09 2008