English
Related papers

Related papers: Some Fibonacci-Related Sequences

200 papers

Recently Dekking conjectured the form of the subword complexity function for the Fibonacci-Thue-Morse sequence. In this note we prove his conjecture by purely computational means, using the free software Walnut.

Discrete Mathematics · Computer Science 2020-11-10 Jeffrey Shallit

Divisibility sequences are defined by the property that their elements divide each other whenever their indices do. The divisibility sequences that also satisfy a linear recurrence, like the Fibonacci numbers, are generated by polynomials…

Number Theory · Mathematics 2022-06-22 Sergiy Koshkin

This note is devoted to study the recurrent numerical sequence defined by: $a_0 = 0$, $a_n = \frac{n}{2} a_{n - 1} + (n - 1)!$ ($\forall n \geq 1$). Although, it is immediate that ${(a_n)}_n$ is constituted of rational numbers with…

Number Theory · Mathematics 2022-04-22 Bakir Farhi

In this paper we study substitutions and some of their associated generating functions. This association takes aperiodicity to transcendence, and vice-versa. These generating functions have a recursive structure arising from the…

Combinatorics · Mathematics 2026-05-27 Aisling Pouti , Christopher Ramsey , Nicolae Strungaru

Morphic sequences form a natural class of infinite sequences, extending the well-studied class of automatic sequences. Where automatic sequences are known to have several equivalent characterizations and the class of automatic sequences is…

Formal Languages and Automata Theory · Computer Science 2023-09-20 Hans Zantema

A Redheffer--type matrix with Fibonacci entries is defined, and the determinant and spectral properties of this matrix are studied. Also, more general Redheffer--type matrices are considered and intriguing number-theoretic examples are…

Number Theory · Mathematics 2026-04-08 Aristides V. Doumas , Panayiotis J. Psarrakos

In a recent paper, Frank Ruskey asked whether every linear recurrent sequence can occur in some solution of a meta-Fibonacci sequence. In this paper, we answer his question in the affirmative for recurrences with positive coefficients.

Number Theory · Mathematics 2015-08-11 Nathan Fox

The research aims to construct a new type of matrix called the Fibonacci-Hessenberg-Lorentz matrix by multiplying Fibonacci-Hessenberg matrices with Lorentz matrix multiplication. The study will start by examining the properties of…

General Mathematics · Mathematics 2024-10-31 Ibrahim Gokcan , Ali Hikmet Deger

The convolved Fibonacci numbers F_j^(r) are defined by (1-z-z^2)^{-r}=\sum_{j>=0}F_{j+1}^(r)z^j. In this note some related numbers that can be expressed in terms of convolved Fibonacci numbers are considered. These numbers appear in the…

Combinatorics · Mathematics 2007-05-23 Pieter Moree

The list of properties of Fibonacci numbers F(n) (with multifaceted relevance in physics) is complemented by an empirical observation that in combination with the "next" family of the "delayed Fibonacci" numbers G(n) called, for…

Mathematical Physics · Physics 2016-09-07 Miloslav Znojil

For an arbitrary homogeneous linear recurrence sequence of order d with constant coefficients, we derive recurrence relations for all subsequences with indices in arithmetic progression. The coefficients of these recurrences are given…

Number Theory · Mathematics 2016-11-29 Daniel Birmajer , Juan B. Gil , Michael D. Weiner

In this paper, we study the linear space of all two-sided generalized Fibonacci sequences $\{F_n\}_{n \in \mathbb{Z}}$ that satisfy the recurrence equation of order $k$: $F_n = F_{n-1} + F_{n-2} + \dots + F_{n-k}$. We give two types of…

Number Theory · Mathematics 2023-04-07 Martin Bunder , Joseph Tonien

This paper is devoted to the study of eigen-sequences for some important operators acting on sequences. Using functional equations involving generating functions, we completely solve the problem of characterizing the fixed sequences for the…

Number Theory · Mathematics 2012-12-21 Marco Abrate , Stefano Barbero , Umberto Cerruti , Nadir Murru

In this paper, we give recurrence relations and identities for some integer sequences related to Ward numbers such as Ward-Lah numbers, varied Ward numbers and binomial Ward numbers. Most of the sequences are entered in the On-Line…

Combinatorics · Mathematics 2025-08-15 Aleks Žigon Tankosič

Following Inoue et al., we define a word to be a repetition if it is a (fractional) power of exponent at least 2. A word has a repetition factorization if it is the product of repetitions. We study repetition factorizations in several…

Formal Languages and Automata Theory · Computer Science 2023-11-30 Jeffrey Shallit , Xinhao Xu

In this note we investigate the solutions of certain meta-Fibonacci recurrences of the form $f(n)=f(n-f(n-1))+f(n-2)$ for various sets of initial conditions. In the case when $f(n)=1$ for $n\leq 1$, we prove that the resulting integer…

Number Theory · Mathematics 2022-04-11 Bartosz Sobolewski , Maciej Ulas

We extend our investigation of $2$-determinants, which we defined in a previous paper. For a linear homogenous recurrence of the second order, we consider relations between different sequences satisfying the same linear homogeneous…

Combinatorics · Mathematics 2021-05-12 Dusko Bogdanic , Milan Janjic

Recently there is huge interest in graph theory and intensive study on computing integer powers of matrices. In this paper, we investigate relationships between one type of graph and well-known Fibonacci sequence. In this content, we…

Number Theory · Mathematics 2012-02-09 Fatih Yılmaz , Şerife Burcu Bozkurt , Durmuş Bozkurt

In this article, we introduce and study a new integer sequence referred to as the higher order Mersenne sequence. The proposed sequence is analogous to the higher order Fibonacci numbers and closely associated with the Mersenne numbers.…

Number Theory · Mathematics 2023-07-18 Kalika Prasad , Munesh Kumari , Rabiranjan Mohanta , Hrishikesh Mahato

A generalization of the well--known Fibonacci sequence is the $k$--Fibonacci sequence with some fixed integer $k\ge 2$. The first $k$ terms of this sequence are $0,\ldots,0,1$, and each term afterwards is the sum of the preceding $k$ terms.…

Number Theory · Mathematics 2020-08-25 Eric F. Bravo , Jhon J. Bravo , Carlos A. Gómez