|
%I #52 Dec 13 2021 16:14:26
%S 1,2,1,3,1,4,1,4,2,4,1,6,1,4,3,5,1,6,1,6,3,4,1,8,2,4,3,6,1,8,1,6,3,4,
%T 2,9,1,4,3,8,1,8,1,6,5,4,1,10,2,6,3,6,1,8,2,8,3,4,1,12,1,4,5,7,3,8,1,
%U 6,3,8,1,12,1,4,5,6,2,8,1,10,4,4,1,12,3,4
%N a(n) is the number of divisors d of n such that phi(n)/phi(lpf(n)) mod phi(n)/phi(d) = 0, where phi is Euler's totient function (A000010), and lpf(n) is the least prime factor of n (A020639).
%C This equivalence criterion splits the divisor set of n into two types of divisors and can be used to compute the number of links of length k on the set of Fibonacci necklaces (A000358) of length n. This counting is a combinatorial problem over the positive integers.
%H Antti Karttunen, <a href="/A340273/b340273.txt">Table of n, a(n) for n = 1..20000</a>
%p with(numtheory):
%p a:= n-> `if`(n=1, 1, (f-> nops(select(d-> irem(phi(n)/phi(f),
%p phi(n)/phi(d))=0, divisors(n))))(min(factorset(n)))):
%p seq(a(n), n=1..100); # _Alois P. Heinz_, Feb 12 2021
%t Table[Function[{e, f}, DivisorSum[n, 1 &, Mod[e, f/EulerPhi[#]] == 0 &]] @@ {#2/#1, #2} & @@ {EulerPhi[FactorInteger[n][[1, 1]]], EulerPhi[n]}, {n, 86}] (* _Michael De Vlieger_, Feb 12 2021 *)
%o (MATLAB)
%o n=100;
%o A=[];
%o for i=1:n
%o d=divisors(i);
%o t=0;
%o for j=1:size(d,2)
%o if checkCD(i,d(j))==1
%o t=t+1;
%o end
%o end
%o A=[A t];
%o end
%o function [res] = checkCD(n,d)
%o if mod(n,d)==0 && mod(totient(n)/totient(min(factor(n))),totient(n)/totient(d))==0
%o res=1;
%o else
%o res=0;
%o end
%o end
%o function [res] = totient(n)
%o res=0;
%o for i=1:n
%o if gcd(i,n)==1
%o res=res+1;
%o end
%o end
%o end
%o (PARI) lpf(n) = if (n==1, 1, factor(n)[1,1]);
%o a(n) = my(lp = lpf(n), t = eulerphi(n)); sumdiv(n, d, Mod(t/eulerphi(lp), t/eulerphi(d)) == 0); \\ _Michel Marcus_, Jan 03 2021
%Y Cf. A000005, A000027, A000358.
%K nonn
%O 1,2
%A _Maxim Karimov_, Jan 02 2021
|
