A048125 Becomes prime or 4 after exactly 3 iterations of f(x) = sum of prime factors of x.

14, 15, 16, 18, 20, 24, 27, 38, 46, 68, 87, 124, 141, 152, 155, 158, 161, 166, 171, 183, 185, 186, 195, 203, 208, 209, 212, 218, 221, 222, 226, 230, 231, 232, 234, 247, 249, 255, 261, 272, 275, 276, 290, 295, 299, 301, 306, 314, 322, 323, 330, 335, 341, 343

Offset: 1

Author

David W. Wilson

Keywords

• nonn

Comments

f(x) = sum of prime factors with multiplicity, so that f(1500) = 2+2+3+5+5+5 = 22.

Links

• Andrew Howroyd, Table of n, a(n) for n = 1..10000

Crossrefs

Cf. A002217, A048124.

Programs

Mathematica

f[n_] := Total[Times @@@ FactorInteger[n]];
okQ[n_] := For[k = 3; r = n, k >= 1, k--, r = f[r]; If[r == 4 || PrimeQ[r], Return[k == 1]]];
Select[Range[500], okQ] (* Jean-François Alcover, Sep 20 2019, from PARI *)

PARI

sopfr(n)={my(f=factor(n)); sum(i=1, #f~, f[i,1]*f[i,2])}
ok(n)={forstep(k=3, 1, -1, n=sopfr(n); if(n==4||isprime(n), return(k==1))); 0}
select(ok, [1..500]) \\ Andrew Howroyd, Sep 14 2019