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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A076532 Numbers n such that sopf(sigma(n)) = sigma(sopf(n)), where sopf(x) = sum of the distinct prime factors of x. 7
2, 90, 425, 490, 605, 630, 726, 735, 750, 816, 2250, 2695, 3185, 3234, 3420, 3822, 4176, 5096, 5250, 6591, 7644, 8470, 9100, 9425, 10296, 10780, 11616, 11638, 12321, 15750, 16940, 18096, 22736, 23276, 25578, 27360, 27783, 28500, 31900, 36400 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

EXAMPLE

sopf(sigma(90)) = sopf(234) = 18; sigma(sopf(90)) = sigma(10) = 18, hence 90 is a term of the sequence.

MATHEMATICA

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

CROSSREFS

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

Sequence in context: A023302 A041967 A024239 * A157064 A058527 A138583

Adjacent sequences:  A076529 A076530 A076531 * A076533 A076534 A076535

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

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 11:25 EST 2012. Contains 205777 sequences.