Recursion formula of second-order recurrent sequences (Q2478015): Difference between revisions

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

reviewed by

Olaf Ninnemann

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

second-order recurrent sequences

0 references

Lucas numbers

0 references

recursion formula

0 references

MaRDI profile type

MaRDI publication profile

0 references

0 references

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2478015

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2001220048
@@ Property / OpenAlex ID: W2001220048 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5566613
@@ Property / cites work: Q5566613 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2735217
@@ Property / cites work: Q2735217 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4483711
@@ Property / cites work: Q4483711 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2735226
@@ Property / cites work: Q2735226 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4936072
@@ Property / cites work: Q4936072 / rank @@
+Normal rank