cp's OEIS Frontend

A328476 Convert the primorial base expansion of n into its prime product form, then subtract the largest primorial which divides that product: a(n) = A276151(A276086(n)).

%I A328476 #8 Oct 19 2019 21:27:12
%S A328476 0,0,2,0,8,12,4,8,14,0,44,60,24,48,74,120,224,420,124,248,374,720,
%T A328476 1124,2220,624,1248,1874,3720,5624,11220,6,12,20,36,62,120,34,68,104,
%U A328476 0,314,420,174,348,524,840,1574,2940,874,1748,2624,5040,7874,15540,4374,8748,13124,26040,39374,78540,48,96,146,288,440,876,244,488
%N A328476 Convert the primorial base expansion of n into its prime product form, then subtract the largest primorial which divides that product: a(n) = A276151(A276086(n)).
%H A328476 Antti Karttunen, <a href="/A328476/b328476.txt">Table of n, a(n) for n = 0..2559</a>
%H A328476 <a href="/index/Pri#primorialbase">Index entries for sequences related to primorial base</a>
%F A328476 a(n) = A276151(A276086(n)).
%F A328476 A276086(a(n)) = A276087(n) / A326810(n).
%o A328476 (PARI)
%o A328476 A276151(n) = { my(s=1); forprime(p=2, , if(n%p, return(n-s), s *= p)); };
%o A328476 A276086(n) = { my(m=1, p=2); while(n, m *= (p^(n%p)); n = n\p; p = nextprime(1+p)); (m); };
%o A328476 A328476(n) = A276151(A276086(n));
%Y A328476 Cf. A002110, A053589, A276086, A276087, A276151, A326810, A328475.
%Y A328476 Cf. A143293 (indices of other zeros after a(0)=0).
%K A328476 nonn
%O A328476 0,3
%A A328476 _Antti Karttunen_, Oct 19 2019