English
Related papers

Related papers: The Hofstadter consecutive-sum sequence omits infi…

200 papers

In this work we investigate greedy energy sequences on the unit circle for the logarithmic and Riesz potentials. By definition, if $(a_n)_{n=0}^{\infty}$ is a greedy $s$-energy sequence on the unit circle, the Riesz potential…

Classical Analysis and ODEs · Mathematics 2023-08-30 Abey López-García , Ryan E. McCleary

Let $\beta=\frac{1+\sqrt{5}}{2}$, $(a_n)_{n \in \mathbb{N}^+}$ be a non-uniform morphic sequence involving the infinite Fibonacci word and $(\delta(n))_{n \in \mathbb{N}^+}$ be a positive sequence such that for all positive integers $n$,…

Number Theory · Mathematics 2021-06-15 Shuo Li

We present two short proofs giving the best known asymptotic lower bound for the maximum element in a set of $n$ positive integers with distinct subset sums.

Combinatorics · Mathematics 2020-07-21 Quentin Dubroff , Jacob Fox , Max Wenqiang Xu

In a recent advance towards the Prime $k$-tuple Conjecture, Maynard and Tao have shown that if $k$ is sufficiently large in terms of $m$, then for an admissible $k$-tuple $\mathcal{H}(x) = \{gx + h_j\}_{j=1}^k$ of linear forms in…

Number Theory · Mathematics 2014-10-21 William D. Banks , Tristan Freiberg , Caroline L. Turnage-Butterbaugh

Let $G$ be an additive finite abelian group of order $n$, and let $S$ be a sequence of $n+k$ elements in $G$, where $k\geq 1$. Suppose that $S$ contains $t$ distinct elements. Let $\sum_n(S)$ denote the set that consists of all elements in…

Number Theory · Mathematics 2013-08-13 Xingwu Xia , Weidong Gao

Motivated by the convolutive behavior of the counting function for partitions with designated summands in which all parts are odd, we consider coefficient sequences $(a_n)_{n\ge 0}$ of primitive eta-products that satisfy the generic…

Combinatorics · Mathematics 2025-12-05 Shane Chern , Dennis Eichhorn , Shishuo Fu , James A. Sellers

Robin's Inequality posits $G(n)<e^{\gamma}$ for $n>5040$. Robin also showed that if the Riemann Hypothesis (RH) is false, then $G(n)>e^{\gamma}\left(1+\displaystyle\frac{c}{(\log n)^{b}}\right)$ for infinitely many values of $n$. By…

Number Theory · Mathematics 2025-10-29 Bruce Zimov

Let $(F_n)_{n\geq 0}$ be the Fibonacci sequence given by $F_{n+2}=F_{n+1}+F_n$, for $n\geq 0$, where $F_0=0$ and $F_1=1$. There are several interesting identities involving this sequence such as $F_n^2+F_{n+1}^2=F_{2n+1}$, for all $n\geq…

Number Theory · Mathematics 2023-09-18 Ana Paula Chaves , Carlos Gustavo Moreira , Eduardo Henrique no Nascimento

Let $G$ be an additive finite abelian group and let $k\in [\exp(G),\mathsf{D}(G)-1]$ be a positive integer. Denote by $\mathsf{s}_{\leq k}(G)$ the smallest positive integer $l\in \mathbb{N}\cup \{+\infty\}$ such that each sequence of length…

Combinatorics · Mathematics 2025-06-27 Kevin Zhao

Zeckendorf's theorem states that every positive integer can be written uniquely as a sum of non-consecutive Fibonacci numbers ${F_n}$, with initial terms $F_1 = 1, F_2 = 2$. We consider the distribution of the number of summands involved in…

The EKG or electrocardiogram sequence is defined by a(1) = 1, a(2) = 2 and, for n >= 3, a(n) is the smallest natural number not already in the sequence with the property that gcd {a(n-1), a(n)} > 1. In spite of its erratic local behavior,…

Number Theory · Mathematics 2007-05-23 J. C. Lagarias , E. M. Rains , N. J. A. Sloane

Given a sequence $\mathscr{A}=\{a_0<a_1<a_2\ldots\}\subseteq \mathbb{N}$, let $r_{\mathscr{A},h}(n)$ denote the number of ways $n$ can be written as the sum of $h$ elements of $\mathscr{A}$. Fixing $h\geq 2$, we show that if $f$ is a…

Combinatorics · Mathematics 2024-12-18 Christian Táfula

We study the Lagarias inequality, an elementary criterion equivalent to the Riemann Hypothesis. Using a continuous extension of the harmonic numbers, we show that the sequence $B_n=\frac{H_n+e^{H_n}\log(H_n)}{n}$ is strictly increasing for…

Number Theory · Mathematics 2026-02-20 Andrew MacArevey

Let \tau(.) be the Ramanujan \tau-function, and let k be a positive integer such that \tau(n) is not 0 for n=1,...,[k/2]. (This is known to be true for k < 10^{23}, and, conjecturally, for all k.) Further, let s be a permutation of the set…

Number Theory · Mathematics 2019-02-20 Yuri Bilu , Jean-Marc Deshouillers , Sanoli Gun , Florian Luca

We prove that the sequence $(N_k)_k$, where each $N_k$ is defined as the smallest positive integer $n$ for which the $n$th term $g_{k,n}$ of the $k$-G\"obel sequence is not an integer, is unbounded.

Combinatorics · Mathematics 2025-02-26 Yuh Kobayashi , Shin-ichiro Seki

For the sequence defined by \[ a(n) = \frac{n^2 - n - 1}{\gcd\big(n^2 - n - 1,\, b(n-3) + n\,b(n-4)\big)} \] Where $b(n) = (n+2)\big(b(n-1) - b(n-2)\big),$ with initial conditions $b(-1) = 0$ and $b(0) = 1$, we find that $a(n)$ contains…

General Mathematics · Mathematics 2025-09-15 Mohammed Bouras

Let $A\subset [1,x]$ be a non-empty set of primes with $|A|= \alpha x(\log x)^{-1}$. We prove that there exist absolute constants $c_1,c_2>0$ such that, as $x$ gets sufficiently large, we have $|A+A|\geq c_1(\log x)(\log \log…

Number Theory · Mathematics 2025-04-16 Genheng Zhao

Using basic tools of mathematical analysis and elementary probability theory we address several problems on the irrationality of series of distinct unit fractions, $\sum_k 1/a_k$. In particular, we study subseries of the Lambert series…

Number Theory · Mathematics 2025-07-15 Vjekoslav Kovač , Terence Tao

We present and analyze an algorithm to enumerate all integers $n\le x$ that can be written as the sum of consecutive $k$th powers of primes, for $k>1$. We show that the number of such integers $n$ is asymptotically bounded by a constant…

Number Theory · Mathematics 2024-01-04 Cathal O'Sullivan , Jonathan P. Sorenson , Aryn Stahl

Let $\mathbf{S}$ be the set of all finite or infinite increasing sequences of positive integers. For a sequence $S=\{s(n)\}, n\geq1,$ from $\mathbf{S},$ let us call a positive number $N$ an exponentially $S$-number $(N\in E(S)),$ if all…

Number Theory · Mathematics 2016-01-21 Vladimir Shevelev