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.

A173923 In the sequence of nonnegative integers substitute all n by 2^floor(n/8) occurrences of (n mod 2).

Original entry on oeis.org

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

Views

Author

Reinhard Zumkeller, Mar 04 2010

Keywords

Comments

a(n) = A173920(n+8,8).
a(n) = A000035(A132292(A030101(n+8)+1)).

Crossrefs

Programs

  • Mathematica
    Table[PadRight[{},2^Floor[n/8],Mod[n,2]],{n,0,30}]//Flatten (* Harvey P. Dale, Aug 07 2021 *)

Extensions

Sequence definition changed for clarity (see A173922).