On a conjecture about generalized Q-recurrence

Altug Alkan

doi:10.1515/math-2018-0124

Enjoy 40% off

academic books on De Gruyter Brill *

Article Open Access

On a conjecture about generalized Q-recurrence

Altug Alkan

Published/Copyright: December 31, 2018

Published by

Become an author with De Gruyter Brill

Submit Manuscript Author Information Explore this Subject

$Open Mathematics$

From the journal Open Mathematics Volume 16 Issue 1

Abstract

Chaotic meta-Fibonacci sequences which are generated by intriguing examples of nonlinear recurrences still keep their mystery although substantial progress has been made in terms of well-behaved solutions of nested recurrences. In this study, a recent generalization of Hofstadter’s famous Q-sequence is studied beyond the known methods of generational approaches in order to propose a generalized conjecture regarding the existence of infinitely many different solutions for all corresponding recurrences of this generalization.

Keywords: Hofstadter Q-recurrence; Meta-Fibonacci Sequences; Nonlinear recurrences

MSC 2010: 11B37

1 Introduction

Since substantial experimental studies have been done by Hofstadter and Huber on certain meta-Fibonacci sequences which are inspired by original Q-sequence that is defined by Q(n) = Q(n−Q(n−1))+Q(n−Q(n− 2)) with initial conditions Q(1) = Q(2) = 1 [1], there is a wide variety of significant contributions which are mainly focused on nested recurrence relations in theoretical and empirical literature [2, 3, 4, 5, 6, 7, 8, 9, 10]. While empirical works try to find order signs and some patterns in chaotic meta-Fibonacci sequences, theoretical literature mainly focuses on properties of slow and quasi-periodic solutions for various types of nested recursions and some curious concepts such as binary trees and undecidability [11, 12, 13,]. Despite the complexity of many inquiries which these contributions have, an essential and natural question about a meta-fibonacci sequence is whether it is defined for all indices [14, 15,]. It is well-known that properties of solutions to meta-Fibonacci recursions can differ extremely and the answer of this question strongly depends on the selection of initial conditions in general [16]. While modified nested recurrences can exhibit different properties of solutions with the same initial conditions, a selected recurrence can also show dissimilar behaviours under certain initial condition sets [17, 18]. For example, let us define Q(1) = Q(2) = Q(3) = 1, Q(4) = 4, Q(5) = 3, and for n ≥ 5, Q(n) = Q(n − Q(n − 1)) + Q(n − Q(n − 2)) + Q(n − Q(n − 3)), that is A296413 in OEIS [19]. This sequence is highly chaotic and finite since Q(509871) = 519293. On the other hand, the same recurrence can have slow solution with appropriate initial conditions [20] while it can be naturally quasi-periodic for certain set of initial conditions such as A296518 and A296786 in OEIS [21]. Also, intriguing generational structures which are analysed by spot-based generation concept appear with a family of initial conditions for Q(n) = Q(n − Q(n − 1)) + Q(n − Q(n − 2)) + Q(n − Q(n − 3)) [21]. This behavioral diversity observed in three-term Hofstadter Q-recurrence can be interpreted as a sign of difficulty of problems about certain types of nested recurrences, especially for Hofstadter-like recurrences. On the other hand, the coexistence of order and chaos in some unpredictable meta-Fibonacci sequences can be recreated experimentally thanks to inital condition patterns in terms of considerable behavioral similarities. At this point, it would be beneficial to remember the definition of a generalization of Hofstadter’s Q-sequence [21].

Definition 1.1

Let Q_d_,ℓ(n) be defined by the recurrenceQd,ℓ(n)=∑i=1ℓQd,ℓ(n−Qd,ℓ(n−i))forn>d⋅ℓ,ℓ≥2

d ≥ 1, with the initial conditionsQd,ℓ(n)=⌈n⋅(ℓ−1)ℓ⌉for 1 ≤ n ≤ d · ℓ.

Recently, the chaotic generational structures of certain members of Q_d_,2(n) and Q_d_,3(n) were investigated thanks to known methods in empirical literature [21, 22, 23,] in order to search a conjectural global property for rescaling of amplitudes of successive generations. On the other hand, for ascending values of d and ℓ, behaviours of Q_d_,ℓ(n) become much more complicated as well as conserving their interesting properties which are reported in the following sections. At the same time, in order to strengthen and support our intuitive approach on nature of initial conditions for Q_d_,ℓ(n), it can be beneficial to observe behaviours of similar initial condition formulation with a provable example.

