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.

A123594 Unique sequence of 0's and 1's which are either repeated or not repeated with the following property: when the sequence is 'coded' in writing down a 1 when an element is repeated and a 0 when it is not repeated and by putting the initial element in front of the sequence thus obtained, the above sequence appears.

Original entry on oeis.org

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

Views

Author

Emmanuel Vantieghem, Nov 14 2006

Keywords

Crossrefs

Cf. A000002.

Programs

  • Mathematica
    a = {1, 1, 0}; i = 2; Label[be]; i += 1; t = Part[a, i]; If[t == 0, b = {a, 1 - Part[a, Length[a]]}; a := Flatten[b], b = {a, Part[a, Length[a]]}; a := Flatten[b]; b = {a, 1 - Part[a, Length[a]]}; a := Flatten[b]]; If[i > 1000, Print[a], Goto[be]]

Formula

a(n+2) = A000002(n)-1. - Danny Rorabaugh, Mar 04 2015