{"version":9,"randomSeed":"3ce9e69d0f5eb28dcbbc8aa66235e75a","graph":{"viewport":{"xmin":-1.4849876279321015,"ymin":-1.0600766702076738,"xmax":2.1778672428432486,"ymax":2.7887109155041814}},"expressions":{"list":[{"type":"text","id":"23","text":"based on \"On Conway's generalization of the 3x + 1 problem\""},{"type":"text","id":"25","text":"https://core.ac.uk/download/pdf/232757728.pdf"},{"type":"folder","id":"5","title":"data","collapsed":true},{"type":"expression","id":"27","folderId":"5","color":"#6042a6","latex":"S=\\left[8428924820453\\right]"},{"type":"text","id":"10","text":"reset"},{"type":"expression","id":"1","color":"#c74440","latex":"S\\to\\left[8428924820453\\right]"},{"type":"text","id":"12","text":"Collatz transform"},{"type":"expression","id":"13","color":"#6042a6","latex":"C\\left(n\\right)=\\left\\{\\operatorname{mod}\\left(n,2\\right)=1:3n+1,\\frac{n}{2}\\right\\}","hidden":true},{"type":"text","id":"20","text":"display"},{"type":"expression","id":"21","color":"#000000","latex":"\\operatorname{histogram}\\left(S\\right)","vizProps":{"histogramMode":"relative"}}],"ticker":{"handlerLatex":"S\\to\\operatorname{join}\\left(C\\left(S\\left[1\\right]\\right),S\\left[2...\\right],\\operatorname{mod}\\left(S\\left[1\\right],2\\right)\\right)","minStepLatex":"100","open":true}}}