Complexity

Complexity / 2018 / Article

Research Article | Open Access

Volume 2018 |Article ID 8517125 | 8 pages | https://doi.org/10.1155/2018/8517125

On a Generalization of Hofstadter’s -Sequence: A Family of Chaotic Generational Structures

Academic Editor: Dimitri Volchenkov
Received27 Nov 2017
Accepted02 May 2018
Published25 Jun 2018

Abstract

Hofstadter -recurrence is defined by the nested recurrence , and there are still many unanswered questions about certain solutions of it. In this paper, a generalization of Hofstadter’s -sequence is proposed and selected members of this generalization are investigated based on their chaotic generational structures and Pinn’s statistical technique. Solutions studied have also curious approximate patterns and considerably similar statistical properties with Hofstadter’s famous -sequence in terms of growth characteristics of their successive generations. In fact, the family of sequences that this paper introduces suggests the existence of conjectural global properties in order to classify unpredictable solutions to -recurrence and a generalization of it.

1. Introduction

Since the enigmatic concept of meta-Fibonacci has been introduced by Douglas Hofstadter with the invention of the original -sequence (A005185 in OEIS), in the literature, there are many studies which focus on nested recurrence relations whose behaviors can alternate dramatically [15]. There are many examples of meta-Fibonacci sequences like Hofstadter-Conway $10000 sequence (A004001), Conolly sequence (A046699), Tanny sequence (A006949), Golomb’s sequence (A001462), Mallows’ sequence (A005229), etc. [610]. Some of meta-Fibonacci sequences are highly chaotic and unpredictable while some of them have completely predictable fashion such as quasipolynomial solutions to the Hofstadter -recurrence [1113] and slow -sequence (A063882) that is also 2-automatic [14]. Among the solutions which have an erratic nature, certain variants have underlying structures that contain conjecturally interesting approximate properties such as scaling, self-similarity, and period doubling [15, 16]. For these kinds of solutions of nested recurrences, known mathematical techniques for solving difference equations do not work because of the nature of nesting although there are alternative definitions for the generational structure of a chaotic meta-Fibonacci sequence [1519]. The existence of universality classes for chaotic meta-Fibonacci sequences determined by common characteristics of their respective generational structures is a mysterious open question although there are a variety of attempts in order to search an affirmative answer for this question, partially [1517]. Since the certain solutions to the Hofstadter -recurrence are investigated in this study, it would be nice to remember the scatterplots of Hofstadter’s original -sequence and the “Brother” sequence (A284644) that is defined by and initial values and (see Figure 1). Although there are many solutions to the Hofstadter -recurrence with different initial conditions [9, 1113, 17, 20], these two solutions and their connection based on their generational structures provide a variety of interesting experimental results [17].

This paper is structured as follows. In Section 2, Hofstadter’s -sequence is generalized according to the initial condition formulation and an intriguing sequence family is introduced. Then, in Section 3.1 and Section 3.2, selected members of this curious sequence family are studied based on their generational structures with the statistical perspective. Finally, some concluding remarks are offered in Section 4.

2. A Generalization of Hofstadter’s -Sequence according to Initial Conditions

Hofstadter’s -sequence is a very intriguing solution to the -recurrence, and it is believed that the most notable meta-Fibonacci sequence is Hofstadter’s -sequence [11]. Indeed, many famous mathematicians such as Erdős, Guy, and Sloane found it really very interesting [21, 22]. At this point, it is natural to ask, “Can a generalization of solutions to the -recurrence be based on the initial conditions for variants that behave in a similar fashion with a -sequence?” If the answer is yes, there can be a collection of curious chaotic patterns and generational structures hidden in genes of the -recurrence. Solutions with three initial conditions are studied before [17]. In order to go further, computer experiments can be made with four and five initial conditions but empirical results suggest that there is no sign of any sequence family with generational common characteristics except -sequence and “Brother” sequence (A284644) although there are some more chaotic solutions such as A278056 [9, 11]. So experiments suggest that computation of all living permutations of initial conditions is not very fruitful in order to discover a solution family that has members which behave very similar with the original -sequence. Also, recently, the Hofstadter -recurrence and a generalization of it are studied with initial conditions 1 through and detailed analysis showed that living solutions have notably different properties from the -sequence with the increasing values of [11]. At this point, it would be nice to remember if exists, it must be equal to [13]. From this fact, initial conditions which are may be meaningful for the Hofstadter -recurrence. Additionally, this approach inspired by reasonable heuristic can be generalized with the initial condition formulation as below.

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

By definition, is the original -sequence and is essentially the same with . is extremely wild sequence that there are no signs of any underlying structure (see Figure 2).

