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 A300065 #20 Oct 12 2021 07:59:42
%S A300065 8,12,21,24,28,33,36,42,44,56,57,63,65,66,69,72,76,77,80,84,88,91,92,
%T A300065 93,99,108,114,117,124,126,129,130,132,133,138,141,145,147,152,154,
%U A300065 161,168,171,172,177,182,184,185,186,188,189,195,196,198,201,207,208,209,213,216,217,228,231,234,236,237,240,248,249,252,253,258,260,264,265,266,268,273,275,276,279,282
%N A300065 Numbers k such that the number of residues modulo k of the maximum order is different from phi(phi(k)).
%C A300065 Numbers k such that A111725(k) is not equal to A010554(k).
%C A300065 The ratio a(n)/n tends to 1 as n grows.
%H A300065 Amiram Eldar, <a href="/A300065/b300065.txt">Table of n, a(n) for n = 1..10000</a>
%H A300065 Peter J. Cameron and D. A. Preece, <a href="https://cameroncounts.files.wordpress.com/2014/01/plr1.pdf">Primitive lambda-roots</a>, 2014.
%H A300065 T. W. Müller and J.-C. Schlage-Puchta, <a href="https://doi.org/10.4064/aa115-3-2">On the number of primitive lambda-roots</a>, Acta Arithmetica, Vol. 115 (2004), pp. 217-223.
%t A300065 q[n_] := Count[(t = Table[MultiplicativeOrder[k, n], {k, Select[Range[n], CoprimeQ[n, #] &]}]), Max[t]] != EulerPhi[EulerPhi[n]]; Select[Range[300], q] (* _Amiram Eldar_, Oct 12 2021 *)
%Y A300065 Complement of A300064.
%Y A300065 Union of {8} and set difference of A024619 and A300080.
%Y A300065 Cf. A000010, A002322, A010554, A111725, A300079.
%K A300065 nonn
%O A300065 1,1
%A A300065 _Max Alekseyev_, Feb 23 2018