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.

Previous Showing 21-21 of 21 results.

A076902 a(1)=1, a(n) = floor(n/2) - a(floor(n/2)).

Original entry on oeis.org

1, 0, 0, 2, 2, 3, 3, 2, 2, 3, 3, 3, 3, 4, 4, 6, 6, 7, 7, 7, 7, 8, 8, 9, 9, 10, 10, 10, 10, 11, 11, 10, 10, 11, 11, 11, 11, 12, 12, 13, 13, 14, 14, 14, 14, 15, 15, 15, 15, 16, 16, 16, 16, 17, 17, 18, 18, 19, 19, 19, 19, 20, 20, 22, 22, 23, 23, 23, 23, 24, 24, 25, 25, 26, 26, 26, 26
Offset: 1

Views

Author

Benoit Cloitre, Nov 26 2002

Keywords

Crossrefs

Formula

a(n) is asymptotic to n/3; conjecture: abs(a(n)-n/3) < log(n+1).
a(n) = A068639(n) - A065359(n) + (-1)^floor(log_2(n)) = A050292(n) - A068639(n) + (-1)^floor(log_2(n)). - Ralf Stephan, Oct 27 2003
Previous Showing 21-21 of 21 results.