The algorithm used here suggests multiple variations such as using more than 2 bits, allowing overlap of successive subwords, using other numbers for the encoding of subwords or using other binary sequences. (E.g. overlapping: a(n)=2*A005614(n)+A005614(n+1) )
FORMULA
f=(sqrt(5)-1)/2; m=2*n; a(n)=floor(m*f)-2*floor((m-1)*f)+floor((m+1)*f); OR Using a previously generated Fibonacci word = A005614 : a(n)=2*A005614(2n-1)+A005614(2n)
EXAMPLE
a(1)=2*1+0=2
a(2)=2*1+1=3
a(3)=2*0+1=1
PROGRAM
f=(sqrt(5)-1)/2; m=2*n; a(n)=floor(m*f)-2*floor((m-1)*f)+floor((m+1)*f); OR Using a previously generated Fibonacci word = A005614 : a(n)=2*A005614(2n-1)+A005614(2n)
