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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A019278 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 (2,k)-perfect numbers. 4
1, 2, 4, 8, 15, 16, 21, 24, 42, 60, 64, 84, 160, 168, 240, 336, 480, 504, 512, 960, 1023, 1344, 1536, 4092, 4096, 10752, 13824, 16368, 29127, 32256, 32736, 47360, 57120, 58254, 61440, 65472, 65536, 86016, 116508, 217728, 262144, 331520 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

COMMENTS

See also the Cohen-te Reile links under A019276.

REFERENCES

Graeme L. Cohen and Herman J. J. te Riele, Iterating the sum-of-divisors function, Experimental Mathematics, 5 (1996), pp. 93-100.

LINKS

Jud McCranie, Table of n, a(n) for n = 1..130

Experimental Mathematics, Home Page

MATHEMATICA

Select[Range[100000], Mod[DivisorSigma[1, DivisorSigma[1, #]], #] == 0 &] (* Carl Najafi, Aug 22 2011 *)

CROSSREFS

Cf. A098219-A098223, A008333, A051027.

Sequence in context: A098056 A097100 A002954 * A084345 A084561 A078613

Adjacent sequences:  A019275 A019276 A019277 * A019279 A019280 A019281

KEYWORD

nonn,changed

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 04:58 EST 2012. Contains 205985 sequences.