Related papers: A characterization of B\"uchi's integer sequences …
The polynomial-time computability of the permanent over fields of characteristic 3 for k-semi-unitary matrices (i.e. square matrices such that the differences of their Gram matrices and the corresponding identity matrices are of rank k) in…
Recently, in Das et al. (Mediterr. J. Math. 21 : 164, 2024), characterized subgroups are investigated for some special kind of non-arithmetic sequences. In this note, we study subsequent problems in case of ``statistically characterized…
Butcher series, also called B-series, are a type of expansion, fundamental in the analysis of numerical integration. Numerical methods that can be expanded in B-series are defined in all dimensions, so they correspond to \emph{sequences of…
An abelian square is a string of length 2n where the last n symbols form a permutation of the first n symbols. In this note we count the number of abelian squares and give an asymptotic estimate of this quantity.
We use the grid consisting of bits of 3^n to motivate the definition of 2-adic numbers. Specifically, we exhibit diagonal stripes in the bits of 3^(2^n), which turn out to be the first in an infinite sequence of such structures. Our…
This paper gives a brief description of the author's database of integer sequences, now over 35 years old, together with a selection of a few of the most interesting sequences in the table. Many unsolved problems are mentioned.
In this paper we first study the isoperimetric problem in the case of integer triangles, as well as Alcuin's sequence and how it relates to the number of different integer triangles with a given perimeter. We then present and compare two…
We introduce a class of stochastic integer sequences. In these sequences, every element is a sum of two previous elements, at least one of which is chosen randomly. The interplay between randomness and memory underlying these sequences…
The linear complexity of a sequence $s$ is one of the measures of its predictability. It represents the smallest degree of a linear recursion which the sequence satisfies. There are several algorithms to find the linear complexity of a…
We present a modified version of Buczolich and Mauldin's proof that the sequence of square numbers is universally L^1-bad. We extend this result to a large class of sequences, including the dth powers and the set of primes; furthermore, we…
We define a triangular array closely related to Stern's diatomic array and show that for a fixed integer $r\geq 1$, the sum $u_r(n)$ of the $r$th powers of the entries in row $n$ satisfy a linear recurrence with constant coefficients. The…
New integrability properties of a family of sequences of ordinary differential equations, which contains the Riccati and Abel chains as the most simple sequences, are studied. The determination of n generalized symmetries of the nth-order…
Over 300 sequences and many unsolved problems and conjectures related to them are presented herein together with theorems corollaries, formulae, examples, mathematical criteria, etc. (about integer sequences, numbers, quotients, residues,…
We count the number of occurrences of restricted patterns of length 3 in permutations with respect to length and the number of cycles. The main tool is a bijection between permutations in standard cycle form and weighted Motzkin paths.
A decomposition of a natural number n is a sequence of consecutive natural numbers that sums to n. We construct a one-to-one correspondence between the odd factors of a natural number and its decompositions. We study the decompositions by…
Morphic sequences form a natural class of infinite sequences, extending the well-studied class of automatic sequences. Where automatic sequences are known to have several equivalent characterizations and the class of automatic sequences is…
A survey of properties of a sequence of coefficients appearing in the evaluation of a quartic definite integral is presented. These properties are of analytical, combinatorial and number-theoretical nature.
Sequences of Genocchi numbers of the first and second kind are considered. For these numbers, an approach based on their representation using sequences of polynomials is developed. Based on this approach, for these numbers some identities…
Extending earlier work of R. Donaghey and P. J. Cameron, we investigate some canonical "eigen-sequences" associated with transformations of integer sequences. Several known sequences appear in a new setting: for instance the sequences (such…
The linear complexity is a measure for the unpredictability of a sequence over a finite field and thus for its suitability in cryptography. In 2012, Diem introduced a new figure of merit for cryptographic sequences called expansion…