Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A076531
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A076531 Numbers n such that sopf(phi(n)) = phi(sopf(n)), where sopf(x) = sum of the distinct prime factors of x. +0
8
3, 203, 322, 377, 644, 851, 931, 1166, 1211, 1288, 1421, 1666, 1815, 1862, 2332, 2576, 3332, 3724, 4664, 4830, 5152, 6401, 6517, 6664, 7042, 7241, 7448, 9075, 9328, 9555, 9660, 9845, 9922, 9947, 10304, 10465, 11662, 11814, 11830, 12558, 12903, 13034 (list; graph; listen)
OFFSET

1,1

EXAMPLE

sopf(phi(203)) = sopf(168) = 12; phi(sopf(203)) = phi(36) = 12 hence 203 is a term of the sequence.

MATHEMATICA

p[n_] := Apply[Plus, Transpose[FactorInteger[n]][[1]]]; Select[Range[3, 10^4], p[EulerPhi[ # ]] == EulerPhi[ p[ # ]] &]

CROSSREFS

Cf. A008472, A075565, A075784, A075846, A076525, A076527, A076532, A076533.

Sequence in context: A054701 A080297 A080274 this_sequence A038789 A063407 A072196

Adjacent sequences: A076528 A076529 A076530 this_sequence A076532 A076533 A076534

KEYWORD

nonn

AUTHOR

Joseph L. Pe (joseph_l_pe(AT)hotmail.com), Oct 18 2002

EXTENSIONS

Edited and extended by Ray Chandler (rayjchandler(AT)sbcglobal.net), Feb 13 2005

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 August 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research