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 A279192 #7 Oct 07 2018 07:57:42
%S A279192 19,31,37,43,79,199,211,223,229,277,283,367,439,463,499,523,547,619,
%T A279192 643,692,829,859,877,907,967,997
%N A279192 Primes p such that L(p^2) = (p-1)*L(p)/6, where L(i) = A279186(i).
%H A279192 Haifeng Xu, <a href="http://arxiv.org/abs/1601.06509">The largest cycles consist by the quadratic residues and Fermat primes</a>, arXiv:1601.06509 [math.NT], 2016.
%t A279192 T[n_, k_] := Module[{g, y, r}, If[k == 0, Return[1]]; y = n; g = GCD[k, y]; While[g > 1, y = y/g; g = GCD[k, y]]; If[y == 1, Return[1]]; r = MultiplicativeOrder[k, y]; r = r/2^IntegerExponent[r, 2]; If[r == 1, Return[1]]; MultiplicativeOrder[2, r]];
%t A279192 L[n_] := L[n] = Table[T[n, k], {k, 0, n - 1}] // Max;
%t A279192 For[p = 2, p < 1000, p = NextPrime[p], If[L[p^2] == (p-1) L[p]/6, Print[p]]] (* _Jean-François Alcover_, Oct 07 2018, after _Robert Israel_ in A279186 *)
%Y A279192 Cf. A279185-A279191.
%K A279192 nonn,more
%O A279192 1,1
%A A279192 _N. J. A. Sloane_, Dec 14 2016
%E A279192 More terms from _Jean-François Alcover_, Oct 07 2018