English
Related papers

Related papers: The Behavior of a Three-Term Hofstadter-Like Recur…

200 papers

We study the parity-perturbed Hofstadter-type recursion $$ Q(1)=Q(2)=1,\qquad Q(n)=Q(n-Q(n-1))+Q(n-Q(n-2))+(-1)^n . $$ We prove, by computer-certified finite-state induction, that this recursion is well-defined for all $(n\ge 1)$. The proof…

Combinatorics · Mathematics 2026-05-19 Marco Mantovanelli

We establish three-term recurrence relations for the ${}_1\phi_1$ and ${}_0\phi_1$ basic hypergeometric series involving multiplicative shifts of the parameters and the variable by integer powers of q. The coefficients of these recurrence…

Classical Analysis and ODEs · Mathematics 2026-02-27 Yuka Yamaguchi

I propose and investigate the use of continuous functional equations for the study of meta-Fibonacci integer sequences. This exploratory study includes three sequences with quite different behavior: Conway's famous sequence $A(n)=…

Statistical Mechanics · Physics 2026-03-19 Klaus Pinn

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

We consider the $k$-nested sum of integer powers, $F(n,m,k)$, defined as repeated partial sums of the classical Faulhaber polynomials. We provide an explicit recurrence relation relating $F(n,m,k)$ to sums of lower power $m-1$ and higher…

Combinatorics · Mathematics 2025-11-21 Alexander R. Povolotsky

For $p, q\in \mathbb{N}$, a finite nonempty set $F$ is said to be $(p,q)$-Schreier (or maximal $(p,q)$-Schreier, respectively) if $q\min F\ge p|F|$ (or $q\min F = p|F|$, respectively). For $n\in \mathbb{N}$, let $$\mathcal{S}^{p/q}_{n}\ :=\…

Combinatorics · Mathematics 2026-02-17 Hung Viet Chu , Zachary Louis Vasseur

We exhibit a three parameter infinite family of quadratic recurrence relations inspired by the well known Somos sequences. For one infinite subfamily we prove that the recurrence generates an infinite sequence of integers by showing that…

Combinatorics · Mathematics 2009-04-07 Paul Heideman , Emilie Hogan

We present some necessary and/or sufficient conditions for the positivity problem of three-term recurrence sequences. As applications we show the positivity of diagonal Taylor coefficients of some rational functions in a unified approach.…

Combinatorics · Mathematics 2023-01-06 Yanni Pei , Yaling Wang , Yi Wang

On the set of positive integers, we consider the iterative process that maps $n$ to either $\frac{3n+1}{2}$ or $\frac{n}{2}$ depending on the parity of $n$. The Collatz conjecture states that all such sequences eventually enter the trivial…

General Mathematics · Mathematics 2026-05-19 Olivier Rozier , Claude Terracol

We study a) the limit of the ratio of two consecutive terms in such a sequence and b) the limit of the ratio of two terms in which one has a lag equal to 2. In the general case limit a) does not exist but we have two limiting values…

Combinatorics · Mathematics 2007-05-23 Mario Catalani

A number of observations are made on Hofstadter's integer sequence defined by Q(n)= Q(n-Q(n-1))+Q(n-Q(n-2)), for n > 2, and Q(1)=Q(2)=1. On short scales the sequence looks chaotic. It turns out, however, that the Q(n) can be grouped into a…

chao-dyn · Physics 2009-09-25 K. Pinn

Inversion sequences of length $n$, $\mathbf{I}_n$, are integer sequences $(e_1, \ldots, e_n)$ with $0 \leq e_i < n$ for each $i$. The study of patterns in inversion sequences was initiated recently by Mansour-Shattuck and…

Combinatorics · Mathematics 2018-01-09 Megan A. Martinez , Carla D. Savage

Nearly linear recurrences are a generalisation of linear recurrences and are instances of linear time-invariant systems in control theory and linear constraint loops in program analysis. In this paper we formulate the Positivity Problem for…

Dynamical Systems · Mathematics 2026-03-04 Amaury Pouly , Mahsa Shirmohammadi , James Worrell

We prove, under different natural hypotheses, that the random multidimensional affine recursion $X_n=A_nX_{n-1}+B_n\in\mathbb{R}^d, n \geq 1,$ is recurrent in the critical case. In particular we cover the cases where the matrices $A_n$ are…

Probability · Mathematics 2024-08-08 Richard Aoun , Sara Brofferio , Marc Peigné

We study the properties of the third order sequence $(w_n)=\left(w_n(a,b,c; r, s,t)\right)$ defined by the recurrence relation $w_n = rw_{n - 1} + sw_{n - 2} + tw_{n - 3}\, (n \ge 3)$ with $w_0 = a,\,w_1 = b,\,w_2=c$, where $a$, $b$, $c$,…

Number Theory · Mathematics 2019-06-13 Kunle Adegoke

Let $ \prod_{i=1}^d (X-\alpha_i Y) \in{\mathbb C}[X,Y]$ be a binary form and let $\epsilon_1,\dots,\epsilon_d$ be nonzero complex numbers. We consider the family of binary forms $ \prod_{i=1}^d (X-\alpha_i \epsilon_i^aY)$, $a\in {\mathbb…

Number Theory · Mathematics 2018-02-15 Claude Levesque , Michel Waldschmidt

This paper studies non-autonomous Lyness type recurrences of the form $x_{n+2}=(a_n+x_{n+1})/x_{n}$, where $\{a_n\}$ is a $k$-periodic sequence of positive numbers with primitive period $k$. We show that for the cases $k\in\{1,2,3,6\}$ the…

Dynamical Systems · Mathematics 2015-02-19 Anna Cima , Armengol Gasull , Víctor Mañosa

We use the theory of q-characters to establish a number of short exact sequences in the category of finite-dimensional representations of the quantum affine groups of types A and B. That allows us to introduce a set of 3-term recurrence…

Quantum Algebra · Mathematics 2012-12-07 E. Mukhin , C. A. S. Young

Through the following, we establish the conditions which allow us to express recursive sequences of real numbers, enumerated through the recurrence relation a_{n+1} = Aa_n + Ba_{n-1}, by means of algebraic equations in two variables of…

Number Theory · Mathematics 2008-03-25 Luigi Cimmino

An infinite sequence $\langle{u_n}\rangle_{n\in\mathbb{N}}$ of real numbers is holonomic (also known as P-recursive or P-finite) if it satisfies a linear recurrence relation with polynomial coefficients. Such a sequence is said to be…