Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A088826
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A088826 Solutions to sigma[n]-2n=phi[n]: abundance of n equals Euler-phi of n. +0
1
12, 42, 1242, 6137440, 1385119360, 1588268480 (list; graph; listen)
OFFSET

1,1

COMMENT

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: A007586 A122973 A074356 this_sequence A125221 A082829 A003357

Adjacent sequences: A088823 A088824 A088825 this_sequence 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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research