The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A019284 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,7)-perfect numbers. 13
24, 1536, 47360, 343976, 572941926400 (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
572941926400 is also a term. See comment in A019278. - Michel Marcus, May 15 2016
a(6) > 4*10^12, if it exists. - Giovanni Resta, Feb 26 2020
LINKS
Graeme L. Cohen and Herman J. J. te Riele, Iterating the sum-of-divisors function, Experimental Mathematics, 5 (1996), pp. 93-100.
MATHEMATICA
Select[Range[50000], DivisorSigma[1, DivisorSigma[1, #]]/# == 7 &] (* Robert Price, Apr 07 2019 *)
PROG
(PARI) isok(n) = sigma(sigma(n))/n == 7; \\ Michel Marcus, May 12 2016
CROSSREFS
Sequence in context: A288955 A203973 A063885 * A333042 A112389 A187634
KEYWORD
nonn,more
AUTHOR
EXTENSIONS
a(5) from Giovanni Resta, Feb 26 2020
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 June 18 09:08 EDT 2024. Contains 373472 sequences. (Running on oeis4.)