Elsevier

Journal of Number Theory

Volume 30, Issue 2, October 1988, Pages 238-241
Journal of Number Theory

A strange recursive relation

https://doi.org/10.1016/0022-314X(88)90020-0Get rights and content
Under an Elsevier user license
open archive

Abstract

The recursive relation g(n) = ng(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].

Cited by (0)