Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A063794
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A063794 usigma(n)=n+phi(n). +0
1
2, 28, 1368, 1700, 342000, 2061000, 2120832, 65834560, 89082000 (list; graph; listen)
OFFSET

2,1

PROGRAM

(PARI) us(n) = sumdiv(n, d, if(gcd(d, n/d)==1, d)); for(n=1, 10^8, if(us(n)==n+eulerphi(n), print(n)))

CROSSREFS

Cf. A034448.

Sequence in context: A009674 A143598 A071220 this_sequence A152792 A085602 A058502

Adjacent sequences: A063791 A063792 A063793 this_sequence A063795 A063796 A063797

KEYWORD

nonn

AUTHOR

Jason Earls (zevi_35711(AT)yahoo.com), Aug 18 2001

EXTENSIONS

More terms from Jud McCranie (j.mccranie(AT)comcast.net), Nov 04 2001. No other terms < 2700000000.

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 December 18 21:37 EST 2009. Contains 171024 sequences.


AT&T Labs Research