Search

Fix I n i such that Graph HT ht is an integer multiple of Graph HT ht . First, we assume that Graph HT ht is a rational number different from 0. Suppose that Graph HT ht is a rational number. [Extracted from the article]

Abstract: For complex linear homogeneous recursive sequences with constant coefficients we find a necessary and sufficient condition for the existence of the limit of the ratio of consecutive terms. The result can be applied even if the characteristic polynomial has not necessarily roots with modulus pairwise distinct, as in the celebrated Poincaré’s theorem. In case of existence, we characterize the limit as a particular root of the characteristic polynomial, which depends on the initial conditions and that is not necessarily the unique root with maximum modulus and multiplicity. The result extends to a quite general context the way used to find the Golden mean as limit of ratio of consecutive terms of the classical Fibonacci sequence. [Copyright &y& Elsevier]

One of the most interesting properties of Pascal's triangle is that the sequence of the sums of the elements on its diagonals is the best known recurrence sequence, the Fibonacci sequence. It is also known that other diagonals can be associated with other relevant recurrence sequences, such as the Padovan and k -Padovan sequences. In this paper, we see that similar properties also hold for diagonals of generalized Pascal's triangles. We show that the diagonal sums in generalized Pascal's triangles belong to the family of the so-called ' k -Padovan-like sequences' which are linear recurrences of order k with constant coefficients. A recurrence connection between the k -Padovan and k -Padovan-like sequences is derived. [ABSTRACT FROM AUTHOR]