Journal of Number TheoryVolume 30, Issue 2, October 1988, Pages 238-241A strange recursive relationAuthor links open overlay panelVincent Granville, Jean Paul RassonShow moreShareCitehttps://doi.org/10.1016/0022-314X(88)90020-0Get rights and contentUnder an Elsevier user licenseopen archiveAbstractThe recursive relation g(n) = n − g(g(n − 1)), g(0) = 0, appears in the context of Fibonacci numbers, as you can see in Hofstadter [“Bach, Esher, Godel,” pp. 151–154, Intereditions, 1985]. Here we state and prove that g(n) = [(n + 1)(−1 + √5)2].Previous article in issueNext article in issueRecommended articlesCited by (0)Copyright © 1988 Published by Elsevier Inc.