This paper is structured as follows. In Section 1.1, we give brief notes about an intriguing example of provable solution family in order to support the naturalness of our intuition. In Section 2, we prove some properties of Q_d_,ℓ(n) for increasing values of ℓ. Then, in Section 3, we do experiments for larger values of d and ℓ while in Section 4, we propose a conjecture thanks to results that Section 2 and Section 3 provide. Finally, related concluding remarks are offered in Section 5.

1.1 A motivational new generalization to beginning

In this section, we observe the potential of initial condition patterns in order to construct infinitely many different solutions for a selected nested recurrence. Although sequences that we focus on in next sections are not slow, this part suggests that infinitely many different solutions that have strong behavioral similarities can be really constructed with the formulation of initial conditions, at least for certain recurrences. It is well-known that Newman generalization on Hofstadter-Conway $10000 sequence (A004001 in OEIS) provides a variety of interesting results that Fibonacci-type behaviours appear in their generational analysis [23, 24, 25,]. However, we will generalize Hofstadter-Conway $10000 sequence thanks to its asymptotic property which is proved by Conway [24]. In order to eliminate duplicate sequences, we define them as below. Note that a₁(n) is Conway’s original sequence.

Definition 1.2

Let a_i(n) = a_i(a_i(n −1))+a_i(n −a_i(n −1)) for n > 4. i, with the initial conditionsai(n)=⌈n2⌉for 1 ≤ n ≤ 4 · i.

Proposition 1.3

ai(n+1)−ai(n)∈{0,1}for all n, i ≥ 1 and a_i(n) hits every positive integer for all i ≥ 1.

Proposition 1.4

ai(n)≥n2forall i≥1.

Both propositions are easy to prove by induction since initial conditions of the form⌈n2⌉provide necessary and sufficient basis to this aim. Based on these basic properties, see Figure 1 in order to observe certain members ofai(n)−n2.While it provides a fractal-like collection of fractal-like sequences, it clearly suggests that this is a new and natural generalization which perfectly guarantees the existence of infinitely many different solutions and our approach can be potentially applied for some other recurrences. In next sections we search for the signs of some similar behaviours in terms of existence of solutions for Q _d_,ℓ(n) with the stability of noise levels, although their chaotic nature prevents the perfection which a_i(n) exhibits.

$Fig. 1 a2t(n)−n2for212≤n≤213$a_{2^t}(n) - \frac{n}{2} for\, 2^{12} \leq n \leq 2^{13}$and 0 ≤ t ≤ 7, respectively.$

Fig. 1

a2t(n)−n2for212≤n≤213and 0 ≤ t ≤ 7, respectively.

2 **On termination of Q_d_,_ℓ(n) forℓ≥ 3**

In this section, an existence of breaking point for termination of Q _d_,ℓ(n) is investigated. It is a relatively easy fact that Q_2,3(n) is a finite sequence due to Q_2,3(66) = 73 [21]. On the other hand, our following analysis confirms that the termination of Q_2,3(n) is an exceptional behaviour for Q_d_,ℓ(n), at least, in the range of experiments that the next section focuses on.

Proposition 2.1

Q_d_,ℓ(n) dies ford<ℓ⋅(ℓ−1)−1+(−1)ℓ2where ℓ ≥ 3.

Proof. It is clear that if Q_d_,ℓ(d · ℓ + 1) > d · ℓ + 1, then Q_d_,ℓ(n) dies immediately thereafter. SinceQd,ℓ(n)=n⋅(ℓ−1)ℓfor n ≤ d · ℓ,

Qd,ℓ(d⋅ℓ+1−i)=(d⋅ℓ+1−i)⋅(ℓ−1)ℓ=d⋅ℓ+1−(d+i)+i−1ℓ=d⋅ℓ+1−(d+i)+i−1ℓ

for 1 ≤ i ≤ d · ℓ.

So Q_d_,ℓ(d · ℓ + 1) can be expressed as follows:

