A348501 - OEIS

%I #16 Nov 13 2021 22:33:34

%S 1,1,1,5,1,21,1,1,1,1,3,3,1,3,1,3,1,3,1,1,1,1,1,3,1,1,5,35,3,3,1,3,5,

%T 1,1,3,3,1,1,13,3,3,1,3,1,3,1,3,13,3,1,1,1,3,3,1,5,5,39,3,1,3,1,3,1,3,

%U 3,9,3,3,9,9,1,3,1,3,1,3,1,3,1,57,1,3,57,9,15,15,3,9,1,1,1,1,1,3,1,1,1,1,3,3

%N a(n) = A348496(A276086(n)), where A348496(n) = A348495(n) / A003557(n).

%H Antti Karttunen, <a href="/A348501/b348501.txt">Table of n, a(n) for n = 0..11550</a>

%H <a href="/index/Pri#primorialbase">Index entries for sequences related to primorial base</a>

%F a(n) = A348496(A276086(n)).

%t Block[{b = MixedRadix[Reverse@ Prime@ Range@ 12]}, Map[Function[n, GCD[Total@ GCD[n, Range[n]], DivisorSum[n, #*(If[# < 2, 0, # Total[#2/#1 & @@@ FactorInteger[#]]] &[n/#]) &]]/Apply[Times, Map[#1^(#2 - 1) & @@ # &, FactorInteger[n]]]], Table[Function[k, Times @@ Power @@@ # &@ Transpose@ {Prime@ Range@ Length@ k, Reverse@ k}]@ IntegerDigits[n, b], {n, 0, 101}] ] ] (* _Michael De Vlieger_, Oct 21 2021 *)

%o (PARI)

%o \\ Needs also code from A348496:

%o A276086(n) = { my(m=1, p=2); while(n, m *= (p^(n%p)); n = n\p; p = nextprime(1+p)); (m); };

%o A348501(n) = A348496(A276086(n));

%Y Cf. A003557, A276086, A348495, A348496.

%Y Cf. also A348500, A348502.

%K nonn,base

%O 0,4

%A _Antti Karttunen_, Oct 21 2021