Table of Contents Author Guidelines Submit a Manuscript
Complexity
Volume 2017, Article ID 2614163, 8 pages
https://doi.org/10.1155/2017/2614163
Research Article

On Hofstadter Heart Sequences

1Graduate School of Science and Engineering, Piri Reis University, Tuzla, 34940 Istanbul, Turkey
2Department of Mathematics, Rutgers University, 110 Frelinghuysen Rd., Piscataway, NJ, USA

Correspondence should be addressed to Altug Alkan; rt.ude.urp@nakla.gutla

Received 14 June 2017; Revised 19 October 2017; Accepted 26 October 2017; Published 20 November 2017

Academic Editor: Peter Giesl

Copyright © 2017 Altug Alkan et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Abstract

The Hofstadter -sequence and the Hofstadter-Conway $10000 sequence are perhaps the two best known examples of meta-Fibonacci sequences. In this paper, we explore an unexpected connection between them. When the -sequence is subtracted from the Conway sequence, a chaotic pattern of heart-shaped figures emerges. We use techniques of Pinn and Tanny et al. to explore this sequence. Then, we introduce and analyze an apparent relative of the -sequence and illustrate how it also generates heart patterns when subtracted from the Conway sequence.

1. Introduction

The Hofstadter -sequence is recursively defined by the nested recurrence relation and initial values . This is sequence A005185 in Sloane’s On-Line Encyclopedia of Integer Sequences (OEIS) [1], and its first few terms are1, 1, 2, 3, 3, 4, 5, 5, 6, 6, 6, 8, 8, 8, 10, 9, 10, 11, 11, 12

In his book Gödel, Escher, Bach: An Eternal Golden Braid [2], Hofstadter introduced this sequence as a small mystery. He noted that, despite the simplicity of the sequence’s definition, the sequence values appear to be largely unpredictable. But there appears to be some sort of overarching structure (see Figure 1), a proof of which has thus far evaded mathematicians [3]. Even more frustratingly, it is unknown whether even exists for all . If it happens that , then would refer to a nonpositive index and fail to exist. In the event of such happenstance, we say that the -sequence dies. Based on the pattern in Figure 1 (which continues beyond the depicted terms), it is widely believed that the -sequence does not die. We know that it exists for at least terms [4].

Figure 1: Hofstadter -sequence.

Golomb describes the interestingly erratic behavior of -sequence as “wildly chaotic,” though he proved that if exists, then it must be one half [5]. But, a priori, there is no reason this limit should exist; Golomb himself describes another sequence satisfying the -recurrence (A244477) for which the limit does not exist. This conditional limit value is essentially the only rigorous result proved about the -sequence [6]. For this reason, studies on the -sequence have primarily been experimental.

Observations on -sequence clearly suggest that the beginning points of the apparent block structures are close to 3 times consecutive powers of 2. In order to explain the fractal-like behavior of -sequence, the first extensive study was carried out by Pinn [7]. In his work, is described as a child of its “mother” and “father” . With this methodology, Pinn partitions the values of into interval “generations” that correspond to the “sausages” in Figure 1 and he noted that the first eleven generations have well-defined starting points, where the difference between and suddenly jumps. Thereafter, a detailed statistical analysis indicates that the subsequent generations begin around odd powers of . More recently, Dalton et al. instead used a recursive method to detect generations [8]. They defined a function , called the generation sequence for based on spot , by the recurrence and initial conditions . This function is used to determine the beginning points of the generations of -sequence. More precisely, the least value of such that is equal to gives that is defined as the start point of the th generation of -sequence. Table 1 shows the values of (the starting points of the first eleven generations agree, regardless of which method is used; for generation numbers , the two approaches give different points for starts of generations [8]) in the range we will consider for our sequences in this paper.

Table 1: The values of that refer to the start points of maternal generations of the -sequence.

We have noted that the -sequence appears to have elements of chaos and structure. There are also many sequences that have similar definitions to the -sequences that are not chaotic [46, 912]. Some of these sequences have combinatorial interpretations involving counting leaves in infinite trees [10]. But, for us, the most important well-behaved meta-Fibonacci sequence is the Hofstadter-Conway $10000 sequence (A004001, shortened to the Conway sequence), given by recurrence and initial conditions . The name of this sequence comes from a prize of $10000 that John H. Conway offered for the discovery of a value of such that for all . Mallows provided such an analysis just a few weeks after and he showed that corresponding [13]. The sequence is monotone increasing with successive differences either 0 or 1, and . Furthermore, for all , with equality if and only if is a power of 2. Figure 2 is a plot of that is symmetric in its zeros [11], which illustrates this sequence’s fractal-like structure. Mallows conjectured that graphs of these structures converge to a special curve form that can be parametrized in terms of the Gaussian distribution, and this is proved by Kubo and Vakil [11]. The Conway sequence, like the -sequence, can be partitioned into generations. In this case, the generation boundaries are the powers of 2. More precisely, the beginning point of the th maternal generation is for [8].

