How to code binary Fibonacci sequence?

I was asked to code the binary fibonacci sequence which outputs the following: f_0={0}, f_1={1} where the successive elements of the sequence are obtained as the concatenation of the two previous ones: f_k = {f_{k-1} f_{k-2}} with k>1

f_2={1 0}

f_3={1 0 1}

f_4={1 0 1 1 0}

f_5={1 0 1 1 0 1 0 1}

f_6={1 0 1 1 0 1 0 1 1 0 1 1 0}, ...

To concatenate, I think I have to use the horzcat function. Can anyone help me with this?

Answer 1

[Catalytic]

"where the successive elements of the sequence are obtained as the concatenation of the two previous ones"

No, see -

https://en.wikipedia.org/wiki/Fibonacci_number

[Lope]

Hi @Catalytic. This is what they want me to do:

https://www.fq.math.ca/Papers1/55-5/Allouche.pdf

[Catalytic]

n=4;

a=0;b=1;
for i=1:n
    c=[b,a]
    
    [a,b]=deal(b,c);
    
end

c = 1×2

1 0

c = 1×3

1 0 1

c = 1×5

1 0 1 1 0

c = 1×8

1 0 1 1 0 1 0 1

[Lope]

Thank you so much @Catalytic