Related papers: Asymptotics of the Euler transform of Fibonacci nu…
The exponential generating function for the sequence A143405 in the OEIS is exp(exp(x)*(exp(x) - 1)). This paper analyzes the more general generating function exp(m*exp(b*x) + r*exp(d*x) + s) and provides asymptotics for the sequences…
A theorem of Meinardus provides asymptotics of the number of weighted partitions under certain assumptions on associated ordinary and Dirichlet generating functions. The ordinary generating functions are closely related to Euler's…
It is shown that the sequence of rational numbers $r(k)$ generated by the ordinary generating function $\prod_{k=1}^\infty (1+x^k/k)$ converges to a limit $C > 0$. $C$ can be expressed as $C = \exp\Bigl(-\sum_{k = 2}^\infty…
We prove asymptotic formulas for Toeplitz determinants generated by functions with sequences of Fourier coefficients belonging to weighted Orlicz sequence classes. We concentrate our attention on the case of nonvanishing generating…
$a_n=[x^n](1-x)^{-n}(1-x^2)^{-n}$ is the sequence A348410 in the Encyclopedia of Integer Sequences. Using a method from Hautus and Klarner from 1971 and the software \textsf{Gfun} we find an algebraic equation for the generating function…
We find the exponential generating function for permutations with all valleys even and all peaks odd, and use it to determine the asymptotics for its coefficients, answering a question posed by Liviu Nicolaescu. The generating function can…
We establish an integral representation for the Dirichlet generating function of the coefficients of Euler's pentagonal number theorem. The Bromwich-type integral enables analytic continuation to the entire complex plane, filling a gap in…
We consider the asymptotics of sums of the form $$ \frac1{F_n^\sigma} \sum_{m = 1}^{F_n-1} \frac{f(m/F_n)}{\left|{\sin(\pi m/F_n)}\right|^\sigma} \frac{f(F_{n-1}m/F_n)}{\left|{\sin(\pi F_{n-1}m/F_n)}\right|^\sigma} $$ where $(F_n)_{n \in…
We study \emph{unimodular fake} $\mu's$, i.e. multiplicative functions $\mathfrak f: \N \to \mathbb{S}^1 \cup \{0\} $ determined by a fixed sequence $\{\varepsilon_k\}_{k\ge 0} \subset \mathbb{S}^1 \, \cup \, \{0\}$ via the rule $\mathfrak…
We study the asymptotics for the Fourier coefficients of a broad class of eta-quotients, $$\prod_{r=1}^R \left(\prod_{k\ge 1}\left(1-q^{m_r k}\right)\right)^{\delta_r},$$ where $m_1,\ldots,m_R$ are $R$ distinct positive integers and…
Motivated by studies in accelerator physics this paper computes the asymptotic behavior of the series $\displaystyle \sum_{k=1}^N \varphi(k) I_N\left(\frac{1}{k}\right)$, where $\varphi(k)$ is Euler's Totient function and $\displaystyle…
We prove an exact formula for OEIS A000119, which counts partitions into distinct Fibonacci numbers. We also establish an exact formula for its mean value, and determine the asymptotic behaviour.
We examine the exponential generating function for the number of symmetric involutions (A000898 in OEIS) and point out that Robinson's asymptotic formula for its coefficients is incorrect. We further supply the correct formula.
We define a new class of generating function transformations related to polylogarithm functions, Dirichlet series, and Euler sums. These transformations are given by an infinite sum over the $j^{th}$ derivatives of a sequence generating…
This paper analyzes over 30 types of q-series and the asymptotic behavior of their expansions. A method is described for deriving further asymptotic formulas using convolutions of generating functions with subexponential growth. All…
This is a translation of Euler's 1773 "Variae observationes circa angulos in progressione geometrica progredientes", E561 in the Enestr{\"o}m index. I translated this paper as a result of my study of Euler's work on the infinite product…
We construct a $k$-fold $q$-series as a generating function of $k$-regular partitions for each positive integer $k$. The $k=1$ case is one of Euler's $q$-series identities pertaining to the partitions into distinct parts. The construction…
We make an asymptotic analysis via singularity analysis of generating functions of a number sequence that involves the Fibonacci numbers and generalizes the binomial coefficients.
In the paper, 2 explicit formulas for the Euler numbers of the second kind are obtained. Based on those formulas a exponential generating function is deduced. Using the generating function some well-known and new identities for the Euler…
Fibonacci polynomials are generalizations of Fibonacci numbers, so it is natural to consider polynomial versions of the various results for Fibonacci numbers. According to Hong, Pongsriiam, Bulawa, and Lee, the generating function of the…