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.

A103585 Consider numbers k such that (A102370(k)-k)/2 = 1; read them mod 4 to get the sequence.

Original entry on oeis.org

1, 3, 3, 1, 3, 3, 1, 3, 3, 1, 3, 1, 3, 3, 1, 3, 3, 1, 3, 3, 1, 3, 1, 3, 3, 1, 3, 3, 1, 3, 3, 1, 3, 1, 3, 3, 1, 3, 3, 1, 3, 3, 3, 1, 3, 3, 1, 3, 3, 1, 3, 3, 1, 3, 1, 3, 3, 1, 3, 3, 1, 3, 3, 1, 3, 1, 3, 3, 1, 3, 3, 1, 3, 3, 1, 3, 1, 3, 3, 1, 3, 3, 1, 3, 3, 3, 1, 3, 3, 1, 3, 3, 1, 3, 3, 1, 3, 1, 3
Offset: 1

Views

Author

Keywords

Comments

Is there a self-contained construction of this two-valued sequence?
Sequence appears to have period 43. - Ralf Stephan, May 18 2007

Examples

			The numbers k are 1, 3, 7, 9, 11, 15, 17, 19, ...
		

Crossrefs