|
|
A071174
|
|
Numbers whose sum of exponents is equal to the product of prime factors.
|
|
7
|
|
|
4, 27, 96, 144, 216, 324, 486, 2560, 3125, 6400, 16000, 40000, 57344, 100000, 200704, 250000, 625000, 702464, 823543, 1562500, 2458624, 3906250, 8605184, 23068672, 23914845, 30118144, 39858075, 66430125, 105413504, 110716875
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
57344 = 2^13 * 7^1 and 2*7 = 13+1 hence 57344 is in the sequence.
16000 = 2^7 * 5^3 and 2*5 = 7+3 hence 16000 is in the sequence.
|
|
MATHEMATICA
|
q[n_] := Times @@(f = FactorInteger[n])[[;; , 1]] == Total[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), 1), i))==sum(i=1, o, component(component(factor(n), 2), i)), print1(n, ", ")))
(Python)
from math import prod
from sympy import factorint
def ok(n): f = factorint(n); return sum(f[p] for p in f)==prod(p for p in f)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|