login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual Appeal: Today, Nov 11 2014, is the 4th anniversary of the launch of the new OEIS web site. 70,000 sequences have been added in these four years, all edited by volunteers. Please make a donation (tax deductible in the US) to help keep the OEIS running.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A082648 Consider f(m) = Sum{k=1..m} k! (A007489) when m is very large; a(n) = n-th digit from end. 0

%I

%S 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,

%T 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,

%U 0,0,4,3,3,0,5,6,5,8,6,5

%N Consider f(m) = Sum{k=1..m} k! (A007489) when m is very large; a(n) = n-th digit from end.

%C Apart from the first term, the same as A025016. [From _R. J. Mathar_, Sep 17 2008]

%e Example: Sum[n!,{n,1,30}] =274410818470142134209703780940313.

%e The last 7 digits in reverse order would give us first 7 terms of this sequence 3,1,3,0,4,9,0.

%e Take[Reverse[IntegerDigits[Sum[n!,{n,1,30}]]],7] {3,1,3,0,4,9,0}

%t Take[Reverse[IntegerDigits[Sum[n!, {n, 1, 500}]]], 100] - generates first 100 terms.

%Y Cf. A007489, A003422.

%K easy,base,nonn

%O 1,1

%A _Alexander Adamchuk_, May 15 2003

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified December 20 20:33 EST 2014. Contains 252289 sequences.