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 A130422 #27 Feb 26 2022 16:33:44 %S A130422 1,137243,2517961,117741349,369940993,19049924867,30861256333, %T A130422 1087115897989,38969560049629 %N A130422 Numbers k such that 4^k == 3 (mod k). %C A130422 No other terms below 10^15. %C A130422 222775558403218644781528238995676668723498240827403019 belongs to this sequence. - _Max Alekseyev_, Jul 03 2014 %H A130422 M. Miller, <a href="http://ajc.maths.uq.edu.au/pdf/3/ajc-v3-p151.pdf">Digraph covering and its application to two optimization problems for digraphs</a>, Australasian Journal of Combinatorics, 3 (1991), pp. 151-164. %o A130422 (PARI) for (n=1,10^33, if ( Mod(4,n)^n==3, print1(n,", "))); /* _Joerg Arndt_, Jun 09 2012 */ %Y A130422 Cf. A130421. %K A130422 nonn,more %O A130422 1,2 %A A130422 _Jon E. Schoenfield_, May 26 2007 %E A130422 a(6) from _Jon E. Schoenfield_, Sep 30 2013 %E A130422 a(7) from _Jared Polzer_, Oct 03 2013 %E A130422 a(8)-a(9) from _Max Alekseyev_, Jul 03 2014