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 A123062 #18 Aug 16 2021 21:31:59 %S A123062 1,7,51373,78127,138943,620299,2842933,137422693,2259290321, %T A123062 413879131637,434757575329,915535274009,14864856896743 %N A123062 Numbers k that divide 5^k + 2. %C A123062 No further terms up to 10^15. Larger term: 64629734103979763971. - _Max Alekseyev_, Oct 15 2016 %t A123062 Select[Range[1000000], IntegerQ[(PowerMod[5,#,# ]+2)/# ]&] %o A123062 (PARI) is(n)=Mod(5,n)^n==-2 \\ _Charles R Greathouse IV_, Nov 04 2016 %Y A123062 Solutions to 5^n == k (mod n): A067946 (k=1), A015951 (k=-1), A124246 (k=2), this sequence (k=-2), A123061 (k=3), A123052 (k=-3), A125949 (k=4), A123047 (k=-4), A123091 (k=5), A015891 (k=-5), A277350 (k=6), A277348 (k=-6). %K A123062 hard,more,nonn %O A123062 1,2 %A A123062 _Alexander Adamchuk_, Nov 04 2006 %E A123062 More terms from _Farideh Firoozbakht_, Nov 18 2006 %E A123062 a(9) from _Ryan Propper_, Jan 29 2007 %E A123062 a(10)-a(13) from _Max Alekseyev_, Jul 28 2009, Oct 15 2016