cp's OEIS Frontend

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.

A109662 Numbers k such that the sum of the digits of (k^k - k!) is divisible by k.

This page as a plain text file.
%I A109662 #16 Nov 05 2024 16:35:09
%S A109662 1,2,3,9,14,15,29,33,45,81,102,105,126,142,157,288,414,1184,2133,
%T A109662 10449,16369,17221,46524,214179,216741
%N A109662 Numbers k such that the sum of the digits of (k^k - k!) is divisible by k.
%C A109662 The quotients are 0, 1, 1, 5, 5, 6, 7, 6, 8, 9, 9, 9, 9, 10, 10, 11, 12, 14, 15, 18, 19, 19, 21, 24, 24.
%C A109662 No more terms < 500000. - _Lars Blomberg_, Jul 05 2011
%C A109662 a(26) > 595261. - _J.W.L. (Jan) Eerland_, Nov 05 2024
%e A109662 The digits of 414^414 - 414! sum to 4968 and 4968 is divisible by 414, so 414 is in the sequence.
%t A109662 Do[s = n^n - n!; k = Plus @@ IntegerDigits[s]; If[Mod[k, n] == 0, Print[n]], {n, 1, 10000}]
%Y A109662 Cf. A036679, A109663.
%K A109662 base,more,nonn
%O A109662 1,2
%A A109662 _Ryan Propper_, Aug 06 2005
%E A109662 Terms a(20)-a(25) from _Lars Blomberg_, Jul 05 2011