|
|
A175087
|
|
Number of numbers whose product of perfect divisors is equal to n.
|
|
3
|
|
|
1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,4096
|
|
COMMENTS
|
Perfect divisor of n is divisor d such that d^k = n for some k >= 1. See A175068 (product of perfect divisors of n), A175084 (possible values for product of perfect divisors of n) and A175085 (numbers m such that product of perfect divisors of x = m has no solution). a(n) = 0 or 1 for all n.
|
|
LINKS
|
|
|
FORMULA
|
|
|
MATHEMATICA
|
With[{nn = 105}, ReplacePart[ConstantArray[0, nn], Flatten@ Table[{i -> 1}, {i, TakeWhile[#, # <= nn &] &@ Union@ Table[Apply[Times, Select[Divisors@ n, Or[# == 1, #^IntegerExponent[n, #] == n] &]], {n, nn}]}] ] ] (* Michael De Vlieger, Nov 21 2017 *)
|
|
PROG
|
(PARI)
A175068(n) = { my(m=1); fordiv(n, d, if((d>1)&&(d^valuation(n, d))==n, m*=d)); (m); };
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|