Related papers: Generalized Beatty sequences and complementary tri…
A Cullen number is a number of the form $m2^m+1$, where $m$ is a positive integer. In 2004, Luca and St\u anic\u a proved, among other things, that the largest Fibonacci number in the Cullen sequence is $F_4=3$. Actually, they searched for…
Complementary symmetric Rote sequences are binary sequences which have factor complexity $\mathcal{C}(n) = 2n$ for all integers $n \geq 1$ and whose languages are closed under the exchange of letters. These sequences are intimately linked…
This article investigates integer sequences that partition the sequence into blocks of various lengths - irregular arrays. The main result of the article is explicit formulas for numbering of irregular arrays. A generalization of Cantor…
Regular sequences are natural generalisations of fixed points of constant-length substitutions on finite alphabets, that is, of automatic sequences. Using the harmonic analysis of measures associated with substitutions as motivation, we…
Let $V_{n}$ denote the third order linear recursive sequence defined by the initial values $V_{0}$, $V_{1}$ and $V_{2}$ and the recursion $V_{n}=rV_{n-1}+sV_{n-2}+tV_{n-3}$ if $n\geq 3$, where $r$, $s$, and $t$ are real constants. The…
Generalized quantum statistics such as para-Fermi statistics is characterized by certain triple relations which, in the case of para-Fermi statistics, are related to the orthogonal Lie algebra B_n=so(2n+1). In this paper, we give a quite…
We present a quite curious generalization of multi-step Fibonacci numbers. For any positive rational $q$, we enumerate binary words of length $n$ whose maximal factors of the form $0^a1^b$ satisfy $a = 0$ or $aq > b$. When $q$ is an integer…
Generalized symmetry extends the usual notion of symmetry to ones that are of higher-form, acting on subsystems, non-invertible, etc. The concept was originally defined in the field theory context using the idea of topological defects. On…
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.…
It is conjectured that there is a converging sequence of some generalized Fibonacci ratios, given the difference between consecutive ratios, such as the Golden Ratio, $\varphi^1$, and the next golden ratio $\varphi^2$. Moreover, the graphic…
We identify pairs of positive integers $(t, d)$ with the property that the integer sequence with general term $\lfloor{n^t/d\rfloor}$ contains at most finitely many primes.
We introduce the sequence of generalized Gon\v{c}arov polynomials, which is a basis for the solutions to the Gon\v{c}arov interpolation problem with respect to a delta operator. Explicitly, a generalized Gon\v{c}arov basis is a sequence…
The normal ordering coefficients of strings consisting of $V,U$ which satisfy $UV=qVU+hV^s$ ($s\in\mathbb N$) are considered. These coefficients are studied in two contexts: first, as a multiple of a sequence satisfying a generalized…
An occurrence of a classical pattern p in a permutation \pi is a subsequence of \pi whose letters are in the same relative order (of size) as those in p. In an occurrence of a generalized pattern, some letters of that subsequence may be…
The Concepts of poly-Bernoulli numbers $B_n^{(k)}$, poly-Bernoulli polynomials $B_n^{k}{(t)}$ and the generalized poly-bernoulli numbers $B_{n}^{(k)}(a,b)$ are generalized to $B_{n}^{(k)}(t,a,b,c)$ which is called the generalized…
Sequence transformations accomplish an acceleration of convergence or a summation in the case of divergence by detecting and utilizing regularities of the elements of the sequence to be transformed. For sufficiently large indices, certain…
A de Bruijn sequence of order $k$ over a finite alphabet is a cyclic sequence with the property that it contains every possible $k$-sequence as a substring exactly once. Orthogonal de Bruijn sequences are collections of de Bruijn sequences…
For a graph $\Gamma=(V(\Gamma),E(\Gamma))$, a subset $C$ of $V(\Gamma)$ is called an $(\alpha,\beta)$-regular set in $\Gamma$, if every vertex of $C$ is adjacent to exactly $\alpha$ vertices of $C$ and every vertex of $V(\Gamma)\setminus C$…
A sequence $S=s_{1}s_{2}..._{n}$ is \emph{nonrepetitive} if no two adjacent blocks of $S$ are identical. In 1906 Thue proved that there exist arbitrarily long nonrepetitive sequences over 3-element set of symbols. We study a generalization…
Let \(C(x)\), \(A(x)\), and \(N(x)\) denote the counting functions of cyclic, abelian, and nilpotent numbers not exceeding \(x\), respectively. Their asymptotic formulas have been established in recent work by Pollack and Just. In this…