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.

A352931 a(n) = A093714(n) - n.

Original entry on oeis.org

0, 1, -1, 1, -1, 1, -1, 3, -1, 3, -2, 2, 4, -4, 4, -4, 6, -3, 3, 1, -5, 3, -5, 5, -5, 1, -1, 3, -5, 5, 1, 5, -5, -1, 3, 5, -7, 5, -5, -1, 3, 5, -7, 5, -5, 5, -1, -3, 3, 5, -9, 1, -5, 5, -5, 1, -1, 3, -5, 5, -3, 1, -1, 3, -5, 5, -3, 1, -1, 3, -5, 7, -3, 7, -1, 1, -5, 5, -4, 2, 4, -6, 4, -4, 4, -8, 8, -4, 8, -4, 0, -4, 0, -2, 4, -2, 4, -8, 4, -4, 6, -4
Offset: 1

Views

Author

N. J. A. Sloane, May 04 2022

Keywords

Comments

From Michael De Vlieger, May 04 2022: (Start)
Zeros in this sequence correspond to fixed points in A093714.
Sequence exhibits intervals where terms have same parity. Parity changes when a run of odd terms in A093714 with even run length occurs. These runs begin with A093714(A351498(k)). Conjecture: the last parity change begins with a(1036044) = -9. (End)
Rival conjecture: The parity changes infinitely often. This would imply that A352932 contains infinitely many terms. - N. J. A. Sloane, May 04 2022

Crossrefs

Programs