cp's OEIS Frontend

A346253 a(n) = A342002(A328623(n)).

%I A346253 #12 Jan 16 2022 17:49:16
%S A346253 0,1,2,7,1,5,3,11,19,53,14,43,1,7,13,41,8,31,4,13,22,59,17,49,2,9,16,
%T A346253 47,11,37,4,15,26,73,19,59,41,117,193,491,158,421,27,89,151,407,116,
%U A346253 337,48,131,214,533,179,463,34,103,172,449,137,379,1,9,17,55,10,41,26,87,148,401,113,331,12,59,106,317,71,247,33,101,169
%N A346253 a(n) = A342002(A328623(n)).
%H A346253 Antti Karttunen, <a href="/A346253/b346253.txt">Table of n, a(n) for n = 0..13860</a>
%H A346253 <a href="/index/Pri#primorialbase">Index entries for sequences related to primorial base</a>
%F A346253 a(n) = A342001(A346233(n)) = A342002(A328623(n)).
%o A346253 (PARI)
%o A346253 A342002(n) = { my(s=0, m=1, p=2, e); while(n, e = (n%p); m *= p^(e>0); s += (e/p); n = n\p; p = nextprime(1+p)); (s*m); };
%o A346253 A346253(n) = A342002(A328623(n)); \\ Rest of program in A328623.
%o A346253 (PARI)
%o A346253 A003415(n) = if(n<=1, 0, my(f=factor(n)); n*sum(i=1, #f~, f[i, 2]/f[i, 1]));
%o A346253 A003557(n) = (n/factorback(factorint(n)[, 1]));
%o A346253 A342001(n) = (A003415(n) / A003557(n));
%o A346253 A346233(n) = { my(p=2, m=1); while(n>0, my(d=n%p); if(d>0, m *= p^if(2==p,d,lift(Mod(d, p)/2))); n \= p; p = nextprime(1+p)); return(m); };
%o A346253 A346253(n) = A342001(A346233(n));
%Y A346253 Cf. A003415, A003557, A328623, A342001, A342002, A346233.
%Y A346253 Cf. also A344760, A346252.
%K A346253 nonn,base,look
%O A346253 0,3
%A A346253 _Antti Karttunen_, Jul 11 2021