login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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. 7
15, 1023, 29127, 355744082763 (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

LINKS

Table of n, a(n) for n=1..4.

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[100000], DivisorSigma[1, DivisorSigma[1, #]]/# == 4 &] (* Robert Price, Apr 07 2019 *)

PROG

(PARI) isok(n) = sigma(sigma(n))/n  == 4; \\ Michel Marcus, May 12 2016

CROSSREFS

Cf. A019278, A019279.

Sequence in context: A229840 A102102 A196569 * A082158 A064625 A241331

Adjacent sequences:  A019279 A019280 A019281 * A019283 A019284 A019285

KEYWORD

nonn,more

AUTHOR

N. J. A. Sloane

EXTENSIONS

a(4) from Jud McCranie, Feb 08 2012

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 21 13:24 EDT 2019. Contains 328299 sequences. (Running on oeis4.)