Lucas partitions (Q1384263)

Define the Lucas numbers \(L_k\) by \(L_0=2,L_1=1\), and \(L_k=L_{k-1}+L_{k-2}\) for \(k \geq 2\). Let \(S=\{L_k\}_{k=0}^{\infty}\), and define \(V(n),r(n), r_E(n)\), and \(r_O(n)\) to be the number of partitions of \(n\) into parts of \(S\), into distinct parts of \(S\), into evenly many distinct parts of \(S\), and into oddly many distinct parts of \(S\), respectively, with \(V(0)=r(0)=r_E(0)=1, r_O(0)=0\). Let \[ F(z)=\sum_{n=0}^{\infty}{V(n)z^n}, \] and define \(a(n)\) by \[ 1/F(z)=\sum_{n=0}^{\infty}{a(n)z^n}. \] Clearly, \(r(n)=r_E(n)+r_O(n)\), and it is possible to extend a theorem of \textit{T. Apostol} [Introduction to analytic number theory, Springer Verlag (1976; Zbl 0335.10001), p. 311] to show that \(a(n)=r_E(n)-r_O(n)=2r_E(n)-r(n)\). Define a {special Lucas partition} of \(n\) to be a partition \(n=L_{k_1}+L_{k_2}+ \cdots +L_{k_r}\), where \(k_i-k_{i+1} \geq 2\) for \(1 \leq i \leq r-1\). The author shows that every natural number \(n\) has a special Lucas partition, and uses a special Lucas partition to characterize other partitions of \(n\) into distinct parts of \(S\). This enables him to derive recursive formulas for \(r(n), r_E(n)\), and \(a(n)\). He also gives non-recursive formulas for \(r(n), r_E(n)\), and \(a(n)\) in special cases, such as when \(n=L_k\) for some \(k\).