Results 21 to 30 of about 690 (75)
Compositions of positive integers with 2s and 3s
In this article, we consider compositions of positive integers with 2s and 3s. We see that these compositions lead us to results that involve Padovan numbers, and we give some tiling models of these compositions.
Dişkaya Orhan, Menken Hamza
doaj +1 more source
Dynamics of a certain sequence of powers
For any nonzero complex number z we define a sequence a1(z) = z, a2(z)=za1(z),…,an+1(z)=zan(z), n ∈ ℕ. We attempt to describe the set of these z for which the sequence {an(z)} is convergent. While it is almost impossible to characterize this convergence set in the complex plane 𝒞, we achieved it for positive reals.
Roman Sznajder, Kanchan Basnyat
wiley +1 more source
In this paper we introduce the Horadam hybrid numbers and give some their properties: Binet formula, character and generating function.
Szynal-Liana Anetta
doaj +1 more source
Two generalizations of dual-complex Lucas-balancing numbers
In this paper, we study two generalizations of dual-complex Lucas-balancing numbers: dual-complex k-Lucas balancing numbers and dual-complex k-Lucas-balancing numbers.
Bród Dorota+2 more
doaj +1 more source
Stability of second‐order recurrences modulo pr
The concept of sequence stability generalizes the idea of uniform distribution. A sequence is p‐stable if the set of residue frequencies of the sequence reduced modulo pr is eventually constant as a function of r. The authors identify and characterize the stability of second‐order recurrences modulo odd primes.
Lawrence Somer, Walter Carlip
wiley +1 more source
n‐Color partitions with weighted differences equal to minus two
In this paper we study those n‐color partitions of Agarwal and Andrews, 1987, in which each pair of parts has weighted difference equal to −2 Results obtained in this paper for these partitions include several combinatorial identities, recurrence relations, generating functions, relationships with the divisor function and computer produced tables.
A. K. Agarwal, R. Balasubrananian
wiley +1 more source
Partitioning the positive integers with higher order recurrences
Associated with any irrational number α > 1 and the function is an array {s(i, j)} of positive integers defined inductively as follows: s(1, 1) = 1, s(1, j) = g(s(1, j − 1)) for all j ≥ 2, s(i, 1) = the least positive integer not among s(h, j) for h ≤ i − 1 for i ≥ 2, and s(i, j) = g(s(i, j − 1)) for j ≥ 2.
Clark Kimberling
wiley +1 more source
On Quaternion-Gaussian Fibonacci Numbers and Their Properties
We study properties of Gaussian Fibonacci numbers. We start with some basic identities. Thereafter, we focus on properties of the quaternions that accept gaussian Fibonacci numbers as coefficients.
Halici Serpil, Cerda-Morales Gamaliel
doaj +1 more source
On Quaternion Gaussian Bronze Fibonacci Numbers
In the present work, a new sequence of quaternions related to the Gaussian Bronze numbers is defined and studied. Binet’s formula, generating function and certain properties and identities are provided.
Catarino Paula, Ricardo Sandra
doaj +1 more source
On r-Jacobsthal and r-Jacobsthal-Lucas Numbers
Recently, Bród introduced a new Jacobsthal-type sequence which is called r-Jacobsthal sequence in current study. After defining the appropriate r-Jacobsthal–Lucas sequence for the r-Jacobsthal sequence, we obtain some properties of these two sequences ...
Bilgici Göksal, Bród Dorota
doaj +1 more source