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.

A093089 "Fibonacci in pairs": start with a(1)=1, a(2)=1; repeatedly adjoin sum of previous two terms but chopped from the right into pairs of 2 digits.

Original entry on oeis.org

1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 1, 44, 90, 45, 1, 34, 1, 35, 46, 35, 35, 36, 81, 81, 70, 71, 1, 17, 1, 62, 1, 51, 1, 41, 72, 18, 18, 63, 63, 52, 52, 42, 1, 13, 90, 36, 81, 1, 26, 1, 15, 1, 4, 94, 43, 14, 1, 3, 1, 26, 1, 17, 82, 27, 27, 16, 16, 5, 98, 1, 37, 57, 15, 4, 4, 27, 27, 18
Offset: 1

Views

Author

Bodo Zinser, Mar 20 2004

Keywords

Comments

Do all pairs of digits appear infinitely often? The sequence is not periodic.

Examples

			... a(11)=a(9)+a(10), a(12)=left pair of (a(10)+a(11)=55+89=1 44), a(13)=right pair of (a(10)+a(11)=55+89=1 44), a(14)=a(11)+a(12) ...
		

Crossrefs