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.
%I A217842 #16 Nov 15 2024 07:00:01
%S A217842 2,72,1,4800,1,15876,1,3456000,1,242,1,300500928,1,1,1,2130739200,1,
%T A217842 1052676,1,119790000,1,1058,1,531598161669120000,1,1,1,1682,1,1922,1,
%U A217842 20864198246400,1,1,1,1159208596538496,1,1,1,265804426800000000,1,17757796,1
%N A217842 Product of the numbers p such that phi(p) = n, where phi is Euler's totient function.
%C A217842 It appears that all terms greater than 1 are distinct. This is true for all n <= 10^6.
%H A217842 T. D. Noe, <a href="/A217842/b217842.txt">Table of n, a(n) for n = 1..1000</a>
%H A217842 Max Alekseyev, <a href="https://oeis.org/wiki/User:Max_Alekseyev/gpscripts">PARI/GP Scripts for Miscellaneous Math Problems</a> (invphi.gp).
%H A217842 David M. Bressoud, <a href="https://www.davidbressoud.org/books-videos">A Course in Computational Number Theory (web page)</a>, <a href="https://drive.google.com/file/d/1UMesJ93mpdCabQvETMqOBH8eCR4JWA6X/view?usp=sharing">CNT.m</a>, Computational Number Theory Mathematica package.
%t A217842 Needs["CNT`"]; Table[Times @@ PhiInverse[n], {n, 100}]
%o A217842 (PARI) a(n) = vecprod(invphi(n)); \\ _Amiram Eldar_, Nov 15 2024, using _Max Alekseyev_'s invphi.gp
%Y A217842 Cf. A002181 (smallest inverse), A006511 (largest inverse), A215240 (sum of inverses).
%Y A217842 Cf. A032447 (inverse of phi).
%K A217842 nonn
%O A217842 1,1
%A A217842 _T. D. Noe_, Oct 12 2012