English
Related papers

Related papers: Study of Meta-Fibonacci Integer Sequences by Conti…

200 papers

Hofstadter's $G$ function is recursively defined via $G(0)=0$ and then $G(n)=n-G(G(n-1))$. Following Hofstadter, a family $(F_k)$ of similar functions is obtained by varying the number $k$ of nested recursive calls in this equation. We…

Discrete Mathematics · Computer Science 2025-04-14 Pierre Letouzey

The generalized Fibonacci sequences are sequences $\{f_n\}$ which satisfy the recurrence $f_n(s, t) = sf_{n - 1}(s, t) + tf_{n - 2}(s, t)$ ($s, t \in \mathbb{Z}$) with initial conditions $f_0(s, t) = 0$ and $f_1(s, t) = 1$. In a recent…

Number Theory · Mathematics 2014-07-31 Soohyun Park

The Fibonacci sequence is a sequence of numbers that has been studied for hundreds of years. In this paper, we introduce the new sequence S_{k,n} with initial conditions S_{k,0} = 2b and S_{k,1} = bk + a, which is generated by the…

Number Theory · Mathematics 2017-05-31 Kyunghwan Song , Youngwoo Kwon

Generalized Fibonacci-like sequences appear in finite difference approximations of the Partial Differential Equations based upon replacing partial differential equations by finite difference equations. This paper studies properties of the…

Discrete Mathematics · Computer Science 2017-05-03 Alexander V. Evako

In this study, several interesting iterative sequences were investigated. First, we define the iterative sequences. We fix function f(n). An iterative sequence starts with a natural number n, and calculates the sequence f(n),f(f(n)),…

General Mathematics · Mathematics 2023-08-15 Shoei Takahashi , Unchone Lee , Hikaru Manabe , Aoi Murakami , Daisuke Minematsu , Kou Omori , Ryohei Miyadera

Hofstadter's G function is recursively defined via $G(0)=0$ and then $G(n)=n-G(G(n-1))$. Following Hofstadter, we vary the number $k$ of nested recursive calls in this equation and obtain a family of functions $(F\_k)$. Here we establish…

Discrete Mathematics · Computer Science 2026-05-25 Pierre Letouzey , Shuo Li , Wolfgang Steiner

Let (F_n^{(k)})_{n\geq -(k-2)} be the k-generalized Fibonacci sequence, defined as the linear recurrence sequence whose first k terms are \(0, 0, \ldots, 0, 1\), and whose subsequent terms are determined by the sum of the preceding k terms.…

Number Theory · Mathematics 2025-01-08 Roberto Alvarenga , Ana Paula Chaves , Maria Eduarda Ramos , Matheus Silva , Marcos Sosa

Finite discrete Huffman sequences, together with their extension to n-dimensional arrays, are highly valued because their discrete aperiodic auto-correlations optimally approximate the continuum form of the delta function. We present here…

Combinatorics · Mathematics 2021-05-31 Imants D. Svalbe , David M. Paganin , Timothy C. Petersen

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

Let (F_n)_{n} be the classical Fibonacci sequence. It is well-known that it satisfies F_{n}^2 + F_{n+1}^2 = F_{2n+1}. In this study, we explore generalizations of this Diophantine equation in several directions. First, we solve the…

Number Theory · Mathematics 2025-01-16 Roberto Alvarenga , Ana Paula Chaves , Maria Eduarda Ramos , Matheus Silva , Marcos Sosa

The Fibonacci sequence, $F_n = F_{n - 1} + F_{n - 2}$, and its counterpart for $n < 0$, the negaFibonacci sequence, $F_{-n} = (-1)^{n + 1} \cdot F_n$, are among the most studied sequences in mathematics. In this paper we will present a new…

Number Theory · Mathematics 2023-08-30 Clemens Schütz , Kristian Kelly

The classical Fibonacci sequence is known to exhibit many fascinating properties. In this paper, we explore the Fibonacci sequence and integer sequences generated by second order linear recurrence relations with positive integer…

Probability · Mathematics 2016-11-11 Arulalan Rajan , R. Vittal Rao , Ashok Rao , H. S. Jamadagni

We give a combinatorial interpretation of a classical meta-Fibonacci sequence defined by G(n) = n - G(G(n-1)) with the initial condition G(1) = 1, which appears in Hofstadter's 'Godel, Escher, Bach: An Eternal Golden Braid'. The…

Combinatorics · Mathematics 2013-06-18 Mustazee Rahman

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

This paper presents an innovative approach to the study of recurrent sequences by introducing the concept of arithmetic pseudo-operators. Unlike conventional operators, these pseudo-operators are pure complex numbers with specific…

General Mathematics · Mathematics 2025-04-14 Victor Enrique Vizcarra Ruiz

Dynamical sampling deals with frames of the form $\{T^n\varphi\}_{n=0}^\infty$, where $T \in B(\mathcal{H})$ belongs to certain classes of linear operators and $\varphi\in\mathcal{H}$. The purpose of this paper is to investigate a new…

Functional Analysis · Mathematics 2020-03-23 J. Sedghi Moghaddam , A. Najati , Y. Khedmati

We introduce a family of Dirichlet series associated to real quadratic number fields that generalize the ordinary Fibonacci zeta function $\sum F(n)^{-s}$, where $F(n)$ denotes the $n$th Fibonacci number. We then give three different…

Number Theory · Mathematics 2025-02-12 Eran Assaf , Chan Ieong Kuan , David Lowry-Duda , Alexander Walker

In the paper, from the point of view of recurrent numbers of the Jacobsthal type, the Collatz problem with the general aq+-1 function of conjecture odd positive integers q from the set of natural numbers is investigated. Formulated…

General Mathematics · Mathematics 2023-08-08 Petro Kosobutskyy

We study log-concavity properties of real sequences $(a_n)_{n \ge 0}$ satisfying a $d$-th order linear recurrence whose coefficients are linear functions of $n$; the so-called P-recursive (or holonomic) sequences. Writing the recurrence in…

Combinatorics · Mathematics 2026-04-17 Piero Giacomelli

A nondecreasing sequence of positive integers is $(\alpha,\beta)$-Conolly, or Conolly-like for short, if for every positive integer $m$ the number of times that $m$ occurs in the sequence is $\alpha + \beta r_m$, where $r_m$ is $1$ plus the…

Combinatorics · Mathematics 2015-09-10 Alejandro Erickson , Abraham Isgur , Bradley W. Jackson , Frank Ruskey , Stephen M. Tanny