cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A353564 Product_{d|n, dA276086(phi(d)), where A276086 is primorial base exp-function, and phi is Euler totient function.

This page as a plain text file.
%I A353564 #6 Apr 27 2022 15:58:33
%S A353564 1,2,2,4,2,12,2,12,6,36,2,108,2,20,54,108,2,180,2,972,30,180,2,8748,
%T A353564 18,100,30,300,2,43740,2,1620,270,900,90,24300,2,500,150,131220,2,
%U A353564 22500,2,24300,4050,4500,2,1968300,10,121500,1350,7500,2,112500,810,67500,750,22500,2,265720500,2,28,3750,364500,450
%N A353564 Product_{d|n, d<n} A276086(phi(d)), where A276086 is primorial base exp-function, and phi is Euler totient function.
%H A353564 <a href="/index/Pri#primorialbase">Index entries for sequences related to primorial base</a>
%F A353564 a(1) = 1 (as an empty product).
%F A353564 a(n) = Product_{d|n, d<n} A353563(d).
%F A353564 For all n >= 1, A276085(a(n)) = A051953(n).
%o A353564 (PARI)
%o A353564 A276086(n) = { my(m=1, p=2); while(n, m *= (p^(n%p)); n = n\p; p = nextprime(1+p)); (m); };
%o A353564 A353564(n) = { my(m=1); fordiv(n,d,if(d < n,m *= A276086(eulerphi(d)))); m; };
%Y A353564 Cf. A000010, A051953, A276085, A276086, A353563, A353565 (rgs-transform).
%Y A353564 Cf. also A318834.
%K A353564 nonn
%O A353564 1,2
%A A353564 _Antti Karttunen_, Apr 27 2022