Figure 2: Hofstadter-Conway $10000 sequence, minus .

This paper is structured as follows. In Section 2, we introduce and analyze the Hofstadter Chaotic Heart sequence, which is constructed as a difference of the -sequence and the Conway sequence. Then, in Section 3, we carry out a similar construction with a new sequence in place of the -sequence and we report a variety of interesting observations. Finally, we offer some concluding remarks in Section 4.

2. The Hofstadter Chaotic Heart Sequence

We wish to consider a difference of the -sequence and the Conway sequence. The -sequence seems to hover around , whereas the Conway sequence never dips below . For this reason, it is more natural to consider the Conway sequence minus the -sequence.

Definition 1. Let , where denotes the th term in the -sequence and denotes the th term in the Conway sequence.

We call the sequence the Hofstadter Chaotic Heart sequence (A284019). The reason for this name should be clear from a glance at its plot in Figure 3. At this point, it would be nice to observe appearance process of erratic heart shapes with increasing numbers of generations. For a plot of successive generations of the Hofstadter Chaotic Heart sequence, see Figure 4.

Figure 3: Hofstadter Chaotic Heart sequence.
Figure 4: Hofstadter Chaotic Heart sequence for increasing values of (generation number).

The sequence has a fractal-like structure of ever-growing hearts. The heart shapes can be described by considering the following ingredients:(i)The -sequence is built out of apparently self-similar “sausages.”(ii)The is approximately symmetric within each generation.(iii)The -sequence appears to grow approximately like .(iv)The -sequence has generational divides around 3 times powers of 2, which sit halfway between consecutive powers of 2.(v)The Conway sequence grows like .(vi)The Conway sequence has self-similar generations divided at powers of 2.(vii) is symmetric about 3 times the power of 2 that started the preceding generation.(viii).

All of these points together imply that the bottom of each heart should be near a power of 2, and this is precisely what is observed. This is all summarized in Figure 5. We also marked the initial values of in order to show the determinative role of generational structure of -sequence.

Figure 5: Hofstadter Chaotic Heart sequence with overlaid.

We shall now analyze the Hofstadter Chaotic Heart sequence using Pinn’s statistical technique and the Maternal Spot Generation method (we also study the same analysis with Pinn’s generational method that estimates whether the integer part of is the beginning point of the th generation of -sequence for ; results observed are mainly similar to the values of Table 2). As in Pinn’s work, let , and let . In our analysis, we will not use the integral part of unlike Pinn’s work [7], in order to prevent information loss in statistical analysis. In other words, and give noninteger terms for odd values of . For a given sequence , let us define, as Pinn does, (see below), a variance of sorts for , where the indices considered are in the th generation. Also borrowing notation from Pinn, let denote the average value of over the th generation, and define , , and as below. In our analysis, th generation boundaries are taken from Table 1 because of the observation in Figure 5 that clearly suggests that generational boundaries of -sequence are also boundaries of the heart patterns. For example, if , then is the first index and is the last index for the computation of the following quantities:(i)(ii)(iii)(iv)

Table 2: The values of , , , and for Maternal Spot Generation intervals on the -sequence.

Since , for the same th generation boundaries, it is clear that , where . See Table 2 for the values of for , , and and the values of in our experimental range.

3. The “Brother” Sequence

Aside from the -sequence, there are many other solutions to Hofstadter’s -recurrence with different initial conditions [6]. Are there any other initial conditions for Hofstadter’s -recurrence such that has a fractal-like structure of ever-growing hearts where is the Conway sequence? We aimed to find a simple answer for this question. Therefore, firstly, we have done experiments on -recurrence with three initial conditions. Let us denote the initial conditions , , and by , where . In this case, the sequence with the initial conditions is Hofstadter’s -sequence. Sequences with initial conditions , , , , and are essentially the same as Hofstadter’s -sequence for all and . Sequences with initial conditions (A244477) and are quasi-periodic [5]. Initial conditions , , , , and give sequences which are much more chaotic compared to the -sequence. All other combinations of immediately die except . The only remaining sequence is the one with initial conditions that has a behavior so closely related to the -sequence itself and thus we call it the Brother sequence.

