English
Related papers

Related papers: The EKG Sequence

200 papers

For $A\subseteq \mathbb Z_n$, the $A$-weighted Gao constant $E_A(n)$ is defined to be the smallest natural number $k$, such that any sequence of $k$ elements in $\mathbb Z_n$ has a subsequence of length $n$, whose $A$-weighted sum is zero.…

Number Theory · Mathematics 2022-04-18 Santanu Mondal , Krishnendu Paul , Shameek Paul

Define a sequence of positive integers by the rule that a(n) = n for 1 <= n <= 3, and for n >= 4, a(n) is the smallest number not already in the sequence which has a common factor with a(n-2) and is relatively prime to a(n-1). We show that…

For every integer $n\ge 1$ let $a_n$ be the smallest positive integer such that $n+a_n$ is prime. We investigate the behavior of the sequence $(a_n)_{n\ge 1}$, and prove asymptotic results for the sums $\sum_{n\le x} a_n$, $\sum_{n\le x}…

Number Theory · Mathematics 2015-05-25 Brăduţ Apostol , Laurenţiu Panaitopol , Lucian Petrescu , László Tóth

The Ulam sequence is defined as $a_1 =1, a_2 = 2$ and $a_n$ being the smallest integer that can be written as the sum of two distinct earlier elements in a unique way. This gives $$1, 2, 3, 4, 6, 8, 11, 13, 16, 18, 26, 28, 36, 38, 47,…

Combinatorics · Mathematics 2016-07-07 Stefan Steinerberger

Aronson's sequence 1, 4, 11, 16, ... is defined by the English sentence ``t is the first, fourth, eleventh, sixteenth, ... letter of this sentence.'' This paper introduces some numerical analogues, such as: a(n) is taken to be the smallest…

Number Theory · Mathematics 2014-09-17 Benoit Cloitre , N. J. A. Sloane , Matthew J. Vandermast

The Ulam sequence is given by $a_1 =1, a_2 = 2$, and then, for $n \geq 3$, the element $a_n$ is defined as the smallest integer that can be written as the sum of two distinct earlier elements in a unique way. This gives the sequence $1, 2,…

Combinatorics · Mathematics 2018-08-28 Noah Kravitz , Stefan Steinerberger

Let k be a positive integer. A sequence s over an n-element alphabet A is called a k-radius sequence if every two symbols from A occur in s at distance of at most k. Let f_k(n) denote the length of a shortest k-radius sequence over A. We…

Combinatorics · Mathematics 2011-05-19 Jerzy W. Jaromczyk , Zbigniew Lonc , Miroslaw Truszczynski

An electrocardiogram (EKG) is a common, non-invasive test that measures the electrical activity of a patient's heart. EKGs contain useful diagnostic information about patient health that may be absent from other electronic health record…

Machine Learning · Statistics 2018-12-04 Andrew C. Miller , Ziad Obermeyer , David M. Blei , John P. Cunningham , Sendhil Mullainathan

The constant $C_A(n)$ is defined to be the smallest natural number $k$ such that any sequence of $k$ elements in $\mathbb Z_n$ has a subsequence of consecutive terms whose $A$-weighted sum is zero, where the weight set $A\subseteq \mathbb…

Number Theory · Mathematics 2022-10-25 Santanu Mondal , Krishnendu Paul , Shameek Paul

A language is constructed of a finite/infinite set of sentences composing of words. Similar to natural languages, Electrocardiogram (ECG) signal, the most common noninvasive tool to study the functionality of the heart and diagnose several…

Signal Processing · Electrical Eng. & Systems 2020-06-17 Sajad Mousavi , Fatemeh Afghah , Fatemeh Khadem , U. Rajendra Acharya

Golomb's sequence is the unique nondecreasing sequence of positive integers in which each $n$ appears exactly $a(n)$ times. It satisfies the global self-referential rule \[ a\bigl(a(n)+a(n-1)+\cdots+a(1)\bigr)=n, \] grows smoothly like a…

Number Theory · Mathematics 2026-04-06 Benoit Cloitre

For a given real number $a$ we define the sequence $\{E_{n,a}\}$ by $E_{0,a}=1$ and $E_{n,a}=-a\sum_{k=1}^{[n/2]} \binom n{2k}E_{n-2k,a}$ $(n\ge 1)$, where $[x]$ is the greatest integer not exceeding $x$. Since $E_{n,1}=E_n$ is the n-th…

Number Theory · Mathematics 2013-07-30 Zhi-Hong Sun , Hai-Yan Wang

For the sequence defined by a(n) = a(n-1) + gcd(n, a(n-1)) with a(1) = 7 we prove that a(n) - a(n-1) takes on only 1s and primes, making this recurrence a rare "naturally occurring" generator of primes. Toward a generalization of this…

Number Theory · Mathematics 2008-07-23 Eric S. Rowland

Let $\text{ac}(n,k)$ denote the smallest positive integer with the property that there exists an $n$-colouring $f$ of $\{1,\dots,\text{ac}(n,k)\}$ such that for every $k$-subset $R \subseteq \{1, \dots, n\}$ there exists an (arithmetic)…

Combinatorics · Mathematics 2018-02-12 Leonardo Alese , Stefan Lendl , Paul Tabatabai

For $A\subseteq\mathbb Z_n$, the $A$-weighted Gao constant $E_A(n)$ is defined to be the smallest natural number $k$ such that any sequence of $k$ elements in $\mathbb Z_n$ has a subsequence of length $n$ whose $A$-weighted sum is zero.…

Number Theory · Mathematics 2023-02-21 Santanu Mondal , Krishnendu Paul , Shameek Paul

For a finite abelian group $(G,+)$, the constant $C(G)$ is defined to be the smallest natural number $k$ such that any sequence in $G$ having length $k$ will have a subsequence of consecutive terms whose sum is zero. For a subset…

Number Theory · Mathematics 2023-02-07 Santanu Mondal , Krishnendu Paul , Shameek Paul

For any natural number $n\in\mathbb{N}$, $ \frac{1}{2n+\frac1{1-\gamma}-2}\le \sum_{i=1}^n\frac1i-\ln n-\gamma<\frac{1}{2n+\frac13}, $ where $\gamma=0.57721566490153286...m$ denotes Euler's constant. The constants $\frac{1}{1-\gamma}-2$ and…

Classical Analysis and ODEs · Mathematics 2012-08-21 Chao-Ping Chen , Feng Qi

Let $G=(\mathbb Z/n\mathbb Z) \oplus (\mathbb Z/n\mathbb Z)$. Let $\mathsf {s}_{\leq k}(G)$ be the smallest integer $\ell$ such that every sequence of $\ell$ terms from $G$, with repetition allowed, has a nonempty zero-sum subsequence with…

Number Theory · Mathematics 2022-11-17 John Ebert , David J. Grynkiewicz

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…

Number Theory · Mathematics 2021-08-10 Carlo Sanna

We introduce the sequence $(a_n) \subset (0,1]$ and prove that the asymptotic behaviour of $\sum_{k=1}^n a_k$ is the same than $\pi(n)$, the prime-counting function. We also obtain that $\pi(n) \sim n a_n$ and we estimate…

Number Theory · Mathematics 2017-03-23 Alejandro Miralles , Damià Torres
‹ Prev 1 2 3 10 Next ›