Let \(g(n)\) be an integer valued function defined by \(g(0)=0\) and \(g(n)=n- g(g(n-1))\) for \(n>0\). It is easy to see that \(g(n)\) is defined for each positive integer \(n\). The authors show that \(g(n)=[(n+1)\mu]\), where \(\mu =(-1+\sqrt{5})/2\) and \([\,]\) is the greatest integer function.
Recommendations
Cited in
(8)- Infinite self-similar words
- Intertwined infinite binary words
- scientific article; zbMATH DE number 3871453 (Why is no real title available?)
- A curious recursive function
- scientific article; zbMATH DE number 3614841 (Why is no real title available?)
- An implicit Zeckendorf representation
- On Hofstadter's G-sequence
- Variants of Wythoff game with terminal positions or blocking maneuvers
This page was built for publication: A strange recursive relation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1107556)
