Reciprocal function series coefficients with integer partitions
From MaRDI portal
Abstract: In this article we obtain an explicit formula in terms of the partitions of the positive integer to express the -th term of a wide class of sequences of numbers defined by recursion. Our proof is based only on arithmetics. We compare our result with similar formulas obtained with different approaches already in the XIX century. Examples are given for Bernoulli, Euler and Fibonacci numbers.
Recommendations
Cites work
- scientific article; zbMATH DE number 3443655 (Why is no real title available?)
- Analytic combinatorics
- Analytic variations on redundancy rates of renewal processes
- Applications of the cosecant and related numbers
- Explicit formulas for Bernoulli and Euler numbers
- Faà di Bruno's formula, lattices, and partitions
- Generatingfunctionology
- The Curious History of Faa di Bruno's Formula
- The partition method for a power series expansion. Theory and applications
Cited in
(7)- Reciprocals of thinned exponential series
- On the power-series expansion of a rational function
- Properties and applications of the reciprocal logarithm numbers
- Generalizing the reciprocal logarithm numbers by adapting the partition method for a power series expansion
- The partition method for a power series expansion. Theory and applications
- Reciprocal of infinite series and partition functions
- Explicit formula for reciprocal generating function and its application
This page was built for publication: Reciprocal function series coefficients with integer partitions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1744171)