中文
相关论文

相关论文: On the linear space of the two-sided generalized F…

200 篇论文

A random Fibonacci sequence is defined by the relation g_n = | g_{n-1} +/- g_{n-2} |, where the +/- sign is chosen by tossing a balanced coin for each n. We generalize these sequences to the case when the coin is unbalanced (denoting by p…

概率论 · 数学 2009-02-04 Elise Janvresse , Benoît Rittaud , Thierry De La Rue

For the Lucas sequence $\{U_{k}(P,Q)\}$ we discuss the identities such as the well-known Fibonacci identities. We also propose a method for obtaining identities involving recurrence sequences. With the help of which we find an interpolating…

数论 · 数学 2018-05-18 Dmitry I. Khomovsky

Given k>1, let a_n be the sequence defined by the recurrence a_n=c_1a_{n-1}+c_2a_{n-2}+...+c_ka_{n-k} for n>=k, with initial values a_0=a_1=...=a_{k-2}=0 and a_{k-1}= 1. We show under a couple of assumptions concerning the constants c_i…

组合数学 · 数学 2014-10-28 Toufik Mansour , Mark Shattuck

Zeckendorf's theorem states that every positive integer can be written uniquely as the sum of non-consecutive shifted Fibonacci numbers $\{F_n\}$, where we take $F_1=1$ and $F_2=2$. This has been generalized for any Positive Linear…

Double Fibonacci sequences are introduced and they are related to operations with Fibonacci modules. Generalizations and examples are also discussed.

交换代数 · 数学 2008-10-23 Abdul Rauf Nizami

In this paper, we define a variant of Fibonacci-like sequences that we call prime Fibonacci sequences, where one takes the sum of the previous two terms and returns the smallest odd prime divisor of that sum as the next term. We prove that…

数论 · 数学 2015-07-20 Jeremy Alm , Taylor Herald

Let $(G_k)_{k\in\mathbb Z}$ be any sequence obeying the recurrence relation of the Fibonacci numbers. We derive formulas for $\sum_{j=1}^n{G_{j + t}^6}$ and $\sum_{j=1}^n{(-1)^{j - 1}G_{j + t}^5(G_{j + t - 1} + G_{j + t + 1})}$, thereby…

综合数学 · 数学 2024-01-19 Kunle Adegoke , Olawanle Layeni

We consider sums of the form \[\sum_{j=0}^{n-1}F_1(a_1n+b_1j+c_1)F_2(a_2n+b_2j+c_2)... F_k(a_kn+b_kj+c_k),\] in which each $\{F_i(n)\}$ is a sequence that satisfies a linear recurrence of degree $D(i)<\infty$, with constant coefficients. We…

组合数学 · 数学 2007-05-23 Curtis Greene , Herbert S. Wilf

In this paper, we consider a generalization of Horadam sequence {w_n} which is defined by the recurrence w_n = aw_n-1 + cw_n-2; if n is even, w_n = bw_n-1 + cw_n-2; if n is odd with arbitrary initial conditions w_0, w_1 and nonzero real…

数论 · 数学 2019-03-04 Elif Tan , Ho-Hon Leung

Solutions to the random Fibonacci recurrence x_{n+1}=x_{n} + or - Bx_{n-1} decrease (increase) exponentially, x_{n} = exp(lambda n), for sufficiently small (large) B. In the limits B --> 0 and B --> infinity, we expand the Lyapunov exponent…

统计力学 · 物理学 2009-11-07 Clément Sire , Paul L. Krapivsky

For each positive integer $n$, the Fibonacci-sum graph $G_n$ on vertices $1,2,\ldots,n$ is defined by two vertices forming an edge if and only if they sum to a Fibonacci number. It is known that each $G_n$ is bipartite, and all Hamiltonian…

组合数学 · 数学 2017-10-31 Andrii Arman , David S. Gunderson , Pak Ching Li

In this paper, for the generalized Fibonacci sequence $\left\{W_n\left(a,b,p,q\right)\right\}$, by using elementary methods and techniques, we give the asymptotic estimation values of…

数论 · 数学 2025-09-19 Yongkang Wan , Zhonghao Liang , Qunying Liao

For an integer $k\geq 2$, let $\{F^{(k)}_{n}\}_{n\geqslant 2-k}$ be the $ k$--generalized Fibonacci sequence which starts with $0, \ldots, 0,1$ (a total of $k$ terms) and for which each term afterwards is the sum of the $k$ preceding terms.…

数论 · 数学 2018-04-10 Mahadi Ddamulira , Florian Luca

In this paper, we study the periodicity structure of finite field linear recurring sequences whose period is not necessarily maximal and determine necessary and sufficient conditions for the characteristic polynomial~\(f\) to have exactly…

组合数学 · 数学 2021-03-02 Ghurumuruhan Ganesan

Let $a, b\in \mathbb{N}$ be relatively prime. We consider $(a-1)(b-1)/2$, which arises in the study of the $pq$-th cyclotomic polynomial, where $p,q$ are distinct primes. We prove two possible representations of $(a-1)(b-1)/2$ as…

数论 · 数学 2020-01-23 Hung Viet Chu

We show that if $k\ge 2$ is an integer and $(F_n^{(k)})_{n\ge 0}$ is the sequence of $k$-generalized Fibonacci numbers, then there are only finitely many triples of positive integers $1<a<b<c$ such that $ab+1,~ac+1,~bc+1$ are all members of…

数论 · 数学 2018-10-30 Clemens Fuchs , Christoph Hutle , Florian Luca , Laszlo Szalay

This paper describes a class of sequences that are in many ways similar to Fibonacci sequences: given n, sum the previous two terms and divide them by the largest possible power of n. The behavior of such sequences depends on n. We analyze…

数论 · 数学 2014-03-20 Brandon Avila , Tanya Khovanova

In this paper we focus on finding all the factorials expressible as a product of a fixed number of $2k$-nacci numbers with $k \geq 2$. We derive the 2-adic valuation of the $2k$-nacci sequence and use it to establish bounds on the solutions…

数论 · 数学 2017-02-21 Bartosz Sobolewski

Recently, a new generalization of Pascal's triangle, the so-called hyperbolic Pascal triangles were introduced. The mathematical background goes back to the regular mosaics in the hyperbolic plane. In this article, we investigate the paths…

数论 · 数学 2017-01-26 László Németh , László Szalay

In the \textit{Fibonacci Quarterly} in 1964, C.~R.~Wall gave the following weighted sum of generalized Fibonacci numbers: $\sum_{i=1}^n i G_i = n G_{n+2} - G_{n+3} + G_3$, where $\left(G_n\right)_{n \geq 0}$ is defined by the recurrence…

数论 · 数学 2025-11-24 aBa Mbirika