• Communications of the Korean Mathematical Society
• /
• v.37 no.4
• /
• pp.977-988
• /
• 2022

The Padovan sequence is the third-order linear recurrence (𝓟_n)_n≥0 defined by 𝓟_n = 𝓟_n-2 + 𝓟_n-3 for all n ≥ 3 with initial conditions 𝓟₀ = 0 and 𝓟₁ = 𝓟₂ = 1. In this paper, we investigate a generalization of the Padovan sequence called the k-generalized Padovan sequence which is generated by a linear recurrence sequence of order k ≥ 3. We present recurrence relations, the generalized Binet formula and different arithmetic properties for the above family of sequences.

• Honam Mathematical Journal
• /
• v.34 no.4
• /
• pp.533-548
• /
• 2012

We investigate relations of polynomials $x^n={\Sigma}^{n-1}_{i=0}x^i$ and recurrence sequences. We consider certain variations of the Fibonacci sequence and investigate explicit ways to compute the general nth term.

• Journal of Integrative Natural Science
• /
• v.5 no.2
• /
• pp.131-134
• /
• 2012

Bae and Kim displayed a sequence of 4th degree self-reciprocal polynomials whose maximal zeros are related in a very nice and far from obvious way. Kim showed that the auxiliary polynomials in their results are related to Chebyshev polynomials. In this paper, we study two sequences of polynomials satisfying the recurrence of the auxiliary polynomials with generalized initial conditions. We obtain same results with the auxiliary polynomials from a sequence, and some interesting conjectural properties about resultants and discriminants from another sequence.

• Bulletin of the Korean Mathematical Society
• /
• v.57 no.4
• /
• pp.1033-1048
• /
• 2020

We synthesize the recent work done on conditionally defined Lucas and Fibonacci numbers, tying together various definitions and results generalizing the linear recurrence relation. Allowing for any initial conditions, we determine the generating function and a Binet-like formula for the general sequence, in both the positive and negative directions, as well as relations among various sequence pairs. We also determine conditions for periodicity of these sequences and graph some recurrent figures in Python.

• Honam Mathematical Journal
• /
• v.39 no.4
• /
• pp.665-675
• /
• 2017

Several properties of the sequence generated from a kind of Danzer matrices were examined and proved using already known facts about the Chebyshev polynomials. Asymptotic behavior of our interest sequence also discussed.

• Communications of the Korean Mathematical Society
• /
• v.34 no.2
• /
• pp.429-437
• /
• 2019

Dilcher and Stolarsky [1] recently studied a sequence resembling the Chebyshev polynomials of the first kind. In this paper, we follow their some research directions to the Chebyshev polynomials of the second kind. More specifically, we consider a sequence resembling the Chebyshev polynomials of the second kind in two different ways, and investigate its properties including relations between this sequence and the sequence studied in [1], zero distribution and the irreducibility.

• Communications of Mathematical Education
• /
• v.27 no.4
• /
• pp.357-367
• /
• 2013

It is important to make students do research for oneself. But the practice of inquiry activity is not easy in the mathematics education field. Intellectual curiosities of students are unpredictable. It is important to meet intellectual curiosities of students. We could get a sequence in the process solving a problem. This sequence was expressed in a form of the recurrence relation $a_n=a_{n-1}+a_{n-3}$ ($n{\geq}4$), $a_1=a_2=a_3=1$. We tried to look for the general terms of this sequence. This sequence is similar to Fibonacci sequence, but the process finding the general terms is never similar to Fibonacci sequence. We can get two general terms expressed in different form after our a great deal of effort. We hope that this study will give the spot of education energy.

• Bulletin of the Korean Mathematical Society
• /
• v.44 no.4
• /
• pp.841-849
• /
• 2007

In this paper we discuss the Hyers-Ulam-Rassias stability of a system of first order linear recurrences with variable coefficients in Banach spaces. The concept of the Hyers-Ulam-Rassias stability originated from Th. M. Rassias# stability theorem that appeared in his paper: On the stability of the linear mapping in Banach spaces, Proc. Amer. Math. Soc. 72 (1978), 297-300. As an application, the Hyers-Ulam-Rassias stability of a p-order linear recurrence with variable coefficients is proved.

• The Korean Journal of Applied Statistics
• /
• v.22 no.5
• /
• pp.1103-1113
• /
• 2009

We know that the first digits sequence of fibonacci numbers obey Benford's law. For the sequence in which the first two numbers are the arbitrary integers and the recurrence relation $a_{n+2}=a_{n+1}+a_n$ is satisfied, we can find that the first digits sequence of this sequence obey Benford's law. Also, we can find the stucture of the first digits sequence of this sequence with the exploratory data analysis tools.

• Journal of applied mathematics & informatics
• /
• v.33 no.5_6
• /
• pp.593-605
• /
• 2015

In this study, we define r-circulant, circulant, Hankel and Toeplitz matrices involving the integer sequence with recurrence relation U_n = pU_n-1 + U_n-2, with U₀ = a, U₁ = b. Moreover, we obtain special norms of above mentioned matrices. The results presented in this paper are generalizations of some of the results of [1, 10, 11].