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

Offset: 0

Author

Gary W. Adamson, Nov 02 2010

Keywords

• nonn
• base

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).

Examples

			First few segregated Fibonacci terms (0-6) = (0, 1, 10, 11, 101, 110, 111);
so the juxtaposed string begins (0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1,...).
		

Crossrefs

Cf. A030190, A181630, A181631.

Programs

Mathematica

Flatten[DeleteCases[IntegerDigits[-1 + Range[200], 2], {_, 0, 0, _}]]
(* Peter J. C. Moses, Mar 03 2015 *)

Formula

Write n in Fibonacci Maximal notation and juxtapose.