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.

A268672 a(n) = n - A268395(n).

Original entry on oeis.org

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

Views

Author

Antti Karttunen, Feb 10 2016

Keywords

Comments

It seems that the sequence stays strictly positive after a(0).
Only 1 seems to be at a(1).
2's occur in this sequence at least in the following positions: 2, 3, 5, 6, 17, 18, 20, 257, 258, 260, 272, 65537, 65538, 65540, 65552, 65792, and in no other location up to 2^21.
See also comments in A268708.

Crossrefs

Cf. A268713 (record positions).

Programs

Formula

a(n) = n - A268395(n).