A181632 - OEIS

A181632

The Fibonacci Champernowne sequence.

0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1

(list; graph; refs; listen; history; text; internal format)

OFFSET

0,1

COMMENTS

Uses Fibonacci Maximal notation: headings are (..., 13, 8, 5, 3, 2, 1) filling in terms from the right.

Minimal notation fills in from the left. 8 in Fibonacci Maximal = (1011) = (5 + 2 + 1), whereas 8 in Minimal = (1100) = (5 + 3).

LINKS

Table of n, a(n) for n=0..104.

FORMULA

Write n in Fibonacci Maximal notation and juxtapose.

EXAMPLE

First few segregated Fibonacci terms (0-6) = (0, 1, 10, 11, 101, 110, 111);