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 A062933 #18 Dec 26 2024 18:56:54
%S A062933 1,2,25,70,106,268,304,358,1559,2369,2824,2855,3616,5218
%N A062933 Numbers k such that k divides the sum of digits of 8^k.
%C A062933 The next term, if it exists, is greater than 100000. - _Ryan Propper_, Aug 31 2005
%C A062933 No further terms less than 1000000 using the same method _Donovan Johnson_ explains in A175525.
%e A062933 25 divides the sum of digits of 8^25 (i.e., 3+7+7+7+8+9+3+1+8+6+2+9+5+7+1+6+1+7+0+9+5+6+8 = 125), so 25 is in the sequence.
%t A062933 k = 1; Do[k *= 8; s = Plus @@ IntegerDigits[k]; If[Mod[s, n] == 0, Print[n]], {n, 1, 10^5}] (* _Ryan Propper_, Aug 31 2005 *)
%t A062933 Select[Range[6000],Mod[Total[IntegerDigits[8^#]],#]==0&] (* _Harvey P. Dale_, Dec 26 2024 *)
%K A062933 hard,nonn,base
%O A062933 1,2
%A A062933 _Shyam Sunder Gupta_ and _Amarnath Murthy_, Feb 16 2002
%E A062933 Corrected and extended by _Ryan Propper_, Aug 31 2005
%E A062933 Edited by _Jon E. Schoenfield_, May 29 2010