Qd,ℓ(d⋅ℓ+1)=∑i=1ℓQd,ℓ(d⋅ℓ+1−Qd,ℓ(d⋅ℓ+1−i))=∑i=1ℓQd,ℓd⋅ℓ+1−d⋅ℓ+1−(d+i)+i−1ℓ=∑i=1ℓQd,ℓd+i−i−1ℓ=Qd,ℓ(d+1)+∑i=1ℓ−1Qd,ℓ(d+i)=(d+1)⋅(ℓ−1)ℓ+∑i=1ℓ−1(d+i)⋅(ℓ−1)ℓ=d+1−d+1ℓ+∑i=1ℓ−1(d+i)−∑i=1ℓ−1d+iℓ=d⋅ℓ+1+ℓ⋅(ℓ−1)2−d+1ℓ−∑i=1ℓ−1d+iℓ.

So, the inequality Q_d_,ℓ(d · ℓ + 1) > d · ℓ + 1 is equivalent to the inequality

(1)d+1ℓ+∑i=1ℓ−1d+iℓ<ℓ⋅(ℓ−1)2.

Ifd=ℓ⋅(ℓ−1)2in Inequality 1, total value of ℓ terms of the left side isℓ⋅(ℓ−1)2for l ≥ 3, and the inequality is not satisfied. Note thatℓ⋅(ℓ−1)2≡0(mod ℓ) if ℓ is odd andℓ⋅(ℓ−1)2≡ℓ2(mod ℓ) if ℓ is even. So, ifd=ℓ⋅(ℓ−1)2−1,the left side decreases fromℓ⋅(ℓ−1)2if ℓ is even (thereby satisfying the inequality), but the left side does not change from before if ℓ is odd. In the odd case, ifd=ℓ⋅(ℓ−1)2−2,the left side would decrease, though. So, if ℓ is odd, the largest value of d that satisfies Inequality 1 isℓ⋅(ℓ−1)2−2,and if ℓ is even, the largest value of d that satisfies Inequality 1 isℓ⋅(ℓ−1)2−1.These two cases can be combined into one inequality:d<ℓ⋅(ℓ−1)−1+(−1)ℓ2.

Proposition 2.2

Qd,ℓ(d⋅ℓ+2)=d⋅(ℓ−1)+⌊(ℓ+3)2⌋ford=ℓ⋅(ℓ−1)−1+(−1)ℓ2where ℓ ≥ 5.

Proof. We follow similar steps with previous proof thanks to its result. So Q_d_,ℓ(d · ℓ + 2) can be expressed as follows:

Qd,ℓ(d⋅ℓ+2)=∑i=1ℓQd,ℓ(d⋅ℓ+2−Qd,ℓ(d⋅ℓ+2−i))=Qd,ℓ(d⋅ℓ+2−Qd,ℓ(d⋅ℓ+1))+∑i=2ℓQd,ℓ(d⋅ℓ+2−Qd,ℓ(d⋅ℓ+2−i))=Qd,ℓ(1)+∑i=2ℓQd,ℓd⋅ℓ+2−d⋅ℓ+2−(d+i)+i−2ℓ=1+∑i=2ℓQd,ℓd+i−i−2ℓ=1+Qd,ℓ(d+2)+∑i=2ℓ−1Qd,ℓ(d+i)=1+(d+2)⋅(ℓ−1)ℓ+∑i=2ℓ−1(d+i)⋅(ℓ−1)ℓ=d+3−d+2ℓ+∑i=2ℓ−1(d+i)−∑i=2ℓ−1d+iℓ=d⋅(ℓ−1)+2+ℓ⋅(ℓ−1)2−d+2ℓ−∑i=2ℓ−1d+iℓ.

Sinced+1ℓ=d+2ℓfor l ≥ 5 andd=ℓ⋅(ℓ−1)−1+(−1)ℓ2,from Proposition 2.1,

(2)ℓ⋅(ℓ−1)2−d+2ℓ−∑i=2ℓ−1d+iℓ=d+1ℓ.

Thanks to Equation 2, Q_d_,ℓ(d · ℓ + 2) can be expressed as follows for l ≥ 5,

