English
Related papers

Related papers: Counting nondecreasing integer sequences that lie …

200 papers

We consider the family B-tilde of bounded nonvanishing analytic functions f(z) = a_0 + a_1 z + a_2 z^2 + ... in the unit disk. The coefficient problem had been extensively investigated, and it is known that |a_n| <= 2/e for n=1,2,3, and 4.…

Classical Analysis and ODEs · Mathematics 2016-09-06 Wolfram Koepf , Dieter Schmersau

Five simple guidelines are proposed to compute the generating function for the nonnegative integer solutions of a system of linear inequalities. In contrast to other approaches, the emphasis is on deriving recurrences. We show how to use…

Combinatorics · Mathematics 2007-05-23 Sylvie Corteel , Sunyoung Lee , Carla Savage

A linear combination $aT_r(m)+bT_s(n)$ of an \mbox{$r$-gonal} number $T_r(m)$ and an $s$-gonal number $T_s(n)$ with mutually coprime positive integer coefficients $a$ and $b$ produces infinitely many primes as $m$ and~$n$ varies over the…

Number Theory · Mathematics 2025-08-12 Soumya Bhattacharya , Habibur Rahaman

We consider a joint ordered multifactorisation for a given positive integer $n\geq 2$ into $m$ parts, where $n=n_1~\times~\ldots~\times~n_m$, and each part $n_j$ is split into one or more component factors. Our central result gives an…

Number Theory · Mathematics 2025-08-20 Ambrose D. Law , Matthew C. Lettington , Karl Michael Schmidt

For a positive integer n, let f(n) denote the smallest non-negative integer b such that for each system S \subseteq {x_k=1,x_i+x_j=x_k,x_i*x_j=x_k: i,j,k \in {1,...,n}} with a solution in non-negative integers x_1,...,x_n, there exists a…

Computational Complexity · Computer Science 2014-10-09 Apoloniusz Tyszka

We study compositions of a positive integer $n$ in which the occurrence of even parts larger than a fixed threshold $k$ is controlled. More precisely, for each composition $m=(m_1,\dots,m_r)$ we consider the number of even parts strictly…

Combinatorics · Mathematics 2026-02-25 Mahdi Koutchoukali

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

A Filbert matrix is a matrix whose (i,j) entry is 1/F_(i+j-1), where F_n is the nth Fibonacci number. The inverse of the n by n Filbert matrix resembles the inverse of the n by n Hilbert matrix, and we prove that it shares the property of…

Rings and Algebras · Mathematics 2007-05-23 Thomas M. Richardson

Let $f$ be a half-integral weight cusp form of level $4N$ for odd and squarefree $N$ and let $a(n)$ denote its $n^{\rm th}$ normalized Fourier coefficient. Assuming that all the coefficients $a(n)$ are real, we study the sign of $a(n)$ when…

Number Theory · Mathematics 2020-07-14 Corentin Darreye

Given an increasing process $(A_t)_{t\geq 0}$, we characterize the right-continuous non-decreasing functions $f: \R_+\to \R_+$ that map $A$ to a pure-jump process. As an example of application, we show for instance that functions with…

Probability · Mathematics 2013-03-27 Jean Bertoin , Marc Yor

Let $ (P_n)_{n\ge 0}$ be the sequence of Perrin numbers defined by ternary relation $ P_0=3 $, $ P_1=0 $, $ P_2=2 $, and $ P_{n+3}=P_{n+1}+P_n $ for all $ n\ge 0 $. In this paper, we use Baker's theory for nonzero linear forms in logarithms…

Number Theory · Mathematics 2021-05-19 Herbert Batte , Taboka P. Chalebgwa , Mahadi Ddamulira

Let ${\pmb b}=\{b_0,\,b_1,\,\ldots\}$ be the known sequence of numbers such that $b_0\neq0$. In this work, we develop methods to find another sequence ${\pmb a}=\{a_0,\,a_1,\,\ldots\}$ that is related to ${\pmb b}$ as follows:…

Number Theory · Mathematics 2025-08-01 Ignas Gasparavičius , Andrius Grigutis , Juozas Petkelis

We introduce and study the recursive divisor function, a recursive analog of the usual divisor function: $\kappa_x(n) = n^x + \sum_{d\lfloor n} \kappa_x(d)$, where the sum is over the proper divisors of $n$. We give a geometrical…

Number Theory · Mathematics 2023-08-08 Thomas Fink

Let $\{u_{n}\}_{n \geq 0}$ be a non-degenerate binary recurrence sequence with positive discriminant. In this paper, we consider the Diophantine equation $u_m + u_n = a_1 n_1! + \cdots + a_k n_k!$ and prove that there are only finitely many…

Number Theory · Mathematics 2017-07-04 Sudhansu Sekhar Rout

Let $n$ be a positive integer and let $A$ be nonempty finite set of positive integers. We say that $A$ is relatively prime if $\gcd(A) =1$ and that $A$ is relatively prime to $n$ if $\gcd(A,n)=1$. In this work we count the number of…

Number Theory · Mathematics 2010-02-18 Mohamed El Bachraoui

Let f(n)=1 if n=1, 2^(2^(n-2)) if n \in {2,3,4,5}, (2+2^(2^(n-4)))^(2^(n-4)) if n \in {6,7,8,...}. We conjecture that if a system T \subseteq {x_i+1=x_k, x_i \cdot x_j=x_k: i,j,k \in {1,...,n}} has only finitely many solutions in positive…

Number Theory · Mathematics 2015-10-14 Apoloniusz Tyszka

Infinite exponential sequences of distinct prime numbers of the form $\lfloor a c^{n^d}+b\rfloor$, $n\geq 0$, are proved to exist for well chosen real constants $a>0$, $b$, $c>1$, $d>1$, assuming Cramer's conjecture on prime gaps. There is…

Number Theory · Mathematics 2020-12-08 Bernard Montaron

Let $s_1, s_2, \ldots$ be the sequence of positive integers, arranged in increasing order, that are representable by any binary quadratic form of fixed discriminant $D$. We show that \[ \limsup_{n \rightarrow \infty} \frac{s_{n+1}-s_n}{\log…

Number Theory · Mathematics 2022-05-02 Rainer Dietmann , Christian Elsholtz

We show that the de Bruijn-Erd\H{o}s condition for the error term in their improvement of Fekete's Lemma is not only sufficient but also necessary in the following strong sense. Suppose that given a sequence $0\leq f(1)\leq f(2)\leq…

Combinatorics · Mathematics 2018-10-30 Zoltan Furedi , Imre Z. Ruzsa

Jacobi said "man muss immer umkehren". And indeed it takes a genius like Michael Somos to take a specific non-linear recurrence, like a(n)=(a(n-1)a(n-3)+a(n-2)^2)/a(n-4), subject to a(1)=1, a(2)=1, a(3)=1, a(4)=1, and observe that surprise,…

Combinatorics · Mathematics 2013-03-22 Shalosh B. Ekhad , Doron Zeilberger