cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A076532 Numbers n such that sopf(sigma(n)) = sigma(sopf(n)), where sopf(x) = sum of the distinct prime factors of x.

Original entry on oeis.org

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
Offset: 1

Views

Author

Joseph L. Pe, Oct 18 2002

Keywords

Examples

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

Crossrefs

Programs

  • Mathematica
    p[n_] := Apply[Plus, Transpose[FactorInteger[n]][[1]]]; Select[Range[2, 10^4], p[DivisorSigma[1, # ]] == DivisorSigma[1, p[ # ]] &]
  • PARI
    isok(n) = (n>1) && sigma(sopf(n)) == sopf(sigma(n)); \\ Michel Marcus, Oct 04 2019

Extensions

Edited and extended by Ray Chandler, Feb 13 2005