On Some Properties of the Hofstadter–Mertens Function

Pavel Trojovský

Complexity, 2020, vol. 2020, 1-6

Abstract:

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 Hofstadter sequence , defined (for ) by , where µ ( 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†.

Date: 2020
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/8503/2020/1816756.pdf (application/pdf)
http://downloads.hindawi.com/journals/8503/2020/1816756.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:complx:1816756

DOI: 10.1155/2020/1816756

Access Statistics for this article

More articles in Complexity from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().