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 A245594 #17 Aug 16 2021 03:22:24 %S A245594 1,2,3,9,14,161,261,5727,12127,16394,20029238,577738261,2637324098, %T A245594 45019843643,54756012358,142046769201,2144325306742,2247950127743, %U A245594 34462584090334,223385072880447 %N A245594 Numbers k that divide 2^k + 10. %C A245594 No other terms below 10^15. Some larger terms: 58431276133663538, 107614684491896498, 246944720684027923581501, 2^260+5 (79 digits), 581*p (112 digits) where p is the largest prime factor of 2^580+5. - _Max Alekseyev_, Oct 01 2016 %H A245594 OEIS Wiki, <a href="/wiki/2^n mod n">2^n mod n</a> %e A245594 3 divides 2^3 + 10 = 18. Thus 3 is a term of this sequence. %t A245594 Select[Range[10^5], Divisible[2^# + 10, #] &] (* _Robert Price_, Oct 12 2018 *) %o A245594 (PARI) for(n=1,10^9,if(Mod(2,n)^n==Mod(-10,n),print1(n,", "))) %Y A245594 Cf. A128123, A246139. %K A245594 nonn,hard %O A245594 1,2 %A A245594 _Derek Orr_, Jul 27 2014 %E A245594 a(13)-a(20) from _Max Alekseyev_, Oct 01 2016