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.

Showing 1-1 of 1 results.

A283468 a(n) = A004001(A004001(n-1)) - A004001(n-A004001(n-1)), a(1) = a(2) = 1.

Original entry on oeis.org

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

Views

Author

Antti Karttunen, Mar 18 2017

Keywords

Comments

The only negative terms seem to be -1's, occurring as a(1+(2^n)), for n >= 2.

Crossrefs

Cf. A004001, A080677, A283471 (positions of zeros), A283469, A283470, A283472.
Cf. also A283655.

Programs

Formula

a(1) = a(2) = 1; for n > 2, a(n) = A004001(A004001(n-1)) - A004001(A080677(n-1)).
Showing 1-1 of 1 results.