Qd,ℓ(d⋅ℓ+2)=d⋅(ℓ−1)+2+d+1ℓ=d⋅(ℓ−1)+2+ℓ⋅(ℓ−1)−1+(−1)ℓ2+1ℓ=d⋅(ℓ−1)+⌊(ℓ+3)2⌋.

Proposition 2.3

Qd,ℓ(d⋅ℓ+3)=d⋅(ℓ−1)+7+(−1)ℓ+12ford=ℓ⋅(ℓ−1)−1+(−1)ℓ2where ℓ ≥ 7.

Proof. We follow similar steps with the previous proof thanks to result of it. So Q_d_,ℓ(d·ℓ+3) can be expressed as follows:

Qd,ℓ(d⋅ℓ+3)=∑i=1ℓQd,ℓ(d⋅ℓ+3−Qd,ℓ(d⋅ℓ+3−i))=Qd,ℓ(d⋅ℓ+3−Qd,ℓ(d⋅ℓ+2))+Qd,ℓ(d⋅ℓ+3−Qd,ℓ(d⋅ℓ+1))+∑i=3ℓQd,ℓ(d⋅ℓ+3−Qd,ℓ(d⋅ℓ+3−i))=Qd,ℓ(d⋅ℓ+3−d⋅(l−1)−⌊(l+3)2⌋)+Qd,ℓ(2)+∑i=3ℓQd,ℓd⋅ℓ+3−d⋅ℓ+3−(d+i)+i−3ℓ=2+Qd,ℓ(d+3−⌊(ℓ+3)2⌋)+∑i=3ℓQd,ℓd+i−i−3ℓ=2+Qd,ℓ(d+3−⌊(ℓ+3)2⌋)+Qd,ℓ(d+3)+∑i=3ℓ−1Qd,ℓ(d+i)=2+Qd,ℓ(d+3−⌊(ℓ+3)2⌋)+(d+3)⋅(ℓ−1)ℓ+∑i=3ℓ−1(d+i)⋅(ℓ−1)ℓ=d+5+Qd,ℓ(d+3−⌊(l+3)2⌋)−d+3ℓ+∑i=3ℓ−1(d+i)−∑i=3ℓ−1d+iℓ=d⋅(ℓ−2)+2+Qd,ℓ(d+3−⌊(l+3)2⌋)+ℓ⋅(ℓ−1)2−d+3ℓ−∑i=3ℓ−1d+iℓ.

Sinced+2ℓ=d+3ℓfor l ≥ 7 andd=ℓ⋅(ℓ−1)−1+(−1)ℓ2,from Proposition 2.2,

(3)ℓ⋅(ℓ−1)2−d+3ℓ−∑i=3ℓ−1d+iℓ=d+1ℓ+d+2ℓ.

Thanks to Equation 3, Q_d_,ℓ(d · ℓ + 3) can be expressed as follows for l ≥ 7,

Qd,ℓ(d⋅ℓ+3)=d⋅(ℓ−2)+Qd,ℓ(d+3−⌊(l+3)2⌋)+2+d+1ℓ+d+2ℓ=d⋅(ℓ−2)+Qd,ℓ(d+3−⌊(l+3)2⌋)+2+ℓ⋅(ℓ−1)−1+(−1)ℓ2+1ℓ+ℓ⋅(ℓ−1)−1+(−1)ℓ2+2ℓ=d⋅(ℓ−2)+Qd,ℓ(d+3−⌊(ℓ+3)2⌋)+2⋅⌊(ℓ+1)2⌋.

In here if ℓ is odd, thend=ℓ⋅(ℓ−1)2−1and Q_d_,ℓ(d · ℓ + 3) can be expressed as follows,

Qd,ℓ(d⋅ℓ+3)=d⋅(ℓ−2)+Qd,ℓ((ℓ−1)22)+ℓ+1=d⋅(ℓ−2)+(ℓ−1)32⋅ℓ+ℓ+1=d⋅(ℓ−2)+ℓ⋅(ℓ−3)2+ℓ+3=d⋅(ℓ−2)+ℓ⋅(ℓ−1)2+3=d⋅(ℓ−1)+4.

And if ℓ is even, thend=ℓ⋅(ℓ−1)2and similar way can be used,

