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.

A297964 a(n) = A296220(n) - 4n.

Original entry on oeis.org

1, -2, 2, 1, 0, -1, -2, -3, -3, -2, -2, -1, -1, 0, 0, 1, 1, 2, 2, 3, 2, 2, 3, 2, 1, 1, 2, 1, 1, 2, 1, 0, 0, 1, 0, 0, 1, 0, -1, -1, 0, -1, -1, 0, -1, -2, -2, -1, -2, -2, -1, -2, -3, -3, -2, -3, -3, -2, -3, -4, -4, -3, -3, -2, -3, -3, -2, -3, -4, -4, -3, -3
Offset: 0

Views

Author

Clark Kimberling, Jan 10 2018

Keywords

Comments

It has been checked that -9 <= a(n) <= 8 for n=1..6*10^6. Conjectures: every integer appears infinitely many times, and -2 < a(n) - a(n-1) < 2 for n > 2.

Crossrefs

Cf. A296220.

Programs

  • Mathematica
    a[0] = 1; a[1] = 2; b[0] = 3; b[1] = 4;
    a[n_] := a[n] = a[0]*b[n - 1] + a[1]*b[n - 2];
    j = 1; While[j < 20000, k = a[j] - j - 1;
    While[k < a[j + 1] - j + 1, b[k] = j + k + 2; k++]; j++];
    Table[a[n], {n, 0, k}]; (* A296220 *)
    Take[Table[a[n] - 4 n, {n, 0, k}], 300] (* A297964 *)