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 A051446 #18 Sep 05 2021 16:26:01 %S A051446 1,11,95,4834519,156203641,135466795859,182901372149135 %N A051446 Integers n such that 2^n == 13 (mod n). %C A051446 No other terms below 10^15. %C A051446 Larger terms: 1910102794991114096035717. - _Max Alekseyev_, May 18 2011 %t A051446 m = 13; Join[Select[Range[m], Divisible[2^# - m, #] &], %t A051446 Select[Range[m + 1, 10^6], PowerMod[2, #, #] == m &]] (* _Robert Price_, Oct 08 2018 *) %Y A051446 Cf. A033981, A033982, A033983. %K A051446 hard,nonn,more %O A051446 1,2 %A A051446 Joe K. Crump (joecr(AT)carolina.rr.com) %E A051446 Terms 1, 11 prepended by _Max Alekseyev_, May 18 2011 %E A051446 a(7) added by _Sergey Paramonov_, Sep 05 2021