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 A112092 #27 Feb 25 2025 23:26:24
%S A112092 3,5,7,17,11,13,43,257,19,41,23,241,2731,29,151,65537,43691,37,174763,
%T A112092 61681,337,397,47,97,251,53,87211,15790321,59,61,715827883,641,67,137,
%U A112092 71,433,223,229,79,4278255361,83,1429,431,353,631,277,283,193,4363953127297
%N A112092 a(n) is the least prime such that the multiplicative order of 4 mod a(n) equals n.
%C A112092 a(n) is the minimal prime divisor of A064080(n).
%H A112092 Max Alekseyev, <a href="/A112092/b112092.txt">Table of n, a(n) for n = 1..1207</a> (first 100 terms from Amiram Eldar)
%t A112092 a[n_] := Module[{f = FactorInteger[4^n - 1][[;; , 1]]}, Do[p = f[[k]]; If[ MultiplicativeOrder[4, p] == n, Break[] ], {k, 1, Length[f]}]; p]; Array[a, 100] (* _Amiram Eldar_, Jan 27 2019 *)
%o A112092 (PARI) a(n) = {my(p = 3); while (znorder(Mod(4, p)) != n, p = nextprime(p+1)); p;} \\ _Michel Marcus_, Feb 08 2016
%Y A112092 Cf. A064080, A112927.
%Y A112092 Cf. A112927 (base 2), A143663 (base 3), A112092 (base 4), A143665 (base 5), A379639 (base 6), A379640 (base 7), A379641 (base 8), A379642 (base 9), A007138 (base 10), A379644 (base 11), A252170 (base 12).
%K A112092 nonn
%O A112092 1,1
%A A112092 _Vladimir Shevelev_, Aug 28 2008
%E A112092 a(29)-a(30) from _Michel Marcus_, Feb 08 2016
%E A112092 More term from _Amiram Eldar_, Jan 27 2019