This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A064737 Fibonacci sequence (A000045) mod 10 with carry. 1
 0, 1, 1, 2, 3, 5, 8, 3, 2, 6, 8, 4, 3, 8, 1, 10, 1, 2, 4, 6, 0, 7, 7, 4, 2, 7, 9, 6, 6, 3, 10, 3, 4, 8, 2, 1, 4, 5, 9, 4, 4, 9, 3, 3, 7, 0, 8, 8, 6, 5, 2, 8, 0, 9, 9, 8, 8, 7, 6, 4, 1, 6, 7, 3, 1, 5, 6, 1, 8, 9, 7, 7, 5, 3, 9, 2, 2, 5, 7, 2, 10, 2, 3, 6, 9, 5, 5, 1, 7, 8, 5, 4, 10, 4, 5, 10, 5, 6, 2, 9, 1, 1 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,4 COMMENTS Observation (from Kaprekar) this sequence can be the reverse of 1/109 (A021113) which is recuring and has a period of 108 digits: 0.[009174311926605504587155963302752293577981651376146788 990825688073394495412844036697247706422018348623853211]. - Eric Desbiaux, Oct 28 2008 LINKS Primes.utm.edu, Sum of 11^n*10^n [From Eric Desbiaux, Oct 28 2008] MATHEMATICA f[0] = 0; f[1] = f[2] = 1; f[n_] := f[n] = Block[{k}, If[f[n - 2] + f[n - 3] >= 10, k = 1, k = 0]; Mod[f[n - 1] + f[n - 2], 10] + k]; Table[ f[n], {n, 0, 100} ] CROSSREFS Cf. A000045. Sequence in context: A105955 A003893 A152303 * A246558 A098906 A007887 Adjacent sequences:  A064734 A064735 A064736 * A064738 A064739 A064740 KEYWORD easy,nonn AUTHOR Robert G. Wilson v, Oct 17 2001 STATUS approved

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

Last modified February 17 17:12 EST 2019. Contains 320222 sequences. (Running on oeis4.)