On Some Properties of the Hofstadter–Mertens Function

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...

Full description

Bibliographic Details
Main Author: Pavel Trojovský
Format: Article
Language:English
Published: Hindawi-Wiley 2020-01-01
Series:Complexity
Online Access:http://dx.doi.org/10.1155/2020/1816756
id doaj-ca43ed748a0a4c76bac7e3dceb62dd4f
record_format Article
spelling doaj-ca43ed748a0a4c76bac7e3dceb62dd4f2020-11-25T01:23:06ZengHindawi-WileyComplexity1076-27871099-05262020-01-01202010.1155/2020/18167561816756On Some Properties of the Hofstadter–Mertens FunctionPavel Trojovský0Department of Mathematics, Faculty of Science, University of Hradec Králové, Rokitanského 62, Hradec Králové, Czech RepublicMany 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 x>0) by x↦∑n≤xμnQn, 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”.http://dx.doi.org/10.1155/2020/1816756
collection DOAJ
language English
format Article
sources DOAJ
author Pavel Trojovský
spellingShingle Pavel Trojovský
On Some Properties of the Hofstadter–Mertens Function
Complexity
author_facet Pavel Trojovský
author_sort Pavel Trojovský
title On Some Properties of the Hofstadter–Mertens Function
title_short On Some Properties of the Hofstadter–Mertens Function
title_full On Some Properties of the Hofstadter–Mertens Function
title_fullStr On Some Properties of the Hofstadter–Mertens Function
title_full_unstemmed On Some Properties of the Hofstadter–Mertens Function
title_sort on some properties of the hofstadter–mertens function
publisher Hindawi-Wiley
series Complexity
issn 1076-2787
1099-0526
publishDate 2020-01-01
description 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 x>0) by x↦∑n≤xμnQn, 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”.
url http://dx.doi.org/10.1155/2020/1816756
work_keys_str_mv AT paveltrojovsky onsomepropertiesofthehofstadtermertensfunction
_version_ 1715784096389529600