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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A088826 Solutions to sigma[n]-2n=phi[n]: abundance of n equals Euler-phi of n. 0
12, 42, 1242, 6137440, 1385119360, 1588268480 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

COMMENTS

a(7) > 10^10. [From Donovan Johnson (donovan.johnson(AT)yahoo.com), Sep 30 2009]

EXAMPLE

n=1242, sigma[1242]=2880, 2880-2484=396=phi[1242].

MATHEMATICA

Do[If[Equal[DivisorSigma[1, n]-2*n, EulerPhi[n]], Print[n]], {n, 1, 10000000}]

CROSSREFS

Cf. A000203, A000010, A077374, A033880.

Sequence in context: A122973 A074356 A172294 * A125221 A082829 A003357

Adjacent sequences:  A088823 A088824 A088825 * A088827 A088828 A088829

KEYWORD

more,nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Oct 27 2003

EXTENSIONS

a(5)-a(6) from Donovan Johnson (donovan.johnson(AT)yahoo.com), Sep 30 2009

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 15 14:52 EST 2012. Contains 205822 sequences.