Lucas序列的加速递推公式

Accelerated Recursion Formulas for Lucas Sequences

设Lucas序列{U_n(P,Q)}由U_0=0,U_1=1和U_(n+1)=PU_n-QU_(n-1)给出,利用孙智宏的一个反演公式得出一些组合恒等式与U_n(P,Q)的加速递推公式.

Let { U_n（ P,Q） } be the Lucas sequence given by U_0= 0,U_1= 1 and U_（n ＋ 1）= PU_n- QU_（n- 1）（ n≥1）.In this paper,using an inversion formula due to Z H Sun,we obtain some combinatorial identities and accelerated recursion formulas for U_n（ P,Q）.