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 A067006 #18 Nov 28 2023 21:44:47
%S A067006 7,11,29,19,23,53,29,31,103,191,43,47,101,53,81,59,311,67,103,71,149,
%T A067006 191,79,83,173,181,283,197,101,103,107,121,229,709,367,311,127,131,
%U A067006 269,137,139,569,293,149,151,229,463,317,163,167,1021,173,349,179,181,547
%N A067006 Smallest number for which the totient is divisible by the n-th nontotient number, that is, the n-th term of A007617.
%H A067006 Amiram Eldar, <a href="/A067006/b067006.txt">Table of n, a(n) for n = 1..10000</a>
%F A067006 a(n) = min_{x : mod(phi(x), A007617(n)) = 0}. For all nontotient numbers x, q*x+1 is prime with large enough q and a divisor of phi(q*x+1) = q*x is x, the selected nontotient number. [Corrected by _Sean A. Irvine_, Nov 28 2023]
%e A067006 14 = A007617(7) is not totient of any other number, but phi(29) = 28 is divisible by 14 and 29 is the smallest number of which the totient is a multiple of 14, so a(7)=29.
%Y A067006 Cf. A000010, A007617, A066674, A066675, A066676, A066677, A066678, A067005.
%K A067006 nonn
%O A067006 1,1
%A A067006 _Labos Elemer_, Dec 22 2001