login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A019281 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,3)-perfect numbers. 11

%I #23 Sep 29 2023 22:03:02

%S 8,21,512

%N 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,3)-perfect numbers.

%C See also the Cohen-te Riele links under A019276.

%C No further term < 10^9 [see Table 1].

%C No other terms < 5*10^11. - _Jud McCranie_, Feb 08 2012

%C a(4) > 4*10^12, if it exists. - _Giovanni Resta_, Feb 26 2020

%H Graeme L. Cohen and Herman J. J. te Riele, <a href="http://www.emis.de/journals/EM/expmath/volumes/5/5.html">Iterating the sum-of-divisors function</a>, Experimental Mathematics, 5 (1996), pp. 93-100.

%H Experimental Mathematics, <a href="http://www.emis.de/journals/EM/">Home Page</a>.

%Y Cf. A019278, A019279, A019282, A019283, A019284, A019285, A019286, A019287, A019288, A019289, A019290, A019291.

%K nonn,bref,more

%O 1,1

%A _N. J. A. Sloane_

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 20:08 EDT 2024. Contains 371963 sequences. (Running on oeis4.)