{"version":9,"randomSeed":"e469eee3a9406c313924d6d9f93aa983","graph":{"viewport":{"xmin":-1.4822467371694175,"ymin":-1.6782989545118205,"xmax":44.03997690481441,"ymax":29.86512376155696}},"expressions":{"list":[{"type":"text","id":"11","text":"Fibonacci numbers"},{"type":"expression","id":"6","color":"#000000","latex":"F=\\left[1,1,2,3,5,8,13,21,34\\right]"},{"type":"text","id":"9","text":"extract bit n of x"},{"type":"expression","id":"7","color":"#c74440","latex":"S\\left(x,n\\right)=\\operatorname{mod}\\left(\\operatorname{floor}\\left(\\frac{x}{2^{n}}\\right),2\\right)"},{"type":"text","id":"13","text":"binary to Fibonacci sum"},{"type":"expression","id":"14","color":"#000000","latex":"Z\\left(x\\right)=\\sum_{k=0}^{F.\\operatorname{length}-2}S\\left(x,k\\right)F\\left[k+2\\right]"}]}}