Qd,ℓ(d⋅ℓ+3)=d⋅(ℓ−2)+Qd,ℓ((ℓ−1)2+32)+ℓ=d⋅(ℓ−2)+ℓ⋅(ℓ−3)2+ℓ+3=d⋅(ℓ−2)+ℓ⋅(ℓ−1)2+3=d⋅(ℓ−1)+3.

These two cases can be combined into one equation that isQd,l(d⋅ℓ+3)=d⋅(ℓ−1)+7+(−1)ℓ+12

Since each computed term Q_d_,ℓ(d · ℓ + k) is also determinative for Q_d_,ℓ(d · ℓ + k + 1) for all k ≥ 1 by definition of our nested recurrences, the properties of further terms can also be shown with similar propositions. Table 1 contains some related patterns which guarantee the successive computations of recursions without termination in these short intervals as below. See also decreasing order of corresponding bursts in Figure 2 for an example Q_209,21(n).

$Fig. 2 Graph of Q209,21(n)−2021⋅n$(n) - \frac{20}{21}\cdot n$for 4000 ≤ n ≤ 10000.$

Fig. 2

Graph of Q_209,21(n)−2021⋅nfor 4000 ≤ n ≤ 10000.

Table 1

Behaviour of Q_d,_ℓ(d · ℓ + k) for ℓ ≥ 2 · k + 1 and k ≤ 10 whered=ℓ⋅(ℓ−1)−1+(−1)ℓ2.

k	Q_d_,_ℓ(d · ℓ + k) − Q_d_,_ℓ(d · ℓ)	Q_d_,_ℓ(d · ℓ + k)
1	(ℓ· (ℓ− 1) + 1 + (−1)^ℓ)/2	(ℓ³ −ℓ² −ℓ+ℓ· (−1)^ℓ+ 2)/2
2	⌊(ℓ+ 3)/2⌋	(2 ·ℓ³ − 4 ·ℓ² + 2 ·ℓ+ (2 ·ℓ− 3) · (−1)^ℓ+ 7)/4
3	(7 + (−1)^ℓ⁺¹)/2	(ℓ³ − 2 ·ℓ² + (ℓ− 2) · (−1)^ℓ+ 8)/2
4	(9 + (−1)^ℓ⁺¹)/2	(ℓ³ − 2 ·ℓ² + (ℓ− 2) · (−1)^ℓ+ 10)/2
5	5	(ℓ³ − 2 ·ℓ² + (ℓ− 1) · (−1)^ℓ+ 11)/2
6	(11 + (−1)^ℓ)/2	(ℓ³ − 2 ·ℓ² +ℓ· (−1)^ℓ+ 12)/2
7	7	(ℓ³ − 2 ·ℓ² + (ℓ− 1) · (−1)^ℓ+ 15)/2
8	8	(ℓ³ − 2 ·ℓ² + (ℓ− 1) · (−1)^ℓ+ 17)/2
9	9	(ℓ³ − 2 ·ℓ² + (ℓ− 1) · (−1)^ℓ+ 19)/2
10	10	(ℓ³ − 2 ·ℓ² + (ℓ− 1) · (−1)^ℓ+ 21)/2

3 **Experiments for Strange Members of Q_d_,_ℓ(n)**

Although previous section is really helpful in order to understand the certain facts about possible termination cases of Q_d_,ℓ(n) sequences for increasing values of ℓ and its relation with d, it is practically impossible to continue to prove these similar successive propositions forever. At this point, power of computer experiments may be meaningful in order to see the big picture about behaviours of these chaotic sequences in relatively long run and indeed this is the case. Our first purpose is the investigation of chaotic behaviours of these sequences for increasing values ofd≥ℓ⋅(ℓ−1)−1+(−1)ℓ2for a selected ℓ. To this aim, let〈Sd,ℓ(n)〉Ndenotes the average value of S_d_,ℓ(n) for d . ℓ + 1 ≤ n ≤ N + d . ℓ where S_d_,ℓ(n) is defined by Equation 4 and σ_ℓ(d) is defined by Equation 5. In our experiments, we focus on N = 10⁶, 2 ≤ ℓ ≤ 19 although several other values are also checked. Figure 3 particularly shows fascinating order signs of σ₃(d) for such a chaotic

$Fig. 3 Graph of σ3(d) for 20 ≤ d ≤ 250.$

