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 A175552 #31 Mar 06 2021 02:25:51 %S A175552 1,2,5,7,22,490,724,778,868,994,1109,1390,1415,1462,1642,1739,1829, %T A175552 2146,2362,3136,4954,6437,6628,7103,11200,12424,12863,14242,14249, %U A175552 15059,15203,16222,17140,18353,19192,21233,22853,24106,24574,24833,26896,27652,28253,30323,31306,31594,32386,33790,34985,36184,36310,40673,42196,43931,45911,45983 %N A175552 Numbers k such that the digit sum of 167^k is divisible by k. %C A175552 From _Donovan Johnson_, Dec 03 2010: (Start) %C A175552 To generate the additional terms I used PFGW.exe to get the decimal expansion for each number of the form 167^n (n <= 50000). Then I wrote a program in powerbasic to read the pfgw.out file and get the digit sums. %C A175552 The digit sum is 10 times the n value for terms a(5) to a(56). (End) %C A175552 I believe that this sequence is finite. - _N. J. A. Sloane_, Dec 05 2010 %H A175552 Donovan Johnson, <a href="/A175552/b175552.txt">Table of n, a(n) for n = 1..129</a> %t A175552 Select[Range[10000], Mod[Total[IntegerDigits[167^#]], #] == 0 &] %Y A175552 Sum of digits of k^n mod n: (k=2) A000079, A001370, A175434, A175169; (k=3) A000244, A004166, A175435, A067862; (k=5) A000351, A066001, A175456; (k=6) A000400, A066002, A175457, A067864; (k=7) A000420, A066003, A175512, A067863; (k=8) A062933; (k=13) A001022, A175527, A175528, A175525; (k=21) A175589; (k=167) A175558, A175559, A175560, A175552. %K A175552 base,nonn %O A175552 1,2 %A A175552 _N. J. A. Sloane_, Dec 03 2010 %E A175552 a(25)-a(56) from _Donovan Johnson_, Dec 03 2010