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 A247227 #19 Sep 08 2022 08:46:09 %S A247227 1,2,3,4,5,6,7,8,9,19,56,71,93,145,219,758,768,7584,7684,9696,10081, %T A247227 21993,40585 %N A247227 Numbers that divide the sum of the factorials of their digits in base 10. %C A247227 Numbers n such that n divides A061602(n). %C A247227 Finite sequence with 23 terms. %C A247227 Subsequence of numbers n such that A061602(n) >= n. The largest such number is 1999999. %C A247227 Sequence of values A061602(a(n)) / a(n): 1, 1, 2, 6, 24, 120, 720, 5040, 40320, 19099, 15, 71, 3902, 1, 1657, 60, 60, 6, 6, 75, 4, 33, 1. %C A247227 Supersequence of A014080 (whose terms are the numbers n such that A061602(n) / n = 1). %e A247227 19 is in the sequence because 19 divides 1! + 9! = 1 + 362880 = 362881; 362881 / 19 = 19099. %t A247227 Select[Range[50000], Mod[Plus @@ Factorial[IntegerDigits[#]], #] == 0 &] (* _Michael De Vlieger_, Dec 26 2014 *) %o A247227 (Magma) [n: n in [1..2000000] | &+[ Factorial(d): d in Intseq(n)] mod n eq 0] %o A247227 (PARI) for(k=1,10^5,d=digits(k);s=sum(i=1,#d,d[i]!);if(!(s%k),print1(k,", "))) \\ _Derek Orr_, Dec 30 2014 %Y A247227 Cf. A014080, A061602, A093325, A197181. %K A247227 nonn,base,fini,full %O A247227 1,2 %A A247227 _Jaroslav Krizek_, Dec 25 2014