login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A162947
Numbers k such that the product of all divisors of k equals k^3.
4
1, 12, 18, 20, 28, 32, 44, 45, 50, 52, 63, 68, 75, 76, 92, 98, 99, 116, 117, 124, 147, 148, 153, 164, 171, 172, 175, 188, 207, 212, 236, 242, 243, 244, 245, 261, 268, 275, 279, 284, 292, 316, 325, 332, 333, 338, 356, 363, 369, 387, 388, 404, 412, 423, 425, 428
OFFSET
1,2
COMMENTS
Contains the terms of A054753 (products p*q^2 of a prime p and the square of a different prime q), 1, and p^5, where p is prime.
LINKS
FORMULA
{n: A007955(n) = A000578(n)}. - R. J. Mathar, Jul 19 2009
{1} UNION A030515. - R. J. Mathar, Jul 19 2009
Numbers k such that k^2 = product of proper divisors of k. - Juri-Stepan Gerasimov, May 03 2011
EXAMPLE
18 is in the sequence because the product of its divisors is 1 * 2 * 3 * 6 * 9 * 18 = 18^3.
MATHEMATICA
Select[Range[500], Surd[Times@@Divisors[#], 3] == # &] (* Harvey P. Dale, Mar 15 2017 *)
PROG
(PARI) isok(n) = my(d = divisors(n)); prod(i=1, #d, d[i]) == n^3; \\ Michel Marcus, Feb 04 2014
(Python)
from itertools import chain, count, islice
from sympy import divisor_count
def A162947_gen(): # generator of terms
return chain((1, ), filter(lambda n:divisor_count(n)==6, count(2)))
A162947_list = list(islice(A162947_gen(), 20)) # Chai Wah Wu, Jun 25 2022
CROSSREFS
Cf. A111398, A030628. - R. J. Mathar, Jul 19 2009
Cf. A008578 (product of divisors equals n), A007422 (product of divisors equals n^2).
Sequence in context: A217856 A253388 A030515 * A351201 A359892 A070011
KEYWORD
nonn
AUTHOR
Claudio Meller, Jul 18 2009
EXTENSIONS
Edited by R. J. Mathar, Jul 19 2009
STATUS
approved