|
| |
|
|
A116988
|
|
Sum of digits of (10^n)!.
|
|
0
| | |
|
|
|
OFFSET
| 0,2
|
|
|
COMMENTS
| Cf. A004152 Sum of digits of factorial numbers, A113364 1,27,648,16245,... with first three terms coinciding with this SEQ.
|
|
|
EXAMPLE
| a(1)=27 because 10!=3628800 and 3+6+2+8+8+0+0=27.
|
|
|
MATHEMATICA
| Do[Print[Total[IntegerDigits[(10^n)! ]]], {n, 0, 7}]
|
|
|
CROSSREFS
| Cf. A004152, A113364.
Sequence in context: A099753 A046359 A060603 * A113364 A095898 A014914
Adjacent sequences: A116985 A116986 A116987 * A116989 A116990 A116991
|
|
|
KEYWORD
| hard,more,nonn,base
|
|
|
AUTHOR
| Zak Seidov (zakseidov(AT)yahoo.com), Apr 02 2006
|
|
|
EXTENSIONS
| One more term from Ryan Propper (rpropper(AT)cs.stanford.edu), Jun 27 2007
|
| |
|
|
