HAL (France)open access
Maximum order complexity of the sum of digits function in Zeckendorf base and polynomial subsequences
Maximum order complexity, Morphic sequences, Pseudorandomness, Zeckendorf expansion, 0
This document is indexed with metadata only — full text is not available in the archive for this record.
Open the official source ↗
Record · ID 288097
Retrieved via
Conceptio — every document is proof-bundled with source, license, and retrieval metadata.