cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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).

Original entry on oeis.org

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
Offset: 1

Views

Author

Bodo Zinser, Mar 20 2004

Keywords

Examples

			... 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