cp's OEIS Frontend

A324645 a(n) = gcd(d(n), A276086(n)), where d(n) gives the number of divisors (A000005).

%I A324645 #6 Mar 11 2019 20:47:48
%S A324645 1,1,2,3,2,1,2,1,3,1,2,1,2,1,2,5,2,1,2,3,2,1,2,1,1,1,2,3,2,1,2,3,2,1,
%T A324645 2,1,2,1,2,1,2,1,2,3,6,1,2,5,1,3,2,3,2,1,2,1,2,1,2,1,2,1,6,7,2,1,2,3,
%U A324645 2,1,2,1,2,1,6,3,2,1,2,5,5,1,2,1,2,1,2,1,2,1,2,3,2,1,2,1,2,3,6,9,2,1,2,1,2
%N A324645 a(n) = gcd(d(n), A276086(n)), where d(n) gives the number of divisors (A000005).
%H A324645 Antti Karttunen, <a href="/A324645/b324645.txt">Table of n, a(n) for n = 1..30030</a>
%F A324645 a(n) = gcd(A000005(n), A276086(n)).
%o A324645 (PARI)
%o A324645 A276086(n) = { my(i=0,m=1,pr=1,nextpr); while((n>0),i=i+1; nextpr = prime(i)*pr; if((n%nextpr),m*=(prime(i)^((n%nextpr)/pr));n-=(n%nextpr));pr=nextpr); m; };
%o A324645 A324645(n) = gcd(numdiv(n),A276086(n));
%Y A324645 Cf. A000005, A009191, A276086, A324644.
%K A324645 nonn
%O A324645 1,3
%A A324645 _Antti Karttunen_, Mar 11 2019