cp's OEIS Frontend

A342015 a(n) = A003415(A276086(n)) mod A276086(n).

%I A342015 #11 Mar 14 2021 20:42:25
%S A342015 0,1,1,5,6,3,1,7,8,1,39,33,10,45,55,35,15,255,75,25,350,325,300,1725,
%T A342015 500,375,250,2375,2625,10875,1,9,10,41,51,39,12,59,71,37,3,321,95,15,
%U A342015 460,395,330,2235,650,425,200,3025,3225,14325,4125,3875,3625,20375,24000,8625,14,77,91,35,420,399,119,483,602,469
%N A342015 a(n) = A003415(A276086(n)) mod A276086(n).
%C A342015 No zeros after the initial a(0) = 0.
%H A342015 Antti Karttunen, <a href="/A342015/b342015.txt">Table of n, a(n) for n = 0..2310</a>
%H A342015 <a href="/index/Pri#primorialbase">Index entries for sequences related to primorial base</a>
%F A342015 a(n) = A342014(A276086(n)).
%F A342015 a(n) = A327860(n) mod A276086(n).
%F A342015 For all n >= 0, gcd(a(n), A276086(n)) = A328572(n).
%o A342015 (PARI)
%o A342015 A003415(n) = if(n<=1, 0, my(f=factor(n)); n*sum(i=1, #f~, f[i, 2]/f[i, 1]));
%o A342015 A276086(n) = { my(m=1, p=2); while(n, m *= (p^(n%p)); n = n\p; p = nextprime(1+p)); (m); };
%o A342015 A342015(n) = { my(u=A276086(n)); (A003415(u)%u); };
%Y A342015 Cf. A003415, A276086, A327860, A328572, A342014, A342016.
%K A342015 nonn
%O A342015 0,4
%A A342015 _Antti Karttunen_, Mar 04 2021