The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A287790 {0->001, 1->110}-transform of the infinite Fibonacci word A003849. 3

%I

%S 0,0,1,1,1,0,0,0,1,0,0,1,1,1,0,0,0,1,1,1,0,0,0,1,0,0,1,1,1,0,0,0,1,0,

%T 0,1,1,1,0,0,0,1,1,1,0,0,0,1,0,0,1,1,1,0,0,0,1,1,1,0,0,0,1,0,0,1,1,1,

%U 0,0,0,1,0,0,1,1,1,0,0,0,1,1,1,0,0,0

%N {0->001, 1->110}-transform of the infinite Fibonacci word A003849.

%H Clark Kimberling, <a href="/A287790/b287790.txt">Table of n, a(n) for n = 1..10000</a>

%e As a word, A003849 = 0100101001001010010100100..., and replacing each 0 by 001 and each 1 by 110 gives 00111000100111000111000100111000100...

%t s = Nest[Flatten[# /. {0 -> {0, 1}, 1 -> {0}}] &, {0}, 10] (* A003849 *)

%t w = StringJoin[Map[ToString, s]]

%t w1 = StringReplace[w, {"0" -> "001", "1" -> "110"}]

%t st = ToCharacterCode[w1] - 48 (* A287790 *)

%t Flatten[Position[st, 0]] (* A287791 *)

%t Flatten[Position[st, 1]] (* A287792 *)

%Y Cf. A287791, A287792.

%K nonn,easy

%O 1

%A _Clark Kimberling_, Jun 03 2017

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

Last modified January 20 14:26 EST 2020. Contains 331094 sequences. (Running on oeis4.)