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.

A175480 a(1)=1. For n >= 1, if a(n) = 1, then append to the sequence the digits of binary n+1 (most significant digits first and least significant digits last). If a(n) = 0, then append to the sequence the digits of binary n+1 in reverse order (least significant digits first and most significant digits last).

Original entry on oeis.org

1, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 0, 1, 1, 0, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0
Offset: 1

Views

Author

Leroy Quet, May 25 2010

Keywords

Crossrefs

Cf. A175479.

Programs

  • PARI
    a=[1]; for (n=1, 84, print1 (a[n] ", "); if (#a<84, a=concat(a, if (a[n], binary(n+1), Vecrev(binary(n+1)))))) \\ Rémy Sigrist, Nov 08 2018

Extensions

Definition fixed by Leroy Quet, May 28 2010