OFFSET
1,1
COMMENTS
LINKS
Giovanni Resta, Table of n, a(n) for n = 1..10000
EXAMPLE
55566 = 2^1 * 3^4 * 7^3 and 1*4*3 = 2+3+7 hence 55566 is in the sequence.
MATHEMATICA
q[n_] := Total[(f = FactorInteger[n])[[;; , 1]]] == Times @@ f[[;; , 2]]; Select[Range[2, 10^5], q] (* Amiram Eldar, Jun 24 2022 *)
PROG
(PARI) for(n=1, 200000, o=omega(n); if(prod(i=1, o, component(component(factor(n), 2), i))==sum(i=1, o, component(component(factor(n), 1), i)), print1(n, ", ")))
(Python)
from math import prod
from sympy import factorint
def ok(n): f = factorint(n); return prod(f[p] for p in f)==sum(p for p in f)
print(list(filter(ok, range(10**5)))) # Michael S. Branicky, Apr 27 2021
CROSSREFS
KEYWORD
easy,nonn
AUTHOR
Benoit Cloitre, Jun 10 2002
STATUS
approved