On some properties of the Hofstadter-Mertens function
Summary: Many mathematicians have been interested in the study of recursive sequences. Among them, a class of ``chaotic sequences are named ``meta-Fibonacci sequences. The main example of meta-Fibonacci sequence was introduced by Hofstadter, and it is called the \(Q\)-sequence. Recently, Alkan-Fox-Aybar and the author studied the pattern induced by the connection between the \(Q\)-sequence and other known sequences. Here, we continue this program by studying a ``Mertens' version of the \textit{Hofstadter sequence}, defined (for \(x>0)\) by \(x\mapsto\sum_{n \leq x} \mu (n) Q (n)\), where \(\mu (n)\) is the Möbius function. In particular, as we shall see, this function encodes many interesting properties which relate prime numbers to ``meta-sequences.
- Constructing new families of nested recursions with slow solutions
- Disproof of the Mertens conjecture.
- scientific article; zbMATH DE number 3064333 (Why is no real title available?)
- On a conjecture about generalized \(Q\)-recurrence
- On a generalization of Hofstadter's Q-sequence: a family of chaotic generational structures
- On Hofstadter heart sequences
- On some properties of a meta-Fibonacci sequence connected to Hofstadter sequence and Möbius function
- Spot-based generations for meta-Fibonacci sequences
This page was built for publication: On some properties of the Hofstadter-Mertens function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2210265)
