English
Related papers

Related papers: Generalised Fibonacci sequences constructed from b…

200 papers

We establish several recurrence relations and an explicit formula for V(n), the number of factorizations of the length-n prefix of the Fibonacci word into a (not necessarily strictly) decreasing sequence of standard Fibonacci words. In…

Combinatorics · Mathematics 2019-01-08 Pierre Bonardo , Anna E. Frid , Jeffrey Shallit

In this paper, new families of generalized Fibonacci and Lucas numbers are introduced. In addition, we present the recurrence relations and the generating functions of the new families for $k=2$.

Combinatorics · Mathematics 2017-10-03 Gamaliel Cerda-Morales

A Galileo sequence \((a_n)\) is a sequence of positive integers whose partial sums $S_n$ satisfy $S_{2n}=kS_n$ for some $k>1$. In this paper we prove that every polynomial Galileo sequence is given by first differences of the form \(a_n=…

General Mathematics · Mathematics 2026-04-24 William Cheah , David Treeby

By considering the tiling of an $N$-board (a linear array of $N$ square cells of unit width) with new types of tile that we refer to as combs, we give a combinatorial interpretation of the product of two consecutive generalized Fibonacci…

Combinatorics · Mathematics 2024-09-04 Michael A. Allen , Kenneth Edwards

We present a particularly nice Binet-style formula that can be used to produce the k-generalized Fibonacci numbers (that is, the Tribonaccis, Tetranaccis, etc). Furthermore, we show that in fact one needs only take the integer closest to…

Number Theory · Mathematics 2022-02-25 Gregory P. Dresden

Let $p$ be a prime number. A chain $\{p,2p+1,4p+3,\cdots,(p+1)2^{l(p)-1}-1\}$ is called the Cunningham chain generated by $p$ if all elements are prime number and $(p+1)2^{l(p)}-1$ is composite. Then $l(p)$ is called the length of the…

Number Theory · Mathematics 2022-05-25 Yuya Kanado

In this paper we prove an extreme value law for a stochastic process obtained by iterating the R\'enyi map $x \mapsto \beta x \pmod 1$, where we assume that $\beta>1$ is an integer. Haiman (2018) derived a recursion formula for the Lebesgue…

Dynamical Systems · Mathematics 2020-12-14 N. B-S. Boer , A. E. Sterk

We give a simplified presentation of some results about recurrences of certain sequences of binomial sums in terms of (generalized) Fibonacci and Lucas polynomials.

Number Theory · Mathematics 2022-12-06 Johann Cigler

We present numerous interesting, mostly new, results involving the $n$-step Fibonacci numbers and $n$-step Lucas numbers and a generalization. Properties considered include recurrence relations, summation identities, including binomial and…

Number Theory · Mathematics 2018-08-09 Kunle Adegoke

We prove that certain sequences of finite continued fractions associated with a 2-periodic continued fraction with period a,b>0 are moment sequences of discrete signed measures supported in the interval [-1,1], and we give necessary and…

Classical Analysis and ODEs · Mathematics 2009-02-10 Christian Berg , Antonio J. Durán

In 2021, Guyer and Mbirika gave two equivalent formulas that computed the greatest common divisor (GCD) of all sums of $k$ consecutive terms in the generalized Fibonacci sequence $\left(G_n\right)_{n \geq 0}$ given by the recurrence $G_n =…

Number Theory · Mathematics 2023-01-18 aBa Mbirika , Jürgen Spilker

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…

Number Theory · Mathematics 2025-11-24 aBa Mbirika

Classical studies of the Fibonacci sequence focus on its periodicity modulo $m$ (the Pisano periods) with canonical initialization. We investigate instead the complete periodic structure arising from all $m^2$ possible initializations in…

Number Theory · Mathematics 2026-04-10 Marc T. Pudelko

The construction of complementary sets (CSs) of sequences with different set size and sequence length become important due to its practical application for OFDM systems. Most of the constructions of CSs, based on generalized Boolean…

Information Theory · Computer Science 2020-02-19 Gaoxiang Wang , Avik Ranjan Adhikary , Zhengchun Zhou , Yang Yang

We study determinants of matrices whose entries are powers of Fibonacci numbers. We then extend the results to include entries that are powers of generalized Fibonacci numbers defined as a second-order linear recurrence relation. These…

Combinatorics · Mathematics 2016-08-02 Aram Tangboonduangjit , Thotsaporn Thanatipanonda

We study generalizations of the sequence of the n-anacci constants that consist of the ratio limits generated by linear recurrences of an arbitrary order n with equal positive weights p. We derive the analytic representation of these ratio…

Number Theory · Mathematics 2014-09-03 Igor Szczyrba , Rafal Szczyrba , Martin Burtscher

In this article we present a new recurrence formula for a finite sum involving the Fibonacci sequence. Furthermore, we state an algorithm to compute the sum of a power series related to Fibonacci series, without the use of term-by-term…

History and Overview · Mathematics 2008-05-20 Adilson J. V. Brandao , Joao L. Martins

We consider $m$-th order linear recurrences that can be thought of as generalizations of the Lucas sequence. We exploit some interplay with matrices that again can be considered generalizations of the Fibonacci matrix. We introduce the…

Combinatorics · Mathematics 2007-05-23 Mario Catalani

The summation formula within pascalian triangle resulting in the fibonacci sequence is extended to the $q$-binomial coefficients $q$-gaussian triangles.

Combinatorics · Mathematics 2008-02-11 A. K. Kwasniewski

This paper investigates Frequentist consistency properties of the posterior distributions constructed via Generalized Variational Inference (GVI). A number of generic and novel strategies are given for proving consistency, relying on the…

Statistics Theory · Mathematics 2019-12-12 Jeremias Knoblauch
‹ Prev 1 4 5 6 7 8 10 Next ›