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 A019282 #41 Feb 27 2020 04:21:43 %S A019282 15,1023,29127,355744082763 %N A019282 Let sigma_m (n) be result of applying sum-of-divisors function m times to n; call n (m,k)-perfect if sigma_m (n) = k*n; sequence gives the (2,4)-perfect numbers. %C A019282 See also the Cohen-te Riele links under A019276. %C A019282 No other terms < 5*10^11. - _Jud McCranie_, Feb 08 2012 %C A019282 a(5) > 4*10^12, if it exists. - _Giovanni Resta_, Feb 26 2020 %H A019282 Graeme L. Cohen and Herman J. J. te Riele, <a href="http://projecteuclid.org/euclid.em/1047565640">Iterating the sum-of-divisors function</a>, Experimental Mathematics, 5 (1996), pp. 93-100. %t A019282 Select[Range[100000], DivisorSigma[1, DivisorSigma[1, #]]/# == 4 &] (* _Robert Price_, Apr 07 2019 *) %o A019282 (PARI) isok(n) = sigma(sigma(n))/n == 4; \\ _Michel Marcus_, May 12 2016 %Y A019282 Cf. A019278, A019279, A019281, A019283, A019284, A019285, A019286, A019287, A019288, A019289, A019290, A019291. %K A019282 nonn,more %O A019282 1,1 %A A019282 _N. J. A. Sloane_ %E A019282 a(4) from _Jud McCranie_, Feb 08 2012