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 A245319 #31 Sep 13 2022 09:16:46 %S A245319 1,2,4,5,6,8,12,18,24,36,72,88,198,228,1032,2412,2838,4553,5958,10008, %T A245319 24588,25938,46777,65538,75468,82505,130056,143916,200364,540738, %U A245319 598818,750852,797478,923628,958212,1151538,1250568,1505388,1647396,2365128,2964036,3490028,3704418,3844808 %N A245319 Numbers k that divide 2^k + 8. %H A245319 Chai Wah Wu, <a href="/A245319/b245319.txt">Table of n, a(n) for n = 1..929</a> (terms 1..58 from Harvey P. Dale) %H A245319 OEIS Wiki, <a href="/wiki/2^n mod n">2^n mod n</a> %e A245319 2^4 + 8 = 24 is divisible by 4. Thus 4 is a term of this sequence. %e A245319 2^5 + 8 = 40 is divisible by 5. Thus 5 is a term of this sequence. %p A245319 select(n -> 2 &^ n + 8 mod n = 0, [$1..10^6]); # _Robert Israel_, Jul 18 2014 %t A245319 Join[Select[Range[7],Divisible[2^#+8,#]&],Select[Range[4000000], Abs[ PowerMod[ 2,#,#]-#]==8&]] (* _Harvey P. Dale_, May 25 2016 *) %o A245319 (PARI) for(n=1,10^9,if(Mod(2,n)^n==Mod(-8,n),print1(n,", "))); %Y A245319 The odd terms form A357125. %Y A245319 Cf. A015922. %K A245319 nonn %O A245319 1,2 %A A245319 _Derek Orr_, Jul 17 2014