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 A134740 #10 Apr 13 2022 19:42:35 %S A134740 0,2,2,3,2,3,2,4,5,4,6,5,2,5,6,6,7,5,2,7,7,6,6,6,2,7,7,7,6,8,8,8,8,6, %T A134740 7,8,8,9,7,8,2,9,9,9,11,10,9,10,10,8,9,11,10,10,8,11,11,10,10,11,11,9, %U A134740 11,9,12,11,13,13,12,11,12,12,11,13,12,12,12,11,12,13,12,11,10,13,12,11,10 %N A134740 Number of distinct prime factors in the n-th multiply perfect number A007691(n). %C A134740 If a multiply perfect number k has abundancy m = sigma(k)/k, then k must have at least A005579(m) distinct prime factors. %H A134740 T. D. Noe, <a href="/A134740/b134740.txt">Table of n, a(n) for n=1..5000</a> (using Flammenkamp's data) %H A134740 Achim Flammenkamp, <a href="http://wwwhomes.uni-bielefeld.de/achim/mpn.html">The Multiply Perfect Numbers Page</a> %Y A134740 Cf. A007691. %K A134740 nonn %O A134740 1,2 %A A134740 _T. D. Noe_, Nov 07 2007