English
Related papers

Related papers: Picturesque convolution-like recurrences and parti…

200 papers

Given an increasing sequence of integers a(n), it is known (due to Weyl) that for almost all reals t, the fractional parts of the dilated sequence t*a(n) are uniformly distributed in the unit interval. Some effort has been made recently to…

Number Theory · Mathematics 2007-05-23 Zeev Rudnick , Alexandru Zaharescu

We study the properties of the sequence of words $(B_i)$, where $B_1 = 101$ and $B_{i+1} = B_i C_i$ for $i \geq 1$, where $C_i$ is $B_i$ with the first $i$ symbols removed, and the infinite binary sequence ${\bf b} = 10101101011011101…

Combinatorics · Mathematics 2026-05-11 Jeffrey Shallit

We give a combinatorial proof of a formula giving the partial sums of the $k$-bonacci sequence as alternating sums of powers of two multiplied by binomial coefficients. As a corollary we obtain a formula for the $k$-bonacci numbers.

Combinatorics · Mathematics 2022-08-03 Harold R. Parks , Dean C. Wills

In this paper we define a new type of continued fraction expansion for a real number $x \in I_m:=[0,m-1], m\in N_+, m\geq 2$: \[x = \frac{m^{-b_1(x)}}{\displaystyle 1+\frac{m^{-b_2(x)}}{1+\ddots}}:=[b_1(x), b_2(x), ...]_m. \] Then, we…

Number Theory · Mathematics 2010-10-22 Dan Lascu , Ion Coltescu

In recent work, M. Schneider and the first author studied a curious class of integer partitions called "sequentially congruent" partitions: the $m$th part is congruent to the $(m+1)$th part modulo $m$, with the smallest part congruent to…

Number Theory · Mathematics 2024-05-31 Robert Schneider , James A. Sellers , Ian Wagner

We continue our investigation of the distribution of the fractional parts of $a \gamma$, where $a$ is a fixed non-zero real number and $\gamma$ runs over the imaginary parts of the non-trivial zeros of the Riemann zeta function. We…

Number Theory · Mathematics 2009-07-27 Kevin Ford , K. Soundararajan , Alexandru Zaharescu

We study the problem of generating interesting integer sequences with a combinatorial interpretation. For this we introduce a two-step approach. In the first step, we generate first-order logic sentences which define some combinatorial…

Logic in Computer Science · Computer Science 2023-02-10 Martin Svatoš , Peter Jung , Jan Tóth , Yuyi Wang , Ondřej Kuželka

Let $w$ be a finite word over the alphabet $\{0,1\}$. For any natural number $n$, let $s_w(n)$ denote the number of occurrence of $w$ in the binary expansion of $n$ as a scattered subsequence. We study the behavior of the partial sum…

Number Theory · Mathematics 2024-11-18 Pranjal Jain , Shuo Li

Denote by p_k the k-th power sum symmetric polynomial n variables. The interpretation of the q-analogue of the binomial coefficient as Hilbert function leads us to discover that n consecutive power sums in n variables form a regular…

Commutative Algebra · Mathematics 2018-08-30 Aldo Conca , Christian Krattenthaler , Junzo Watanabe

We study a certain class of arithmetic functions that appeared in Klurman's classification of $\pm 1$ multiplicative functions with bounded partial sums, c.f., Comp. Math. 153 (8), 2017, pp. 1622-1657. These functions are periodic and…

Number Theory · Mathematics 2026-01-14 Marco Aymone , Gopal Maiti , Olivier Ramaré , Priyamvad Srivastav

Sequence of positive integers $\{x_n\}_{n\geq1}$ is called similar to $\mathbb {N}$ respectively a given property $A$ if for every $n\geq1$ the numbers $x_n$ and $n$ are in the same class of equivalence respectively $A\enskip(x_n\sim n…

Number Theory · Mathematics 2009-04-20 Vladimir Shevelev

Number sequences defined by a linear recursion relation are studied by means of generating functions. Indices of the terms in the recursion relation have arbitrary differenses. In addition to formulas for the nth term an algorithm is…

Number Theory · Mathematics 2016-04-04 Bengt Månsson

Given a sequence of frequencies $\{\lambda_n\}_{n\geq1}$, a corresponding generalized Dirichlet series is of the form $f(s)=\sum_{n\geq 1}a_ne^{-\lambda_ns}$. We are interested in multiplicatively generated systems, where each number…

Number Theory · Mathematics 2024-05-08 Frederik Broucke , Athanasios Kouroupis , Karl-Mikael Perfekt

We study the properties of a sequence cn defined by the recursive relation \[\frac{c_0}{n + 1}+\frac{c_1}{n + 2}+\ldots+\frac{c_n}{2n + 1}=0\] for $n>1$ and $c_0=1$. This sequence also has an alternative definition in terms of certain norm…

Number Theory · Mathematics 2019-01-15 Alexander Kalmynin , Petr Kosenko

We present a certain generalization of a recent result of M. I. Cirnu on linear recurrence relations with coefficient in progressions [2]. We provide some interesting examples related to some well-known integer sequences, such as Fibonacci…

Number Theory · Mathematics 2015-03-19 Jerico B. Bacani , Julius Fergy T. Rabago

We extend previous work on anti-recurrence sequences of Kimberling and Moses, Zaslavsky, and Bosma et al. Kimberling and Moses have formulated several questions on these sequences, which can be combined into the meta-conjecture that…

Number Theory · Mathematics 2025-06-17 Robbert Fokkink , Gandhar Joshi

In this work we show that based on a conjecture for the pair correlation of integers representable as sums of two squares, which was first suggested by Connors and Keating and reformulated here, the second moment of the distribution of the…

Number Theory · Mathematics 2013-06-20 Yotam Smilansky

We continue the study of the $(a,b,m)$-copartition function $\mathrm{cp}_{a,b,m}(n)$, which arose as a combinatorial generalization of Andrews' partitions with even parts below odd parts. The generating function of $\mathrm{cp}_{a,b,m}(n)$…

Number Theory · Mathematics 2022-01-13 Hannah E. Burson , Dennis Eichhorn

A new explicit closed-form formula for the multivariate $(n, k)$th partial Bell polynomial $B_{n,k} (x_1, x_2, ..., x_{n - k + 1})$ is deduced. The formula involves multiple summations and makes it possible, for the first time, to easily…

Classical Analysis and ODEs · Mathematics 2013-01-17 Djurdje Cvijovic

For every positive integer $n$ and every $\delta \in [0,1]$, let $B(n, \delta)$ denote the probabilistic model in which a random set $A \subseteq \{1, \dots, n\}$ is constructed by choosing independently every element of $\{1, \dots, n\}$…

Number Theory · Mathematics 2020-12-15 Carlo Sanna