Related papers: Arithmetic of Some Sequences Via $2$-determinants
The Hofstadter Q-sequence, with its simple definition, has defied all attempts at analyzing its behavior. Defined by a simple nested recurrence and an initial condition, the sequence looks approximately linear, though with a lot of noise.…
The Ap\'ery numbers may be defined by a cubic three-term recurrence relation, that is, a three-term relation where the coefficients are polynomials in the index of degree $3$. In this work, we first provide a systematic review of Ap\'ery…
In a recent paper, Bilu et al. studied a conjecture of Marques and Lengyel on the $p$-adic valuation of the Tribonacci sequence. In this article, we study the $p$-adic valuation of third order linear recurrence sequences by considering a…
Motivated by a recent work of Tr\"umper we consider the general Collatz word (up-down pattern) and the sequences following this pattern. The recurrences for the first and last sequence entries are given, obtained from repeated application…
We explore some connections between vectors of integers and integer partitions seen as bi-infinite words. This methodology enables us to give a combinatorial interpretation of the Macdonald identities for affine root systems of the seven…
In this paper, algorithms are developed for computing the Stirling transform and the inverse Stirling transform; specifically, we investigate a class of sequences satisfying a two-term recurrence. We derive a general identity which…
We prove various congruences for Catalan and Motzkin numbers as well as related sequences. The common thread is that all these sequences can be expressed in terms of binomial coefficients. Our techniques are combinatorial and algebraic:…
By prepending zeros to a given sequence Hankel determinants of backward shifts of this sequence become meaningful. We obtain some results for the sequences of Catalan numbers and of some numbers and polynomials which are related to Catalan…
We deliver here second new $\textit{H(x)}-binomials'$ recurrence formula, were $H(x)-binomials' $ array is appointed by $Ward-Horadam$ sequence of functions which in predominantly considered cases where chosen to be polynomials . Secondly,…
In this paper, we consider a generalization of Horadam sequence {w_n} which is defined by the recurrence w_n = aw_n-1 + cw_n-2; if n is even, w_n = bw_n-1 + cw_n-2; if n is odd with arbitrary initial conditions w_0, w_1 and nonzero real…
Let $(x_n)_{n\geq0}$ be a linear recurrence sequence of order $k\geq2$ satisfying $$x_n=a_1x_{n-1}+a_2x_{n-2}+\dots+a_kx_{n-k}$$ for all integers $n\geq k$, where $a_1,\dots,a_k,x_0,\dots, x_{k-1}\in \mathbb{Z},$ with $a_k\neq0$. In 2017,…
A partial order is called semilinear iff the upper bounds of each element are linearly ordered and any two elements have a common upper bound. There exists, up to isomorphism, a unique countable existentially closed semilinear order, which…
In this note, we establish a new closed formula for the solution of homogeneous second-order linear difference equations with constant coefficients by using matrix theory. This, in turn, gives new closed formulas concerning all sequences of…
A double occurrence word $w$ over a finite alphabet $\Sigma$ is a word in which each alphabet letter appears exactly twice. Such words arise naturally in the study of topology, graph theory, and combinatorics. Recently, double occurrence…
An integer sequence that is defined by initial values and a linear recurrence with constant integer coefficients, can be represented by the difference of two arithmetic terms containing exponentiation. All constants occuring in the term are…
Let $\alpha_1, \cdots, \alpha_d$ be real numbers, and let $S$ be the set of integers $s$ so that $||\alpha_i s||_{\mathbb{R}/\mathbb{Z}}>\delta$ for some $i$ and some fixed $\delta>0$. We prove $S$ is not \enquote{$2$-large}, i.e. there is…
The objective of this paper is to complete certain issues from our recent contribution [J. Calatayud, J.-C. Cort\'es, M. Jornet, L. Villafuerte, Random non-autonomous second order linear differential equations: mean square analytic…
Let $(F_n)_{n\geq 0}$ be the Fibonacci sequence given by the recurrence $F_{n+2}=F_{n+1}+F_n$, for $n\geq 0$, where $F_0=0$ and $F_1=1$. There are several generalizations of this sequence and also several interesting identities. In this…
We evaluate a determinant of generalized Fibonacci numbers, thus providing a common generalization of several determinant evaluation results that have previously appeared in the literature, all of them extending Cassini's identity for…
We show that recent determinant evaluations involving Catalan numbers and generalisations thereof have most convenient explanations by combining the Lindstr\"om-Gessel-Viennot theorem on non-intersecting lattice paths with a simple…