Fig. 3

Graph of σ₃(d) for 20 ≤ d ≤ 250.

sequence family Q_d_,3(n). While σ₃(d) has a very characteristic distributional behaviour based on d mod 3, meaningful observations also can be made in Figure 5 and Figure 6 that suggest behaviour of these sequences has considerable similarities in terms of fluctuations of σ_ℓ(d).

$Fig. 5 Logarithmic plots of σℓ(d) forℓ⋅(ℓ−1)−1+(−1)ℓ2+0|ℓ−3|$\frac{\ell\cdot (\ell-1)-1+(-1)^\ell}{2}+0^{|\ell-3|}$≤ d ≤ 250 and N = 106 where 2 ≤ ℓ ≤ 10, respectively.$

Fig. 5

Logarithmic plots of σ_ℓ(d) forℓ⋅(ℓ−1)−1+(−1)ℓ2+0|ℓ−3|≤ d ≤ 250 and N = 10⁶ where 2 ≤ ℓ ≤ 10, respectively.

$Fig. 6 Logarithmic plots of σℓ(d) forℓ⋅(ℓ−1)−1+(−1)ℓ2$\frac{\ell\cdot (\ell-1)-1+(-1)^\ell}{2}$≤ d ≤ 300 and N = 106 where 11 ≤ ℓ ≤ 19, respectively.$

Fig. 6

Logarithmic plots of σ_ℓ(d) forℓ⋅(ℓ−1)−1+(−1)ℓ2≤ d ≤ 300 and N = 10⁶ where 11 ≤ ℓ ≤ 19, respectively.

This is a strong evidence that there are different branches in scatterplots which are dominated by values of d in a particular residue class for such chaotic sequences. Indeed, other graphs have also some similar patterns which are more irregular and weaker than patterns of σ₃(d) in terms of their ℓ values. While perfect explanation of such distributions is very hard to formulate due to chaotic nature of them, the main common property of them is that they do not tend to increase in terms of general trends. More precisely, trend line slopes for selected intervals are negative for all of them in the range of our experiments. Additionally, there are some sharp transitions between some levels of σ_ℓ(d). In order to observe the meaning of a characteristic decrease example in σ₄(d) plot, see Figure 4 that displays line graphs of S_59,4(n) and S_60,4(n) which small increase of d notably diminishes the amplitude of generational oscillations. Such a graphical observation is named as Yosemite Graph similarly in another curious work related to integer sequences [26]. Although this behaviour is not always the case for all consecutive values of d, empirical evidences suggest that more stability is a general tendency of Q_d_,ℓ(n) for ascending d.

$Fig. 4 Line graphs of S59,4(n) and S60,4(n) for n ≤ 104.$

Fig. 4

Line graphs of S_59,4(n) and S_60,4(n) for n ≤ 10⁴.

Our second purpose is understanding the behaviour of Q_d_,ℓ(n) whered=ℓ⋅(ℓ−1)−1+(−1)ℓ2.Section 2 clearly shows that there is a breaking point for finiteness of Q_d_,ℓ(n). Computer search also confirms this stage of experimentation since Q_d_,ℓ(n) is successfully computed up to 5 · 10⁷ without any termination case for all 4 ≤ ℓ ≤ 100 whered=ℓ⋅(ℓ−1)−1+(−1)ℓ2.

(4)Sd,ℓ(n)=Qd,ℓ(n)−(ℓ−1)ℓ⋅n,

(5)σℓ(d)2=〈Sd,ℓ(n)2〉N−〈Sd,ℓ(n)〉N2.

4 Discussion and Result

More detailed analysis on these strange recursions can be done thanks to investigation of generational structures of Q_d_,ℓ(n) but this could be extremely diffucult for all chaotic sequences in the range of our experiments since the confirmation of generational boundaries necessitates very careful examination of block structures of each generation for any known generational method [21, 22, 23,]. On the other hand, Section 2 and Section 3 both fairly conclude that increasing values ofd≥ℓ⋅(ℓ−1)−1+(−1)ℓ2tend to stabilize σ_ℓ(d) levels which are exhibited by oscillations of Q_d_,ℓ(n) around its conjectural slope for sufficiently large fixed N. Additionally, these sections suggest that Q_d_,ℓ(n) tends to be well defined whered=ℓ⋅(ℓ−1)−1+(−1)ℓ2for ℓ ≥ 4. So following conjectures are proposed based on reasonable heuristic, analysis and these empirical evidences that previous sections provide.

