On the density of languages representing finite set partitions.
Let b ≥ 2 be a fixed positive integer. We show for a wide variety of sequences {a n}n=1∞ that for almost all n the sum of digits of a n in base b is at least c b log n, where c b is a constant depending on b and on the sequence. Our approach covers several integer sequences arising from number theory and combinatorics.
By using polylogarithm series, we define “poly-Bernoulli numbers” which generalize classical Bernoulli numbers. We derive an explicit formula and a duality theorem for these numbers, together with a von Staudt-type theorem for di-Bernoulli numbers and another proof of a theorem of Vandiver.
Chou, Hsu and Shiue gave some applications of Faà di Bruno's formula to characterize inverse relations. Our aim is to develop some inverse relations connected to the multipartitional type polynomials involving to binomial type sequences.