Let (t(n)((r)))(n >= 0) be the sequence of the generalized Fibonacci number of order r, which is defined by the recurrence t(n)((r)) = t(n-1)((r)) +... + t(n-r)((r)) for n >= r, with initial values t(0)((r)) = 0 and t(i)((r)) ...