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 A277630 #15 Sep 13 2017 22:54:00 %S A277630 1,5,2352527,193841707,17126009179703,380211619942943 %N A277630 Positive integers n such that 3^n == 8 (mod n). %C A277630 No other terms below 10^15. - _Max Alekseyev_, Sep 13 2017 %o A277630 (PARI) isok(n) = Mod(3, n)^n == Mod(8, n); %Y A277630 Solutions to 3^n == k (mod n): A277340 (k=-11), A277289 (k=-7), A277288 (k=-5), A015973 (k=-2), A015949 (k=-1), A067945 (k=1), A276671 (k=2), A276740 (k=5), A277628 (k=6), A277126 (k=7), this sequence (k=8), A277274 (k=11). %K A277630 nonn,more %O A277630 1,2 %A A277630 _Dmitry Ezhov_, Oct 24 2016 %E A277630 a(5)-a(6) established by _Max Alekseyev_, Sep 13 2017