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.

A237798 Numbers k such that phi(k) equals the product of two numbers: sums of prime factors of k, with and without repetition.

Original entry on oeis.org

750, 5022, 8037, 18250, 60249, 105669, 1760490, 1965270, 4626489, 62546070, 202631245, 441416073, 286952692809
Offset: 1

Views

Author

Giovanni Resta, Feb 13 2014

Keywords

Comments

25446095286407049 and 27093686218810118911929 are terms.

Examples

			750 = 2*3*5^3 is a term since phi(750) = 200 = (2+3+5) * (2+3+5+5+5).
		

Crossrefs

Programs

  • Mathematica
    Select[Range[2, 10^5], (f=FactorInteger@#; EulerPhi[#] == Total[First /@ f]* Total[Times @@@ f]) &]