Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A063710
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A063710 Numbers n such that e(n) = s(n), where e(n)=eulerphi(sigma(n)+n) and s(n)=sigma(n-eulerphi(n)). +0
1
10, 22, 38, 58, 82, 182, 228, 244, 308, 346, 404, 446, 514, 524, 644, 922, 1020, 1214, 1484, 1522, 1538, 1582, 2104, 2408, 5600, 5924, 7596, 8420, 13352, 13378, 13738, 14686, 15012, 20128, 21272, 27084, 27580, 29312, 37158, 43946, 47284, 47468 (list; graph; listen)
OFFSET

1,1

LINKS

Harry J. Smith, Table of n, a(n) for n=1,...,350

PROGRAM

(PARI) s(n) = sigma(n-eulerphi(n)); e(n) = eulerphi(sigma(n)+n); j = []; for(n = 1, 10^5, if(e(n) == s(n), j = concat(j, n))); j

(PARI) { n=0; for (x=2, 10^9, if (eulerphi(sigma(x) + x) == sigma(x - eulerphi(x)), write("b063710.txt", n++, " ", x); if (n==350, break)) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Aug 28 2009]

CROSSREFS

Sequence in context: A017641 A028569 A014367 this_sequence A157917 A104867 A079861

Adjacent sequences: A063707 A063708 A063709 this_sequence A063711 A063712 A063713

KEYWORD

easy,nonn

AUTHOR

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

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 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research