A strange recursive relation (Q1107556)

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.