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.

A276438 a(n) = (A274647(n)-A274647(n-1)) / n.

Original entry on oeis.org

1, 1, 1, -1, 1, 1, 1, -1, 1, -1, 1, -1, 1, -1, 1, -1, 1, 1, 1, -1, 1, -1, -1, 2, 1, -1, -1, 2, 1, -1, 1, -1, -1, 2, 1, -1, -1, -1, 1, -1, 2, 1, -1, -1, 2, 1, -1, -1, -1, -1, 1, -1, 1, -1, 1, -1, 1, 1, 1, -1, 1, -1, -1, 2, 1, -1, -1, -1, 1, -1, 1, 1, 1, -1, -1, -1, 1, -1, 2, 1, -1, 1, -1, -1, -1, 1, 1, 1, -1, 1, 1, 1, -1
Offset: 1

Views

Author

Antti Karttunen, Sep 04 2016

Keywords

Comments

a(n) tells what k was finally used when determining the value of A274647(n), with minus sign if subtraction was chosen and with positive sign if addition was chosen.
First 1 occurs at n=1, first 2 at n=24, first 3 at n=128, first 4 at n=204, first 5 at n=17903, first 6 at n=210027.
First -1 occurs at n=4, first -2 at n=124, first -3 at n=5882.

Crossrefs

Cf. A274647.
Cf. A276439 (partial sums).

Programs

Formula

a(n) = (A274647(n)-A274647(n-1)) / n.