REFERENCES
- J.-P. Allouche and J. Shallit, Automatic Sequences: Theory, Applications, Generalizations, Cambridge University Press, Cambridge, 2003.
- J. Borwein and D. Bailey, Mathematics by Experiment, A K Peters, Natick, MA, 2004.
- P. Erdős and R. L. Graham, Old and New Problems and Results in Combinatorial Number Theory, L'Enseignement Mathématique, Genève, 1980.
- L. R. Ford and S. M. Johnson, A tournament problem, Amer. Math. Monthly 66 (1959) 387–389. doi:10.2307/2308750
- R. L. Graham, D. E. Knuth, and O. Patashnik, Concrete Mathematics, 2nd ed., Addison-Wesley, Reading, MA. 1994.
- R. L. Graham and H. O. Pollak. Note on a nonlinear recurrence related to √2. Math. Mag. 43 (1970) 143–145.
- R. K. Guy, The strong law of small numbers, Amer. Math. Monthly 95 (1988) 697–712. doi:10.2307/2322249
- F. K. Hwang and S. Lin, An analysis of Ford and Johnson's sorting algorithm, in Proceedings of the Third Annual Princeton Conference on Information Sciences and Systems, J. B. Thomas, M. E. van Valkenburg, and P. Weiner, eds., Department of Electrical Engineering, Princeton University, Princeton, NJ, 1969, 292–296.
- D. E. Knuth, The Art of Computer Programming, vol. 3, Sorting and Searching, 2nd ed., Addison-Wesley, Reading, MA, 1998.
- L. Kuipers and H. Niederreiter, Uniform Distribution of Sequences, John Wiley, New York, 1974.
- S. Rabinowitz and P. Gilbert, A nonlinear recurrence yielding binary digits, Math. Mag. 64 (1991) 168–171.
- N. J. A. Sloane, The On-Line Encyclopedia of Integer Sequences, available at http://www.research.att.com/~njas/sequences.
- Th. Stoll, On families of nonlinear recurrences related to digits, J. Integer Seq. 8(3) (2005), available at http://www.cs.uwaterloo.ca/journals/JIS/vol8.html.
- Th. Stoll, On a problem of Graham and Erdős concerning digits. Acta Arith. 125 (2006) 89–100. doi:10.4064/aa125-1-8