Abstract
Two closed-form solutions of a general second order linear recurrence with variable coefficients are established. The first form is combinatorial in nature and is derived through the use of a set which counts the number of elements which are two units apart. The second form is closely related to continued fractions and is derived through the use of continued fraction-like relation. Several applications including a number of verifications of conjectures produced from the Ramanujan Machine are worked out, which illustrate its versatility in this respect.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
