The OEIS is supported by the many generous donors to the OEIS Foundation.

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 60, we have over 367,000 sequences, and we’ve crossed 11,000 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A065356 Final digits of A065355(n) (in reverse order) for sufficiently large n. 2
 6, 8, 6, 9, 5, 0, 9, 7, 5, 9, 7, 0, 1, 7, 4, 3, 6, 6, 7, 5, 5, 3, 4, 4, 7, 4, 9, 0, 6, 9, 4, 9, 8, 6, 0, 4, 6, 7, 6, 5, 9, 1, 5, 0, 0, 2, 9, 8, 8, 7, 3, 1, 6, 2, 5, 1, 3, 1, 2, 5, 0, 2, 5, 2, 5, 7, 7, 0, 9, 9, 5, 6, 6, 9, 4, 3, 4, 1, 3, 4, 9, 9, 7, 3, 3, 4, 8, 4, 0, 2, 1, 1, 8, 3, 7, 9, 7, 1, 8, 7, 8, 6, 2, 3, 8 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 LINKS Harry J. Smith, Table of n, a(n) for n = 0..1000 Index entries for sequences related to final digits of numbers FORMULA a(n) = 9-A025016(n), n > 0. - Vladeta Jovovic, Nov 02 2001 PROG (PARI) { for (n=0, 1000, f=1; while(f!%10^(n+1)>0, f+=1); x=sum(k=0, f, k!%10^(n+1)); a=(10*(x%10^(n+1)))\10^(n+1); if (n==0, a=3); write("b065356.txt", n, " ", 9 - a) ) } \\ Harry J. Smith, Oct 17 2009 CROSSREFS Cf. A025016, A064733, A064734. Sequence in context: A094540 A010724 A196822 * A019797 A141793 A283086 Adjacent sequences: A065353 A065354 A065355 * A065357 A065358 A065359 KEYWORD base,easy,nonn AUTHOR Floor van Lamoen, Oct 31 2001 EXTENSIONS a(60)-a(104) from Harry J. Smith, Oct 17 2009 STATUS approved

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

Last modified December 1 23:26 EST 2023. Contains 367503 sequences. (Running on oeis4.)