login
The OEIS is supported by the many generous donors 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. 8
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; text; internal format)
OFFSET
1,1
LINKS
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[ # ]] &]
PROG
(PARI) isok(n) = (n>1) && sigma(sopf(n)) == sopf(sigma(n)); \\ Michel Marcus, Oct 04 2019
CROSSREFS
Sequence in context: A256962 A266807 A355574 * A212301 A226339 A157064
KEYWORD
nonn
AUTHOR
Joseph L. Pe, Oct 18 2002
EXTENSIONS
Edited and extended by Ray Chandler, Feb 13 2005
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 07:33 EDT 2024. Contains 371235 sequences. (Running on oeis4.)