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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A093093 "Fibonacci in digits - up and down": start with a(1)=1, a(2)=1; repeatedly adjoin either the sum of the two previous terms (if that sum happens to be odd) or else adjoin digits of the sum of previous two terms (if that sum happens to be even). 0
 1, 1, 2, 3, 5, 8, 13, 21, 3, 4, 2, 4, 7, 6, 6, 11, 13, 1, 2, 17, 2, 4, 1, 4, 3, 19, 19, 6, 5, 5, 7, 2, 2, 3, 8, 25, 11, 1, 0, 1, 2, 9, 4, 5, 11, 33, 3, 6, 1, 2, 1, 1, 3, 11, 13, 9, 1, 6, 4, 4, 3, 6, 9, 7, 3, 3, 2, 4, 1, 4, 2, 4, 2, 2, 1, 0, 7, 1, 0, 8, 7, 9, 15, 1, 6, 1, 0, 6, 5, 6, 5, 5, 6, 6, 6, 4, 3, 1, 7 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 LINKS EXAMPLE ... a(8)=a(6)+a(7), a(9)=left digit of (a(7)+a(8)=13+21=3 4) as 34 is even, a(10)=right digit of (a(7)+a(8)=13+21=3 4) as 34 is even, a(13)=a(9)+a(10) as odd, ... CROSSREFS Cf. A093086 to A093092. Sequence in context: A100582 A193616 A273715 * A345095 A281408 A327451 Adjacent sequences:  A093090 A093091 A093092 * A093094 A093095 A093096 KEYWORD nonn,base AUTHOR Bodo Zinser, Mar 20 2004 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 January 23 10:11 EST 2022. Contains 350510 sequences. (Running on oeis4.)