|
%I #20 Jan 09 2023 13:02:29
%S 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,
%T 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,
%U 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
%N Number of numbers whose product of perfect divisors is equal to n.
%C 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.
%C That is, this is the characteristic function of A175084. - _Antti Karttunen_, Nov 21 2017
%H Antti Karttunen, <a href="/A175087/b175087.txt">Table of n, a(n) for n = 1..16384</a>
%H <a href="/index/Ch#char_fns">Index entries for characteristic functions</a>
%H <a href="/index/Eu#epf">Index entries for sequences computed from exponents in factorization of n</a>
%F a(n) = Sum_{k=1..n} [A175068(k)==n]. - _Antti Karttunen_, Nov 21 2017
%t 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 *)
%o (PARI)
%o A175068(n) = { my(m=1); fordiv(n,d,if((d>1)&&(d^valuation(n,d))==n,m*=d)); (m); };
%o A175087(n) = sum(i=1,n,A175068(i)==n); \\ _Antti Karttunen_, Nov 21 2017
%Y Cf. A175068, A175084 (positions of ones), A175085 (of zeros).
%K nonn
%O 1,4096
%A _Jaroslav Krizek_, Jan 24 2010
%E More terms from _Antti Karttunen_, Nov 21 2017
|
