相关论文: Numerical Analogues of Aronson's Sequence

Let $S = \{q_1, \ldots , q_s\}$ be a finite, non-empty set of distinct prime numbers. For a non-zero integer $m$, write $m = q_1^{r_1} \ldots q_s^{r_s} M$, where $r_1, \ldots , r_s$ are non-negative integers and $M$ is an integer relatively…

A zero-sum sequence over ${\mathbb Z}$ is a sequence with terms in ${\mathbb Z}$ that sum to $0$. It is called minimal if it does not contain a proper zero-sum subsequence. Consider a minimal zero-sum sequence over ${\mathbb Z}$ with…

In this article, we propose a variant of the usual Ostrowski $\alpha$-numeration (where $\alpha$ is a real in [0, 1[) that codes integers (positive as well as negative) and reals of [0, 1[ (instead of [--$\alpha$, 1--$\alpha$[), so that for…

A magic square of order $n$ with all subsquares of possible orders (ASMS$(n)$) is a magic square which contains a general magic square of each order $k\in\{3, 4, \cdots, n-2\}$. Since the conjecture on the existence of an ASMS was proposed…

Natural numbers from 0 to 11111 are written in terms of 1 to 9 in two different ways. The first one in increasing order of 1 to 9, and the second one in decreasing order. This is done by using the operations of addition, multiplication,…

The comma sequence (1, 12, 35, 94, ...) is the lexicographically earliest sequence such that the difference of consecutive terms equals the concatenation of the digits on either side of the comma separating them. The behavior of a…

A well-known theorem of Lagrange asserts that every nonnegative integer $n$ can be written in the form $a^2+b^2+c^2+d^2$, where $a,b,c,d \in \mathbb{Z}$. We characterize the values assumed by $a+b+c+d$ as we range over all such…

A look-and-say sequence is obtained iteratively by reading off the digits of the current value, grouping identical digits together: starting with 1, the sequence reads: 1, 11, 21, 1211, 111221, 312211, etc. (OEIS A005150). Starting with any…

In this paper, we define a variant of Fibonacci-like sequences that we call prime Fibonacci sequences, where one takes the sum of the previous two terms and returns the smallest odd prime divisor of that sum as the next term. We prove that…

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…

For any $m = 3 \left( 2n + 1 \right) with \ n \in \mathbb{N^*} ,$ the prime counting function $\pi(m) = 4 + \left \vert A_4(m) \right \vert + 2 \left \vert A_6(m) \right \vert $ where $A_6(m) $ and $ A_4(m) $ are the sets of Twin Primes and…

We investigate the following problem: given a sample of classified strings, find a first-order sentence of minimal quantifier rank that is consistent with the sample. We represent strings as successor string structures, that is, finite…

We continue work started in [1] concerning integer sequences q(n), n in N, defined by q(n) = q(n-q(n-1)) + f(n), with q(1) = 1. Here, f(n), with f(1) = 0, is a given sequence. We define F as the set of semi-infinite sequence f such that the…

A subset of an abelian group is {\em sequenceable} if there is an ordering $(x_1, \ldots, x_k)$ of its elements such that the partial sums $(y_0, y_1, \ldots, y_k)$, given by $y_0 = 0$ and $y_i = \sum_{j=1}^i x_i$ for $1 \leq i \leq k$, are…

Let $n,k\in\mathbb{N}$ and let $p_{n}$ denote the $n$th prime number. We define $p_{n}^{(k)}$ recursively as $p_{n}^{(1)}:=p_{n}$ and $p_{n}^{(k)}=p_{p_{n}^{(k-1)}}$, that is, $p_{n}^{(k)}$ is the $p_{n}^{(k-1)}$th prime. In this note we…

We count the number of subsets of $\{1,2,\cdots,n\}$ under different conditions and study the sequence obtained as we let $n$ increase.

Finding the $n$-th positive square number is easy, as it is simply $n^2$. But how do we find the complementary sequence, i.e., the $n$-th positive non-square number? For this case there is an explicit formula. However, for general…

The results for the fractional sequence $\left \{[x/n]+1:n \leq x\right \}$, and the fractional sequence in arithmetic progression $\left \{q[x/n]+a:n \leq x\right \}$, where $a<q$ are integers such that $\gcd(a,q)=1$, prove that these…

Let $(L_n)_{n \geq 1}$ be the sequence of Lucas numbers, defined recursively by $L_1 := 1$, $L_2 := 3$, and $L_{n + 2} := L_{n + 1} + L_n$, for every integer $n \geq 1$. We determine the asymptotic behavior of $\log \operatorname{lcm} (L_1…

Morphic sequences form a natural class of infinite sequences, typically defined as the coding of a fixed point of a morphism. Different morphisms and codings may yield the same morphic sequence. This paper investigates how to prove that two…