|
Search: id:A071175
|
|
|
| A071175 |
|
Numbers n such that product of exponents = sum of prime factors. |
|
+0
1
|
|
| 4, 27, 96, 486, 640, 1440, 2025, 2400, 2744, 3024, 3125, 3528, 3584, 4032, 4536, 4860, 5292, 5625, 9408, 11907, 12150, 12348, 14256, 15360, 16464, 17424, 20412, 22400, 22464, 25344, 31360, 32805, 36504, 37500, 39204, 55566, 56250, 57624
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
EXAMPLE
|
55566 = 2^1*3^4*7^3 and 1*4*3 = 2+3+7 hence 55566 is in the sequence.
|
|
PROGRAM
|
(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, ", ")))
|
|
CROSSREFS
|
Cf. A054411, A054412.
Adjacent sequences: A071172 A071173 A071174 this_sequence A071176 A071177 A071178
Sequence in context: A100488 A071174 A092364 this_sequence A091536 A063262 A048102
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Benoit Cloitre (benoit7848c(AT)orange.fr), Jun 10 2002
|
|
|
Search completed in 0.002 seconds
|
