English
Related papers

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

200 papers

For the OEIS sequence A002627, defined by the inhomogeneous first-order recurrence $a(n) = n\,a(n-1) + 1$ with $a(0) = 0$, R.~J.~Mathar recorded in February 2014 the conjectured second-order homogeneous recurrence \[ a(n) - (n+1)\,a(n-1) +…

Combinatorics · Mathematics 2026-05-18 Tong Niu

An infinite real sequence $\{a_n\}$ is called an invariant sequence of the first (resp., second) kind if $a_n=\sum_{k=0}^n {n \choose k} (-1)^k a_k$ (resp., $a_n=\sum_{k=n}^{\infty} {k \choose n} (-1)^k a_k$). We review and investigate…

Combinatorics · Mathematics 2017-06-07 Ik-Pyo Kim , Michael J. Tsatsomeros

Recurrence properties of systems and associated sets of integers that suffice for recurrence are classical objects in topological dynamics. We describe relations between recurrence in different sorts of systems, study ways to formulate…

Dynamical Systems · Mathematics 2014-08-13 Bernard Host , Bryna Kra , Alejandro Maass

The Binary Two-Up Sequence is the lexicographically earliest sequence of distinct nonnegative integers with the property that the binary expansion of the n-th term has no 1-bits in common with any of the previous floor(n/2) terms. We show…

Combinatorics · Mathematics 2022-09-12 Michael De Vlieger , Thomas Scheuerle , Rémy Sigrist , N. J. A. Sloane , Walter Trump

Zeckendorf's theorem states that any positive integer can be written uniquely as a sum of non-adjacent Fibonacci numbers; this result has been generalized to many recurrence relations, especially those arising from linear recurrences with…

Combinatorics · Mathematics 2016-07-04 Minerva Catral , Pari L. Ford , Pamela E. Harris , Steven J. Miller , Dawn Nelson

We consider an extension of first-order logic with a recursion operator that corresponds to allowing formulas to refer to themselves. We investigate the obtained language under two different systems of semantics, thereby obtaining two…

Logic · Mathematics 2022-07-18 Reijo Jaakkola , Antti Kuusisto

We develop a technique for estimating the inner eccentricity in hierarchical triple systems with well separated components. We investigate systems with initially circular and coplanar orbits and comparable masses. The technique is based on…

Earth and Planetary Astrophysics · Physics 2014-08-26 Nikolaos Georgakarakos

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

Aperiodic autocorrelation is an important indicator of performance of sequences used in communications, remote sensing, and scientific instrumentation. Knowing a sequence's autocorrelation function, which reports the autocorrelation at…

Information Theory · Computer Science 2025-01-07 Daniel J. Katz , Adeebur Rahman , Michael J Ward

This paper discusses the location of zeros of polynomials in a polynomial sequence $\{P_n(z)\}$ generated by a three-term recurrence relation of the form $P_n(z)+ B(z)P_{n-1}(z) +A(z) P_{n-k}(z)=0$ with $k>2$ and the standard initial…

Complex Variables · Mathematics 2020-10-21 Innocent Ndikubwayo

We introduce cut-free nested sequent systems for a broad class of quantified modal logics (QMLs). The QMLs we consider are semantically defined using relational models that assign both an inner and outer domain to each world. This rich…

Logic in Computer Science · Computer Science 2026-04-21 Tim S. Lyon , Eugenio Orlandelli

Let $H(m,d)$ denote the asymptotic frequency of the natural numbers $k\equiv d \mod m$ in the continued fraction expansions of almost all numbers $x\in[0,1)$. For a fixed number $m\ge 4$, we study $\mathbb Q$-linear relations among the…

Number Theory · Mathematics 2018-06-12 Kurt Girstmair

Recursive processing is considered a hallmark of human linguistic abilities. A recent study evaluated recursive processing in recurrent neural language models (RNN-LMs) and showed that such models perform below chance level on embedded…

Computation and Language · Computer Science 2021-10-15 Yair Lakretz , Théo Desbordes , Dieuwke Hupkes , Stanislas Dehaene

We introduce and analyze a three-parameter family of self-referential integer sequences $S(x,y,z)$: starting from $a(1)=x$, each term advances by $y$ when the index $k$ has already appeared as a value and by $z$ otherwise. This simple rule…

General Mathematics · Mathematics 2025-08-04 Benoit Cloitre

We consider k-step recurrences of the form $z_{n+k} = A(z)/B(z)$, where A and B are linear functions of $z_n, z_{n+1}, ..., z_{n+k-1}$, which we call k-step linear fractional recurrences. The first Theorem in this paper shows that for each…

Dynamical Systems · Mathematics 2009-10-26 Eric Bedford , Kyounghee Kim

The document tries to put focus on sequences with certain properties and periods leading to the first value smaller than the starting value in the Collatz problem. With the idea that, if all starting numbers lead ultimately to a smaller…

General Mathematics · Mathematics 2025-02-14 J. Stöckl

In a recent article, Donoso, Le, Moreira and Sun studied sets of recurrence for actions of the multiplicative semigroup $(\mathbb{N}, \times)$ and provided some sufficient conditions for sets of the form $S=\{(an+b)/(cn+d) \colon n \in…

Number Theory · Mathematics 2025-08-26 Dimitrios Charamaras , Andreas Mountakis , Konstantinos Tsinas

The recursive relation starts to appear by putting a function $y(x)=\sum_{n=0}^{\infty }d_n x^n$ into a linear ordinary differential equation (ODE). There can be $d$-term of sequences in the recurrence relation of a power series where…

Classical Analysis and ODEs · Mathematics 2023-08-04 Yoon-Seok Choun

Deciding the positivity of a sequence defined by a linear recurrence and initial conditions is, in general, a hard problem. When the coefficients of the recurrences are constants, decidability has only been proven up to order 5. The…

Symbolic Computation · Computer Science 2025-03-19 Alaa Ibrahim

We give a new proof of Rudolph's multiple term return times theorem based on Host-Kra structure theory. Our approach provides characteristic factors for all terms, works for arbitrary tempered F{\o}lner sequences and also yields a multiple…

Dynamical Systems · Mathematics 2014-12-31 Pavel Zorin-Kranich