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!)
A019288 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,11)-perfect numbers. 9
4404480, 57669920, 238608384 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
See also the Cohen-te Riele links under A019276.
No other terms < 5*10^11. - Jud McCranie, Feb 08 2012
a(4) > 4*10^12. - Giovanni Resta, Feb 26 2020
53283599155200, 2914255525994496 and 3887055949004800 are also terms. - Michel Marcus, Feb 27 2020
LINKS
Graeme L. Cohen and Herman J. J. te Riele, Iterating the sum-of-divisors function, Experimental Mathematics, 5 (1996), pp. 93-100.
PROG
(PARI) isok(n) = sigma(sigma(n))/n == 11; \\ Michel Marcus, Feb 27 2020
CROSSREFS
Sequence in context: A276323 A288086 A210297 * A237910 A244575 A105649
KEYWORD
nonn,bref,more
AUTHOR
STATUS
approved

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 25 09:56 EDT 2024. Contains 371967 sequences. (Running on oeis4.)