Generate Fibonacci words, study symbol frequencies, and explore infinite sequence properties.
S0: b S1: a S2: ab S3: aba S4: abaab S5: abaababa S6: abaababaabaab S7: abaababaabaababaababa
A Fibonacci Word is generated by string concatenation: S(n) = S(n-1) + S(n-2)
S(n) = S(n-1) + S(n-2)
Starting with S₀="b" and S₁="a", each term concatenates the previous two words.
The character frequency ratio converges to the Golden Ratio φ ≈ 1.61803398...
String length grows exponentially. Keep terms under 15 to avoid browser crash. The word is always binary containing only the two starting symbols.