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 A116988 #8 May 21 2018 18:26:39
%S A116988 1,27,648,10539,149346,1938780,23903442,284222502,3292100235,
%T A116988 37420852599
%N A116988 Sum of digits of (10^n)!.
%C A116988 Cf. A004152 Sum of digits of factorial numbers, A113364 1,27,648,16245,... with first three terms coinciding with this SEQ.
%e A116988 a(1)=27 because 10!=3628800 and 3+6+2+8+8+0+0=27.
%t A116988 Do[Print[Total[IntegerDigits[(10^n)! ]]], {n, 0, 7}]
%o A116988 (Python)
%o A116988 from math import factorial
%o A116988 def A116988(n):
%o A116988 return sum(int(d) for d in str(factorial(10**n))) # _Chai Wah Wu_, May 21 2018
%Y A116988 Cf. A004152, A113364.
%K A116988 hard,more,nonn,base
%O A116988 0,2
%A A116988 _Zak Seidov_, Apr 02 2006
%E A116988 One more term from _Ryan Propper_, Jun 27 2007
%E A116988 a(9) from _Chai Wah Wu_, May 21 2018