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-2 of 2 results.

A319408 a(n) = A319407(n)/2.

Original entry on oeis.org

1, 5, 2, 10, 23, 11, 4, 20, 45, 97, 46, 22, 51, 23, 8, 40, 89, 189, 90, 194, 399, 195, 92, 44, 101, 217, 102, 46, 107, 47, 16, 80, 177, 373, 178, 378, 775, 379, 180, 388, 797, 1617, 798, 390, 803, 391, 184, 88, 201, 429, 202, 434, 895, 435, 204, 92, 213, 457, 214, 94, 219, 95, 32, 160, 353, 741, 354, 746, 1527, 747
Offset: 1

Views

Author

N. J. A. Sloane, Sep 19 2018

Keywords

Crossrefs

A319409 a(n) = n - A318921(n).

Original entry on oeis.org

0, 1, 2, 2, 4, 5, 5, 4, 8, 9, 10, 10, 10, 12, 11, 8, 16, 17, 18, 18, 20, 21, 21, 20, 20, 23, 25, 24, 22, 26, 23, 16, 32, 33, 34, 34, 36, 37, 37, 36, 40, 41, 42, 42, 42, 44, 43, 40, 40, 45, 48, 46, 50, 52, 51, 48, 44, 51, 55, 52, 46, 54, 47, 32, 64, 65, 66, 66, 68, 69, 69, 68, 72, 73, 74, 74, 74, 76, 75, 72, 80, 81, 82, 82, 84, 85, 85, 84, 84, 87, 89, 88, 86, 90, 87, 80, 80
Offset: 0

Views

Author

N. J. A. Sloane, Sep 19 2018

Keywords

Comments

How much n decreases by when its binary runs are all shortened by one bit.

Crossrefs

Programs

  • PARI
    a(n) = my (p=-1, d=0, b=1, r=n); while (r, my (l=r%2); if (p!=l, p=l, d+=l*b; b*=2); r\=2); n-d \\ Rémy Sigrist, Sep 25 2018

Formula

a(n) = n iff n is a Fibbinary number (A003714). - Rémy Sigrist, Sep 25 2018
Showing 1-2 of 2 results.