In praise of an elementary identity of Euler.
We study the properties of the function which determines the number of representations of an integer as a sum of distinct Fibonacci numbers . We determine the maximum and mean values of for .
We study the properties of the function R(n) which determines the number of representations of an integer n as a sum of distinct Fibonacci numbers Fk. We determine the maximum and mean values of R(n) for Fk ≤ n < Fk+1.
We examine the congruences and iterate the digit sums of integer sequences. We generate recursive number sequences from triple and quintuple product identities. And we use second order recursions to determine the primality of special number systems.