|
Search: id:A082648
|
|
|
| A082648 |
|
Consider f(m) = Sum{k=1..m} k! (A007489) when m is very large; a(n) = n-th digit from end. |
|
+0
1
|
|
| 3, 1, 3, 0, 4, 9, 0, 2, 4, 0, 2, 9, 8, 2, 5, 6, 3, 3, 2, 4, 4, 6, 5, 5, 2, 5, 0, 9, 3, 0, 5, 0, 1, 3, 9, 5, 3, 2, 3, 4, 0, 8, 4, 9, 9, 7, 0, 1, 1, 2, 6, 8, 3, 7, 4, 8, 6, 8, 7, 4, 9, 7, 4, 7, 4, 2, 2, 9, 0, 0, 4, 3, 3, 0, 5, 6, 5, 8, 6, 5
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
Apart from the first term, the same as A025016. [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Sep 17 2008]
|
|
EXAMPLE
|
Example: Sum[n!,{n,1,30}] =274410818470142134209703780940313.
The last 7 digits in reverse order would give us first 7 terms of this sequence 3,1,3,0,4,9,0.
Take[Reverse[IntegerDigits[Sum[n!,{n,1,30}]]],7] {3,1,3,0,4,9,0}
|
|
MATHEMATICA
|
Take[Reverse[IntegerDigits[Sum[n!, {n, 1, 500}]]], 100] - generates first 100 terms.
|
|
CROSSREFS
|
Cf. A007489, A003422.
Sequence in context: A011430 A073747 A127549 this_sequence A144477 A079530 A020815
Adjacent sequences: A082645 A082646 A082647 this_sequence A082649 A082650 A082651
|
|
KEYWORD
|
easy,base,nonn
|
|
AUTHOR
|
Alexander Adamchuk (alex(AT)kolmogorov.com), May 15 2003
|
|
|
Search completed in 0.002 seconds
|
