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 A066732 #9 Nov 07 2023 05:08:41
%S A066732 3,4,6,18,150,60,30,22440,120360,44880,5610,11730,8160,473280,277440,
%T A066732 131070,548760,920040,750720,440130,329970,27030,5689560,522240,1020,
%U A066732 3028890,2639760,6866130,251430,134130,7481190,2390880,2664240,9926130,279480,9730290
%N A066732 Least k such that the least factor of k^Phi(k) -1 is the n-th prime.
%H A066732 Robert Price, <a href="/A066732/b066732.txt">Table of n, a(n) for n = 1..56</a>
%e A066732 18^Phi(18)-1 = 18^6-1 = 34012223 = 7^3 * 17 * 19 * 307. Therefore since 7, the fourth prime, is the least prime in the factorization, a(4) = 18.
%t A066732 a = Table[0, {53} ]; Do[b = 1; While[ PowerMod[n, EulerPhi[n], Prime[b]] != 1, b++ ]; If[ a[[b]] == 0, a[[b]] = n], {n, 3, 10^6} ]
%Y A066732 Cf. A066699.
%K A066732 nonn
%O A066732 1,1
%A A066732 _Robert G. Wilson v_, Jan 15 2002
%E A066732 a(35)-a(36) from _Robert Price_, Nov 06 2023