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.

A335699 Irregular tree read by rows: take the Stern-Brocot tree A007305(n)/A007306(n) and set a(n) = A007306(n) - A007305(n) mod 3.

Original entry on oeis.org

1, 0, 1, 2, 1, 0, 0, 2, 1, 1, 2, 2, 1, 0, 0, 2, 1, 2, 1, 2, 1, 1, 2, 1, 2, 1, 2, 2, 1, 0, 0, 2, 1, 0, 0, 2, 1, 2, 1, 0, 0, 0, 0, 1, 2, 1, 2, 0, 0, 2, 1, 2, 1, 1, 2, 1, 2, 1, 2, 2, 1, 0, 0, 2, 1, 1, 2, 2, 1, 0, 0, 2, 1, 2, 1, 0, 0, 2
Offset: 0

Views

Author

N. J. A. Sloane, Aug 05 2020

Keywords

Examples

			The initial rows of the tree are 1,0 // 1 // 2,1 // 0,0,2,1 // 1,2,2,1,0,0,2,1 // ...
		

Crossrefs