Conjecture 4.1

Q_d_,2(n) is an infinite sequence for all d > 2.

Conjecture 4.2

There is a m value such that Q_d_,3(n) is an infinite sequence for all d > m.

Conjecture 4.3

For any given ℓ, there are infinitely manyd≥ℓ⋅(ℓ−1)−1+(−1)ℓ2such that Q_d_,ℓ(n) is an infinite sequence.

5 Conclusion

This paper suggests that a generalization Q_d_,ℓ(n) tends to provide coexistence of chaos and order that are recreated by increasing values of d for an arbitrary ℓ. The target of our conjecture is finding a reasonable answer for the most fundamental question about these nested recurrences which this study focuses on. Understanding the behaviors of generalizations of meta-Fibonacci sequences may be really significant and helpful in order to discover curious properties of these kinds of nonlinear recurrences and there can pave the way in this direction due to wealth inheritance of these enigmatic sequences. For example, a new generalization can also be proposed for slow Hofstadter-Conway $10000 sequence which has curious fractal-like structure [27] as mentioned in A296816. So nature of generalizations of meta-Fibonaci sequences and probable unexpected interactions [22] between curious members of these generalizations contain new enigmatic inquiries for possible future works.

altug.alkan1988@gmail.com

Conflict of interest The author declares that there is no conflict of interest regarding the publication of this paper.

Acknowledgement

I would like to thank Prof. Steve Tanny for his helpful communication, Dr. Nathan Fox for his constructive feedback about some of the proofs, and Prof. Robert Israel for his valuable help on Maple-related requirements of this study. Also many thanks to the anonymous referees for making helpful suggestions.

References

[1] Douglas Hofstadter, G¨odel, Escher, Bach: an Eternal Golden Braid, Basic Books, New York, 1979.Search in Google Scholar

[2] B. Balamohan, A. Kuznetsov, and Stephen Tanny, On the behavior of a variant of Hofstadter’s Q-sequence, J. Integer Seq., 10 (2007), 07.7.1.Search in Google Scholar

[3] Nathan Fox, An Exploration Of Nested Recurrences Using Experimental Mathematics, Ph.D. Thesis, 2017.Search in Google Scholar

[4] S.W. Golomb, Discrete chaos: Sequences satisfying “Strange” recursions (1991).Search in Google Scholar

[5] Abraham Isgur, David Reiss, and Stephen Tanny, Trees and meta-Fibonacci sequences, Electron. J. Combin. 16 (2009), no. R129, 1.10.37236/218Search in Google Scholar

[6] A. Isgur, R. Lech, S. Moore, S. Tanny, Y. Verberne, and Y. Zhang, Constructing New Families of Nested Recursions with Slow Solutions, SIAM J. Discrete Math., 30(2), 2016, 1128-1147.10.1137/15M1040505Search in Google Scholar

[7] A. Isgur, Solving Nested Recursions with Trees, Ph.D. thesis, University of Toronto, Toronto, 2012.Search in Google Scholar

[8] Klaus Pinn, A chaotic cousin of Conway’s recursive sequence, Experiment. Math. 9 (2000), no. 1, 55–66.Search in Google Scholar

[9] Klaus Pinn, Order and chaos in Hofstadter’s Q(n) sequence, Complexity 4 (1999), no. 3, 41–46.Search in Google Scholar

[10] Stephen Tanny, A well-behaved cousin of the Hofstadter sequence, Discrete Math. 105 (1992), no. 1, 227–239.Search in Google Scholar

[11] A. Erickson, A. Isgur, B.W. Jackson, F. Ruskey and S. Tanny, Nested Recurrence Relations with Conolly-like Solutions, Siam J. Discrete Math, 26 (1) (2012), 206–238.10.1137/100795425Search in Google Scholar

[12] B. Jackson and F. Ruskey, Meta-Fibonacci sequences, binary trees and extremal compact codes, Electron. J. Combin. 13 (2006), R26.10.37236/1052Search in Google Scholar

