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.

A272728 a(n) = A272727(2n-1) - n.

Original entry on oeis.org

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

Views

Author

Ivan Neretin, May 05 2016

Keywords

Comments

a(n)>=0.
|a(n+1)-a(n)|=1.
All local minima occur where a(n)=0. Values at the local maxima are listed in A272729.
Empirically: The least n such that a(n) = k - 1 is n = 2^k - k. - Danny Rorabaugh, May 12 2016

Crossrefs

Programs

  • Mathematica
    nn = 120; s = Nest[Append[#, Count[# - Reverse[#], x_ /; x == 0]] &, {0}, 2 nn - 1]; Table[s[[2 n]] - n, {n, nn}] (* Michael De Vlieger, May 05 2016, after Ivan Neretin at A272727 *)