相关论文: Two notes on notation

The partition functions $P(n,m,p)$, the number of integer partitions of $n$ into exactly $m$ parts with each part at most $p$, and $Q(n,m,p)$, the number of integer partitons of $n$ into exactly $m$ distinct parts with each part at most…

The first author introduced a sequence of polynomials (\cite{8}, sequence A174531) defined recursively. One of the main results of this study is proof of the integrality of its coefficients.

Associated to each complex-valued random variable satisfying appropriate integrability conditions, we introduce a different generalization of the Stirling numbers of the second kind. Various equivalent definitions are provided. Attention,…

By means of the generating function method, a linear recurrence relation is explicitly resolved. The solution is expressed in terms of the Stirling numbers of both the first and the second kind. Two remarkable pairs of combinatorial…

For the Stirling numbers of the second kind $S(n,k)$ and the ordered Bell numbers $B(n)$, we prove the identity $\sum_{k=1}^{n/2} S(n,2k)(2k-1)! = B(n-1)$. An analogous identity holds for the sum over odd $k$'s.

Motivated by the study of integer partitions, we consider partitions of integers into fractions of a particular form, namely with constant denominators and distinct odd or even numerators. When numerators are odd, the numbers of partitions…

Let $S=\{p_1,\dots,p_s\}$ be a finite non-empty set of distinct prime numbers, let $f\in \mathbb{Z}[X]$ be a polynomial of degree $n\ge 1$, and let $S'\subseteq S$ be the subset of all $p\in S$ such that $f$ has a root in $\mathbb{Z}_p$.…

In the paper, the author finds an explicit formula for computing Bell numbers in terms of Kummer confluent hypergeometric functions and Stirling numbers of the second kind.

Let $m, n, k$ and $c$ be positive integers. Let $\nu_2(k)$ be the 2-adic valuation of $k$. By $S(n,k)$ we denote the Stirling numbers of the second kind. In this paper, we first establish a convolution identity of the Stirling numbers of…

A set S of integers is said to be multiplicative if for every pair m and n of coprime integers we have that mn is in S iff both m and n are in S. Both Landau and Ramanujan gave approximations to S(x), the number of n<=x that are in S, for…

We study divisibility properties of certain sums and alternating sums involving binomial coefficients and powers of integers. For example, we prove that for all positive integers $n_1,..., n_m$, $n_{m+1}=n_1$, and any nonnegative integer…

Let $A$ be a nonempty set of positive integers. The restricted partition function $p_A(n)$ denotes the number of partitions of $n$ with parts in $A$. When the elements in $A$ are pairwise relatively prime positive integers, Ehrhart,…

The aim of this article is to define some new families of the special numbers. These numbers provide some further motivation for computation of combinatorial sums involving binomial coefficients and the Euler kind numbers of negative order.…

The restricted partition function $p_N(n)$ counts the partitions of the integer $n$ into at most $N$ parts. In the nineteenth century Sylvester described these partitions as a sum of waves. We give detailed descriptions of these waves and,…

We establish a recursive relation for the bipartition number $p_2(n)$ which might be regarded as an analogue of Euler's recursive relation for the partition number $p(n)$. Two proofs of the main result are proved in this article. The first…

A new characterization of provably recursive functions of first-order arithmetic is described. Its main feature is using only terms consisting of 0, the successor S and variables in the quantifier rules, namely, universal elimination and…

We develop a new closed-form arithmetic and recursive formula for the partition function and a generalization of Andrews' smallest parts (spt) function. Using the inclusion-exclusion principle, we additionally develop a formula for the…

The Stirling numbers of the first kind can be represented in terms of a new class of polynomials that are closely related to the Bernoulli polynomials. Recursion relations for these polynomials are given.

Scale invariant scattering suggests that all Bernoulli numbers B_{2n} can be naturally partitioned, i.e., written as particular finite sums of same-signed, monotonic, rational numbers. Some properties of these rational numbers are discussed…

We consider sequences of polynomials that satisfy differential-difference recurrences. Polynomials satisfying such recurrences frequently appear as generating polynomials of integer valued random variables that are of interest in discrete…