Pages that link to "Item:Q2020439"

The following pages link to Subword complexity of the Fibonacci-Thue-Morse sequence: the proof of Dekking's conjecture (Q2020439):

Displayed 2 items.

• Maximum order complexity of the sum of digits function in Zeckendorf base and polynomial subsequences (Q2121010) ‎ (← links)
• Note on a Fibonacci parity sequence (Q6159442) ‎ (← links)