相关论文: On the average of triangular numbers

We prove recursive formulas for sums of squares and sums of triangular numbers in terms of sums of divisors functions and we give a variety of consequences of these formulas. Intermediate applications include statements about positivity of…

Any two triangulations of a closed surface with the same number of vertices can be transformed into each other by a sequence of regular flips, provided the number of vertices exceeds a number N depending on the surface. Examples show that…

Quadratic irrationals posses a periodic continued fraction expansion. Much less is known about cubic irrationals. We do not even know if the partial quotients are bounded, even though extensive computations suggest they might follow…

A generalization of the well--known Fibonacci sequence is the $k$--Fibonacci sequence with some fixed integer $k\ge 2$. The first $k$ terms of this sequence are $0,\ldots,0,1$, and each term afterwards is the sum of the preceding $k$ terms.…

We explain the triangular gaps observed experimentally in the most popular sizes of the $h$-fold iterated sumset, $hA,$ when $A$ is a randomly chosen four-element subset of the first $q$ natural numbers, for $q$ much larger than $h.$

A sequence $(s_n)$ of integers is good for the mean ergodic theorem if for each invertible measure preserving system $(X,\mathcal{B},\mu,T)$ and any bounded measurable function $f$, the averages $ \frac1N \sum_{n=1}^N f(T^{s_n}x)$ converge…

Classifications of twin primes are established and then applied to triplets that generalize to all higher multiplets. Mersenne and Fermat twins and triplets are treated in this framework. Regular prime number multiplets are related to…

We provide a remarkably simple algorithm to compute all (at most four) common tangents of two disjoint simple polygons. Given each polygon as a read-only array of its corners in cyclic order, the algorithm runs in linear time and constant…

We study the total number of occurrences of several vincular (also called generalized) patterns and other statistics, such as the major index and the Denert statistic, on permutations avoiding a pattern of length 3, extending results of…

Given a barrier $0 \leq b_0 \leq b_1 \leq ...$, let $f(n)$ be the number of nondecreasing integer sequences $0 \leq a_0 \leq a_1 \leq ... \leq a_n$ for which $a_j \leq b_j$ for all $0 \leq j \leq n$. Known formul\ae for $f(n)$ include an $n…

For integers $b$ and $c$ the generalized central trinomial coefficient $T_n(b,c)$ denotes the coefficient of $x^n$ in the expansion of $(x^2+bx+c)^n$. Those $T_n=T_n(1,1)\ (n=0,1,2,\ldots)$ are the usual central trinomial coefficients, and…

We introduce the $2$-regular integer sequence A383066 $= (s(n))_{n \geq 1}$, which begins $0, 1, 1, 2, 3, 3, 2, \ldots$. We prove that the number of occurrences of an integer $m \geq 0$ in this sequence is equal to $\tau(m^2+1)$, the number…

The Eulerian triangle is a classical array of combinatorial numbers defined by a linear recursion. The associated boundary problem asks one to find all extreme nonnegative solutions to a dual recursion. Exploiting connections with random…

We establish a central limit theorem for counting large continued fraction digits $(a_n)$, i.e. we count occurrences $\{a_n>b_n\}$, where $(b_n)$ is a sequence of positive integers. Our result improves a similar result by Philipp which…

We show upper and lower bounds for angles in iterations of trisections of certain triangulations.

We show that the number of monotone triangles with prescribed bottom row (k_1,...,k_n) is given by a simple product formula which remarkably involves (shift) operators. Monotone triangles with bottom row (1,2,...,n) are in bijection with $n…

We offer a reader-friendly introduction to the attracting edge problem (also known as the "triangle conjecture") and its most general current solution of Limic and Tarr\`es (2007). Little original research is reported; rather this article…

Let us call a sequence of numbers heapable if they can be sequentially inserted to form a binary tree with the heap property, where each insertion subsequent to the first occurs at a leaf of the tree, i.e. below a previously placed number.…

Our original results refer to multivariate recurrences: discrete multitime diagonal recurrence, bivariate recurrence, trivariate recurrence, solutions tailored to particular situations, second order multivariate recurrences, characteristic…

Let $r(n,k)$ (resp. $s(n,k)$) be the number of Schr\"oder paths (resp. little Schr\"oder paths) of length $2n$ with $k$ hills, and set $r(0,0)=s(0,0)=1$. We bijectively establish the following recurrence relations: \begin{align*}…