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 A383746 #19 May 13 2025 16:42:53
%S A383746 1,2,3,6,9,11,18,38,43,87,126,670,1098,2421,3588,4201,5114,5877,5922,
%T A383746 6048,11799,46119,46419,55098,55945,77439,91541,129624,153229,182402
%N A383746 Numbers k such that k divides the sum of the digits of k^(3k).
%e A383746 2 is a term since the sum of digits of 2^(3*2) is 64, which is divisible by 2.
%e A383746 3 is a term since the sum of digits of 3^(3*3) is 19683, which is divisible by 3.
%e A383746 1098 is a term since the sum of digits of 1098^(3*1098) is 45018, which is divisible by 1098.
%t A383746 Do[If[Mod[Plus @@ IntegerDigits[n^(3*n)], n] == 0, Print[n]], {n, 1, 10000}]
%o A383746 (Python)
%o A383746 from gmpy2 import digits, mpz
%o A383746 def ok(n): return n and sum(map(mpz, digits(n**(3*n))))%n == 0
%o A383746 print([k for k in range(1100) if ok(k)]) # _Michael S. Branicky_, May 08 2025
%Y A383746 Cf. A083282, A108859.
%K A383746 nonn,base,hard,more
%O A383746 1,2
%A A383746 _J.W.L. (Jan) Eerland_, May 08 2025
%E A383746 a(21)-a(23) and a(28)-a(30) from _Michael S. Branicky_, May 08 2025