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 A127438 #19 Sep 08 2022 08:45:29 %S A127438 0,3,8,4,13,8,5,26,19,17,50,6,39,16,72,19,69,70,72,41,87,101,48,27, %T A127438 108,56,89,42,181,43,46,48,83,109,157,93,92,56,249,152,26,69,238,137, %U A127438 184,271,11,100,404,13,318,111,450,25,320,151,130,9,297,104,429,435,530,105,478,175,114,75,175,80 %N A127438 Minimal nonnegative solution to 2^x == 3 (mod p) where p goes over primes for which such a solution exists (A001915). %F A127438 2^a(n) == 3 (mod A001915(n)), where a(n) >= 0 and minimum possible. %o A127438 (Magma) lst:=[0]; for p in [5..647 by 2] do if IsPrime(p) then e:=Ceiling(Log(2, p+1)); for x in [e..p-2] do if 2^x mod p eq 3 then Append(~lst, x); break; end if; end for; end if; end for; lst; // _Arkadiusz Wesolowski_, Jan 12 2021 %Y A127438 Cf. A001915. %K A127438 nonn %O A127438 1,2 %A A127438 _Max Alekseyev_, Jan 14 2007 %E A127438 Corrected by _Max Alekseyev_, Jun 08 2011 %E A127438 Corrected by _Arkadiusz Wesolowski_, Jan 12 2021