[13] Marcel Celaya and Frank Ruskey, An undecidable nested recurrence relation, 8th Turing Centenary Conference on computability in Europe, 2012, pp. 107–117.10.1007/978-3-642-30870-3_12Search in Google Scholar

[14] B. W. Conolly, Meta-Fibonacci sequences, Fibonacci and Lucas Numbers, and the Golden Section,1989, pp. 127–138.Search in Google Scholar

[15] Richard K. Guy, Unsolved problems in number theory, Problem E31 (1994).Search in Google Scholar

[16] Stephen Tanny, An Invitation to Nested Recurrence Relations, 2013, talk given at the 4th biennial Canadian Discrete and Algorithmic Mathematics Conference (CanaDAM), https://canadam.math.ca/2013/program/slides/Tanny.Steve.pdfSearch in Google Scholar

[17] Nathan Fox, Quasipolynomial Solutions to the Hofstadter Q-Recurrence, INTEGERS, Volume 16 (2016).Search in Google Scholar

[18] Frank Ruskey, Fibonacci meets Hofstadter, Fibonacci Quart. 49 (2011), no. 3, 227–230.Search in Google Scholar

[19] N.J.A. Sloane, OEIS Foundation Inc., The On-Line Encyclopedia of Integer Sequences, 2018.10.1090/noti1734Search in Google Scholar

[20] Nathan Fox, A Slow Relative of Hofstadter’s Q-Sequence, J. Integer Seq., 20 (2017), 17.7.3.Search in Google Scholar

[21] Altug Alkan, “On A Generalization of the Hofstadter’s Q-sequence: A Family of Chaotic Generational Structures”, Complexity, vol. 2018, Article ID 8517125, 8 pages, 2018.Search in Google Scholar

[22] Altug Alkan, Nathan Fox, and O. Ozgur Aybar, “On Hofstadter Heart Sequences,” Complexity, vol. 2017, Article ID 2614163, 8 pages, 2017. doi:10.1155/2017/261416310.1155/2017/2614163Search in Google Scholar

[23] Barnaby Dalton, Mustazee Rahman, and Stephen Tanny, Spot-Based Generations for Meta-Fibonacci Sequences. Experiment. Math. 20, no. 2 (2011): 129-137.10.1080/10586458.2011.544565Search in Google Scholar

[24] Tal Kubo and Ravi Vakil, "On Conway’s recursive sequence." Discrete Math. 152, no. 1-3 (1996): 225-252.10.1016/0012-365X(94)00303-ZSearch in Google Scholar

[25] D. Kleitman, Solution to Problem E3274, Amer. Math. Monthly, 98 (1991), 958-959.10.2307/2324158Search in Google Scholar

[26] N. J. A. Sloane, The OEIS, Mathematical Discovery, and Insomnia, Slides of plenary talk presented at Computational Discovery in Mathematics, Western University, London, Ontario, May 12-16.Search in Google Scholar

[27] Colin L. Mallows, Conway’s challenge sequence, Amer. Math. Monthly 98 (1991), no. 1, 5–20.Search in Google Scholar

Received: 2018-06-19

Accepted: 2018-11-23

Published Online: 2018-12-31

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

Articles in the same Issue

https://doi.org/10.1515/math-2018-0124

Keywords for this article

Hofstadter Q-recurrence; Meta-Fibonacci Sequences; Nonlinear recurrences

Creative Commons

BY-NC-ND 4.0

On a conjecture about generalized Q-recurrence

Article

Abstract

1 Introduction

Definition 1.1

1.1 A motivational new generalization to beginning

Definition 1.2

Proposition 1.3

Proposition 1.4

2 On termination of Qd,ℓ(n) forℓ≥ 3

Proposition 2.1

Proposition 2.2

Proposition 2.3

3 Experiments for Strange Members of Qd,ℓ(n)

4 Discussion and Result

Conjecture 4.1

Conjecture 4.2

Conjecture 4.3

5 Conclusion

Acknowledgement

References

Articles in the same Issue

Articles in the same Issue

Articles in the same Issue

2 **On termination of Q_d_,_ℓ(n) forℓ≥ 3**

3 **Experiments for Strange Members of Q_d_,_ℓ(n)**