On Some Properties of the Hofstadter-Mertens Function
Explore this paper's citation graph
Summary
This program studies a “Mertens’ version” of the Hofstadter sequence, defined (for x>0) by x↦∑n≤xμnQn, where µ(n) is the Möbius function, and encodes many interesting properties which relate prime numbers to “meta-sequences”.
- Type
- article
- Published
- 2020-09-15
- Cited by
- 0
- References
- 11
- Access
- Open access
- OpenAlex
- https://openalex.org/W3084687788
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:224943760
Keywords
Algorithm, Sequence (biology), Computer science, Artificial intelligence, Chemistry
References
- Spot-Based Generations for Meta-Fibonacci Sequences
- Constructing New Families of Nested Recursions with Slow Solutions
- Disproof of the Mertens conjecture.
- On Hofstadter Heart Sequences
- On a Generalization of Hofstadter's Q-Sequence: A Family of Chaotic Generational Structures
- On a conjecture about generalized Q-recurrence
- Order and chaos in Hofstadter's Q(n) sequence
- On some properties of a meta-Fibonacci sequence connected to Hofstadter sequence and Möbius function
Cited by
Related papers
- Remarks on Algorithm 2, Algorithm 3, Algorithm 15, Algorithm 25 and Algorithm 26
- Remarks on Algorithm 332: Jacobi polynomials: Algorithm 344: student's t-distribution: Algorithm 351: modified Romberg quadrature: Algorithm 359: factoral analysis of variance
- Using DataGrid Control to Realize DataBase of Querying in VB6.0
- Study and Two Types of Typical Usage of DataGrid Web Server Control
- PACWON: A parallelizing compiler for workstations on a network
- Bidirectional Sort and Choosing a Row to Update or Delete by Click Any Cell in DataGrid
- Flexible Application of VSFlexGrid
- GMQL: A graphical multimedia query language