Recursion formula of second-order recurrent sequences (Q2478015)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5249921
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Recursion formula of second-order recurrent sequences |
scientific article; zbMATH DE number 5249921 |
Statements
Recursion formula of second-order recurrent sequences (English)
0 references
14 March 2008
0 references
Let \(\{w_n\}\) be a second order recurrence sequence. The author proves a recursion formula for certain reciprocal sums whose denominators are products of consecutive elements of \(\{w_n\}\). This extends results of \textit{Brother A. Brousseau} [Fibonacci Q. 7, 143--168 (1969; Zbl 0176.32203)] and \textit{R. S. Melham} [Fibonacci Q. 41, No. 1, 59--62 (2003; Zbl 1058.11014)].
0 references
second-order recurrent sequences
0 references
Lucas numbers
0 references
recursion formula
0 references
0 references
0.847274661064148
0 references
0.847274661064148
0 references
0.8291553258895874
0 references
0.8186801075935364
0 references