However, for , many curious chaotic patterns fascinatingly start to appear for (see Figure 3). In the next section, certain members of this family are investigated in order to search the signs of a similar inheritance with the original -sequence although exhibits quite different experimental characteristics, at least in the range of this study.

In this study, solutions to and recurrences will be studied with certain examples while continues to provide intriguing generational structures with an increasing level of complexity for .

3. Analysis of Certain Members of Family

3.1. Selected Solutions to

Approximate self-similar block structures of certain members of family can be studied thanks to auxiliary sequences similar with different works which give definitions of generations [1518]. In here, the main purpose is to model and compute the rescaling of amplitudes for self-similar successive block structures of for the selected values of which are in the range of this study, since this computation will give a chance to search a conjectural global property for certain solutions to the Hofstadter -recurrence. Certain auxiliary sequences can be used in order to compute statistical quantities which this paper focuses on. Experiments that use alternative definitions for the determination of generational boundaries are also carried out precisely. Since the results are mainly similar in terms of the values of Table 1, only one method’s table is reported in here. Corresponding method’s definitions follow as below. See Figure 4 for some examples of partitions.



100.8470.7980.837
110.8280.8950.776
120.8530.8860.803
130.7640.8240.883
140.8690.8610.877
150.8580.8750.880
160.8620.8700.863
170.8750.8900.877
180.8690.8800.886
190.8780.8840.882
200.8840.8830.882
210.8820.8860.884
220.8830.8850.885
230.8850.8840.886
240.8870.8860.886
250.8880.8860.886

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

Definition 3. Let where for , with .
See Tables 24 for the corresponding values of .


12345

135917
3365129257513
102520494088816316227
3220663943127182253527504715
100152919902063956008785230915566939


12345

135918
3776155314630
1264253850761015520269
4030980178158920315670626261
124268024613434881527968936419208568


12345

135917
3469140283569
114122854573914718292
3654272974145867291183581442
116038323138674614469920245118337568

The given sequence denotes the average value of over the th generation boundaries that are determined by for corresponding and define as below. See Table 1 and Figure 5 in order to observe the considerable similarities between values with the increasing number of generations. These results are very close to the values that are reported before [1517]. In other words, the initial condition pattern that this study focuses on provides significant behavioral similarities with the original -sequence in terms of growth characteristics of successive generations. Additionally, other solutions for are checked thanks to certain auxiliary sequences and careful examination of their data. Results observed are mainly similar to the values of Table 1.

3.2. Selected Solutions to

In this section, certain members of are analysed thanks to properties of their generational structures. It is easy to show that and die immediately since and . See Figure 6 for that is highly chaotic sequence although there appear to be some weak signs of order in it. Then, more orderly generational structures evolve in terms of the determination of main blocks (see Figure 7 for curious examples where ). In that case, in order to detect the limits of approximate self-similar block structures, spot-based generation concept can be used for based on spot [18].

Definition 4. Let be the least value of such that is equal to where and with initial conditions for .

See Tables 57 for the corresponding values of and Figure 8 for some illustrations of generational boundaries.


12345

11339114327
970291186502587577058
2284246786832020707601668317966896


12345

12266195570
169951021522445510136182
406324120953536115641079784232259345


12345

13193276813
242872892180265263195493
584332174389352163101558799646668176

Similar with the previous section, for a given sequence , denotes the average value of over the th generation boundaries that are determined by for corresponding and define as below. Also, similarly, see Table 8 and Figure 9 in order to observe the considerable similarities between values that are different from the values which are reported in the previous section since the recurrence is in that case.



50.8370.8380.838
60.9370.9250.926
70.9280.8940.898
80.9360.9270.933
90.9370.9440.942
100.9540.9470.949
110.9510.9520.949
120.9480.9510.949
130.9520.9520.953
140.9520.9540.953
150.9540.9540.954

4. Conclusion

In the literature, there are many studies that are primarily concerned with finding initial conditions to corresponding meta-Fibonacci recurrences where the solutions have a provable universal property such as having an ordinary generating function and being slow [11, 12, 20]. On the other hand, properties of Hofstadter’s -sequence depend on experimental studies because of its complicated nature that is extremely resistant to known mathematical proof techniques [1517, 19]. In this study, a variety of evidences are provided in order to claim the existence of a family that certain members have considerably similar conjectural properties with famous -sequence. A generalization of -sequence according to the initial condition patterns which are determined by asymptotic properties of recurrences is introduced, and meaningful statistical results are provided in terms of the classification of chaotic solutions to recurrences that this study focuses on.

Conflicts of Interest

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

Acknowledgments

