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 A109663 #14 Jul 31 2022 07:43:41
%S A109663 1,2,3,9,15,18,27,36,51,81,93,169,181,348,444,504,528,1881,2031,9843,
%T A109663 16479,16685,45435,129056,138510,214008,358326
%N A109663 Numbers k such that the sum of the digits of (k^k + k!) is divisible by k.
%C A109663 The quotients are 2, 3, 2, 6, 6, 5, 8, 7, 6, 9, 9, 10, 10, 12, 12, 12, 12, 15, 15, 18, 19, 19, 21, 23, 22, 24, 25.
%C A109663 No more terms < 500000. - _Lars Blomberg_, Jul 05 2011
%e A109663 The digits of 1881^1881 + 1881! sum to 28215 and 28215 is divisible by 1881, so 1881 is in the sequence.
%t A109663 Do[s = n^n + n!; k = Plus @@ IntegerDigits[s]; If[Mod[k, n] == 0, Print[n]], {n, 1, 10000}]
%t A109663 Select[Range[360000],Divisible[Total[IntegerDigits[#^#+#!]],#]&] (* _Harvey P. Dale_, Dec 27 2018 *)
%Y A109663 Cf. A053042, A109662.
%K A109663 base,more,nonn
%O A109663 1,2
%A A109663 _Ryan Propper_, Aug 06 2005
%E A109663 a(21)-a(27) from _Lars Blomberg_, Jul 05 2011