login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A181632 The Fibonacci Champernowne sequence. 1
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
FORMULA
Write n in Fibonacci Maximal notation and juxtapose.
EXAMPLE
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,...).
MATHEMATICA
Flatten[DeleteCases[IntegerDigits[-1 + Range[200], 2], {___, 0, 0, ___}]]
(* Peter J. C. Moses, Mar 03 2015 *)
CROSSREFS
Sequence in context: A368915 A144610 A188068 * A105565 A332814 A353788
KEYWORD
nonn,base
AUTHOR
Gary W. Adamson, Nov 02 2010
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 15 00:51 EDT 2024. Contains 371667 sequences. (Running on oeis4.)