The author would like to thank D.R. Hofstadter for a valuable feedback about some sequences which are fascinating mixtures of regularity and irregularity. The author would also like to thank Robert Israel regarding his valuable help for Maple-related requirements of this study.

References

  1. B. V. S. Bharadwaj, L. S. Chandran, and A. Das, “Isoperimetric problem and meta-fibonacci sequences,” in Computing and Combinatorics. COCOON 2008, X. Hu and J. Wang, Eds., vol. 5092 of Lecture Notes in Computer Science, Springer, Berlin, Heidelberg, 2008. View at: Google Scholar
  2. D. Hofstadter, “Godel, escher, bach: an eternal golden braid,” in Basic Books, New York, NY, USA, 1979. View at: Google Scholar
  3. D. Hofstadter, “Curious patterns and nonpatterns in a family of metafibonacci recursions,” in talk given at Rutgers Experimental Mathematics Seminar, Camden, NJ, USA, 2014, , https://vimeo.com/91708646. View at: Google Scholar
  4. A. Isgur, D. Reiss, and S. Tanny, “Trees and meta-Fibonacci sequences,” Electronic Journal of. Combinatorics, vol. 16, article R129, p. 1, 2009. View at: Google Scholar
  5. 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 Site | Google Scholar
  6. B. W. Conolly, “Meta-Fibonacci sequences,” in Fibonacci and Lucas Numbers, and the Golden Section, pp. 127–138, Wiley, 1989. View at: Google Scholar
  7. T. Kubo and R. Vakil, “On Conway’s recursive sequence,” Discrete Mathematics, vol. 152, no. 1–3, pp. 225–252, 1996. View at: Publisher Site | Google Scholar
  8. C. L. Mallows, “Conway’s challenge sequence,” The American Mathematical Monthly, vol. 98, no. 1, pp. 5–20, 1991. View at: Publisher Site | Google Scholar
  9. N. J. A. Sloane, OEIS Foundation Inc, The On-Line Encyclopedia of Integer Sequences, 2018.
  10. 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 Site | Google Scholar
  11. N. Fox, An Exploration of Nested Recurrences Using Experimental Mathematics, [Ph.D. thesis], Rutgers The State University of New Jersey-New Brunswick, 2017.
  12. N. Fox, Quasipolynomial Solutions to the Hofstadter Q-Recurrence, INTEGERS, 2016.
  13. S. W. Golomb, Discrete chaos: sequences satisfying strange recursions, 1991.
  14. J. P. Allouche and J. Shallit, “A variant of Hofstadter’s sequence and finite automata,” 2011, http://arxiv.org/abs/1103.1133. View at: Google Scholar
  15. K. Pinn, “A chaotic cousin of Conway’s recursive sequence,” Experimental Mathematics, vol. 9, no. 1, pp. 55–66, 2000. View at: Publisher Site | Google Scholar
  16. K. Pinn, “Order and chaos in Hofstadter’s Q(n) sequence,” Complexity, vol. 4, no. 3, 46 pages, 1999. View at: Publisher Site | Google Scholar
  17. A. Alkan, N. Fox, and O. Ozgur Aybar, “On Hofstadter heart sequences,” Complexity, vol. 2017, Article ID 2614163, 8 pages, 2017. View at: Publisher Site | Google Scholar
  18. 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 Site | Google Scholar
  19. S. M. Tanny, “An invitation to nested recurrence relations,” in 4th Biennial Canadian Discrete and Algorithmic Mathematics Conference (CanaDAM), pp. 6-7, Canada, 2013, https://canadam.math.ca/2013/program/slides/Tanny.Steve.pdf. View at: Google Scholar
  20. F. Ruskey, “Fibonacci meets Hofstadter,” Fibonacci Quart, vol. 49, no. 3, pp. 227–230, 2011. View at: Google Scholar
  21. R. K. Guy, Unsolved Problems in Number Theory, Problem E31, Springer-Verlag, 1994.
  22. D. Hofstadter and N. J. A. Sloane, Correspondence, 1977 and 1991, https://oeis.org/A006336/a006336.pdf.

Copyright © 2018 Altug Alkan. 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.


More related articles

719 Views | 306 Downloads | 3 Citations
 PDF  Download Citation  Citation
 Download other formatsMore
 Order printed copiesOrder

Related articles

We are committed to sharing findings related to COVID-19 as quickly and safely as possible. Any author submitting a COVID-19 paper should notify us at help@hindawi.com to ensure their research is fast-tracked and made available on a preprint server as soon as possible. We will be providing unlimited waivers of publication charges for accepted articles related to COVID-19. Sign up here as a reviewer to help fast-track new submissions.