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!)
A019287 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,10)-perfect numbers. 9

%I #38 Feb 27 2020 04:34:42

%S 480,504,13824,32256,32736,1980342,1396617984,3258775296,14763499520,

%T 38385098752

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

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

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

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

%H G. L. Cohen and H. 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.

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

%K nonn,more

%O 1,1

%A _N. J. A. Sloane_

%E More terms from _Jud McCranie_, Nov 13 2001; a(9) Jan 29 2012, a(10) Feb 08 2012

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 17 21:01 EDT 2024. Contains 371767 sequences. (Running on oeis4.)