Definition 2. Let be defined by the recurrence for , with the initial conditions , .

The first few terms of the Brother sequence (A284644) are2, 2, 1, 3, 5, 3, 5, 6, 4, 6, 10, 5, 7, 9, 9, 10, 11, 11, 12.

Definition 3. Let , where denotes the th term in the -sequence and denotes the th term in the Conway sequence.

Figure 7 shows the plot of the sequence . See also Figure 8 for the appearance process of heart patterns with increasing numbers of generations. In fact, the hearts here are more clearly defined, as a result of the more gradual beginnings of the sausage structures in the Brother sequence.

Figure 9 depicts the Brother sequence. Like the -sequence, it appears to be composed of self-similar chaotic sausages staying near . Also, like the -sequence, it is easy to show that if exists, it must be equal to . Interestingly, the junctions between the sausages of the Brother sequences themselves appear to consist of smaller sausages (see Figure 11).

We now study the generational structure of . Our purpose is to compute , where . Note that we defined and for a corresponding in the previous section. Keeping those definitions in mind, we need to determine intervals that contain each main block of the Brother sequence in our measurement range. We will call these main blocks because of the observation, shown in Figure 11, that there are also smaller block structures. To determine the starting points of main blocks, we employ the following method. When the minimum of the father and mother spots is greater than or equal to the first member of the th generation, we define as the first member of the st generation. In the range of our experiments, this methodology partitions the data cleanly into generations. To quantify the purity of our generations, we define to be the proportion of terms in the th generation whose father or mother spot is located in the nd generation. If is close to 0, then the generations are close to pure.

In our case, will be the beginning of the first generation, and will be the beginning of the second generation. We now define some auxiliary sequences (similar auxiliary sequences can also be defined for the Conway sequence; let be the least such that mother spot is equal to and = for with and ; in this case, is the start point of the th maternal generation which is given in [8]) for the approximation that is mentioned above.

Definition 4. Let be the least such that the minimum of father and mother spots is greater than or equal to .

Definition 5. Let for , with .

See Table 3 for the first 25 values of . We can confirm that the terms of can be limits of intervals that contain each main block in our experimental range. See Figure 10 for an example, that is, .

Table 3: The values of sequence: these points will be used as start points of generations in order to compute statistical quantities of .

So, we will use them as the beginning of our generations in order to compute statistical quantities that we mentioned above and in the previous section. Table 4 shows the main statistical quantities with this partition.

Table 4: , , , and values for generations that sequence determines.

Let us now elucidate Figure 11 in more depth. To this end, we need the following definition.

Definition 6. Let be the sequence of numbers such that .

We have computed the first few terms of (A287118): 84, 172, 348, 700, 1404, 2720, 2754, 5448, 10904, 21816, 43640, and 87288.

The numbers are significative for the Brother sequence in order to detect the junctions of small elliptic-like sausages up to . For example, 87288 is the index of the juncture of small sausages in Figure 11. Detailed analysis of generational characteristics of smaller block structures in the connection of main blocks can be a future work. However, we will mention some properties of the sequence that exhibits some curious patterns. For example, for . Additionally, there is an interesting order that sequence has for . Table 5 simply summarizes this. Results show that 2754 is an exception in terms of quantity of . This observation has significance since different studies have searched order signs in highly chaotic nature of -sequence [7, 8]. In here, that is an apparent relative of -sequence exhibits an unexpected pattern on the juncture of small elliptic-like sausages in short scale.

Table 5: Hidden order that sequence shows on sequence.

We want to confirm the validity of numerical results in Table 4. To this aim, we can choose two different constants and do a careful examination. Between and , experimental observations indicate that , and , can be limits of intervals that contain each main block. With both limits for successive main blocks, computations show that the value 0.88 appears. Note that both constants are determined by observation on a limited range, so both constants that are and should be seen as a tool for partitioning the sequence into similar main blocks in order to compute and confirm .

The results of computation of have significance because 0.88 is the constant that Pinn conjectures in his analysis of the -sequence (we also confirmed that oscillates around 0.88 for the generational boundaries that are determined by Table 3 in our experimental range) [7], and he obtains the same constant for a similar analysis of a different sequence [14]. It seems that fluctuates around 0.88 with more orderly behavior. Additionally, seems fascinatingly stable around 1.

