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 A302495 #50 Aug 04 2018 14:47:24
%S A302495 2,2,3,5,2,5,2,2,3,2,2,3,2,2,6,3,3,2,4,2,3,3,2,6,2,3,2,3,2,3,3,3,5,2,
%T A302495 2,3,3,3,2,3,2,4,6,3,2,2,3,2,4,3,3,2,5,2,3,2,7,2,3,2,2,3,3,4,3,3,2,2,
%U A302495 9,2,4,2,2,2,3,2,5,2,2,3,5,6,2,12,6,2,3,3,3,3,2,3,3,2,3,2,5,3,2,3
%N A302495 a(n) is the least k such that k * A005277(n) is a term of A002202.
%C A302495 This sequence maps non-totients to totients, a(n) * A005277(n) is not a term of A005277, rather it is a term of A002202.
%C A302495 Conjecture: Every k > 1 eventually appears in the sequence.
%F A302495 a(n) = A067005(A005277(n)). - _Michel Marcus_, Jul 25 2018
%e A302495 a(1) = 2 because 2*A005277(1) = 2*14 = 28 is not a term of A005277.
%e A302495 a(3) = 3 because 3*A005277(3) = 3*34 = 102 is not a term of A005277.
%o A302495 (PARI) lista(nn) = {forstep(n=2, nn, 2, if (! istotient(n), my(k = 1); while (! istotient(k*n), k++); print1(k, ", ");););} \\ _Michel Marcus_, Jul 19 2018
%Y A302495 Cf. A000010, A002202, A005277, A000027.
%K A302495 nonn
%O A302495 1,1
%A A302495 _Torlach Rush_, Jun 10 2018
%E A302495 More terms from _Michel Marcus_, Jul 19 2018