login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

a(n) = A348928(A276086(n)), where A348928(n) = gcd(n, A003958(n)), and A003958 is multiplicative with a(p^e) = (p-1)^e, and A276086 gives the prime product form of primorial base expansion of n.
3

%I #13 Nov 13 2021 22:33:06

%S 1,1,1,2,1,2,1,2,1,2,1,2,1,2,1,2,1,2,1,2,1,2,1,2,1,2,1,2,1,2,1,2,3,6,

%T 3,6,1,2,3,6,3,6,1,2,3,6,3,6,1,2,3,6,3,6,1,2,3,6,3,6,1,2,3,6,9,18,1,2,

%U 3,6,9,18,1,2,3,6,9,18,1,2,3,6,9,18,1,2,3,6,9,18,1,2,3,6,9,18,1,2,3,6,9,18

%N a(n) = A348928(A276086(n)), where A348928(n) = gcd(n, A003958(n)), and A003958 is multiplicative with a(p^e) = (p-1)^e, and A276086 gives the prime product form of primorial base expansion of n.

%C After each primorial number (A002110), the apparent periodicity grows more complex.

%H Antti Karttunen, <a href="/A348998/b348998.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>

%o (PARI) A348998(n) = { my(m1=1, m2=1, p=2); while(n, m1 *= (p^(n%p)); m2 *= ((p-1)^(n%p)); n = n\p; p = nextprime(1+p)); gcd(m1,m2); };

%Y Cf. A002110, A003958, A276086, A348928, A348999.

%K nonn,base,look

%O 0,4

%A _Antti Karttunen_, Nov 07 2021