Since we know the certain generational properties of the Brother sequence now, we are ready to analyze the sequence in our experimental range. Our previous analysis suggests for sufficiently large . We carry out analysis similar to the previous section. We use the generational boundaries of the Brother sequence that Table 3 represents. See Table 6 for the results that we obtained. Comparison between Figures 6 and 12 suggests that the signs of order are more evident in here. In this case, seems really more stable than and is smaller than for all except .

Table 6: The values of , , , and for the generations of the -sequence.
Figure 6: Graph of Table 2 (blue: , red: , green: , black: ). In our experimental range, is oscillating as an upper bound and is increasing with decreasing fluctuations thanks to domination of , while confirms Pinn’s conjecture.
Figure 7: Heart sequence .
Figure 8: Heart sequence , successive generations.
Figure 9: Graph of for .
Figure 10: Illustration of on the scatterplot of .
Figure 11: Graph of for : small elliptic-like sausages appear in the connection of big sausages; more precisely, exactly gives the position of juncture of evident small elliptic-like sausages.
Figure 12: Graph of Table 6 (blue: , red: , green: , black: ).

4. Conclusion

This study aims to offer a different perspective on meta-Fibonacci sequence. We aim to suggest that there are undiscovered and interesting facts behind two famous meta-Fibonacci sequences and the relations between them. We have carried out a variety of experiments in order to understand the nature of the Hofstadter heart sequences that we introduce. While we explore the Hofstadter Chaotic Heart sequence, we also introduce and study the Brother sequence, which offers meaningful experimental results and intriguing observations in terms of new inferences for Hofstadter’s -recurrence. Future work could potentially undertake a more detailed analysis of its generational structure than we have done here. This study also suggests that there is a mysterious classification of chaotic meta-Fibonacci sequences determined by common characteristics of their respective generational structures.

Conflicts of Interest

The authors declare that there are no conflicts of interest regarding the publication of this paper.

Acknowledgments

The authors would like to thank D. R. Hofstadter, N. J. A. Sloane, and Antti Karttunen for their valuable comments about A284019 in OEIS. They would also like to thank Robert Israel regarding his valuable help for Maple related requirements.

References

  1. N. J. A. Sloane, The On-Line Encyclopedia of Integer Sequences, OEIS Foundation Inc, 2017.
  2. D. Hofstadter, Gödel, Escher, Bach: an Eternal Golden Braid, Basic Books, New York, NY, USA, 1979.
  3. R. K. Guy, Unsolved problems in number theory, Problem E31, 1994.
  4. A. Isgur, R. Lech, S. Moore, S. Tanny, Y. Verberne, and Y. Zhang, “Constructing new families of nested recursions with slow solutions,” SIAM Journal on Discrete Mathematics, vol. 30, no. 2, pp. 1128–1147, 2016. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  5. S. W. Golomb, Discrete chaos: Sequences satisfying “Strange” recursions, 1991.
  6. N. Fox, An exploration of nested recurrences using experimental mathematics [Ph.D. thesis], 2017.
  7. K. Pinn, “Order and chaos in Hofstadter's Q(n) sequence,” Complexity, vol. 4, no. 3, pp. 41–46, 1999. View at Publisher · View at Google Scholar · View at MathSciNet
  8. B. Dalton, M. Rahman, and S. Tanny, “Spot-based generations for meta-Fibonacci sequences,” Experimental Mathematics, vol. 20, no. 2, pp. 129–137, 2011. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  9. B. W. Conolly, “Meta-Fibonacci sequences,” in Fibonacci and Lucas Numbers, and the Golden Section, pp. 127–138, 1989. View at Google Scholar
  10. A. Isgur, D. Reiss, and S. Tanny, “Trees and meta-Fibonacci sequences,” Electronic Journal of Combinatorics, vol. 16, no. 1, article R129, 2009. View at Google Scholar
  11. T. Kubo and R. Vakil, “On Conway's recursive sequence,” Discrete Mathematics, vol. 152, no. 1–3, pp. 225–252, 1996. View at Publisher · View at Google Scholar · View at MathSciNet
  12. S. M. Tanny, “A well-behaved cousin of the Hofstadter sequence,” Discrete Mathematics, vol. 105, no. 1–3, pp. 227–239, 1992. View at Publisher · View at Google Scholar · View at MathSciNet
  13. C. L. Mallows, “Conway's challenge sequence,” The American Mathematical Monthly, vol. 98, no. 1, pp. 5–20, 1991. View at Publisher · View at Google Scholar · View at MathSciNet
  14. K. Pinn, “A chaotic cousin of Conway's recursive sequence,” Experimental Mathematics, vol. 9, no. 1, pp. 55–66, 2000. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus