Abstract

Euler's famous formula written in symbolic notation as $(B_0+B_0)^n=-n B_{n-1}-(n-1)B_n$ was extended to $(B_{l_1}+\cdots+B_{l_m})^n$ for $m\ge 2$ and arbitrary fixed integers $l_1,\dots,l_m\ge 0$. In this paper, we consider the higher-order recurrences for Cauchy numbers $(c_{l_1}+\cdots+c_{l_m})^n$, where the $n$-th Cauchy number $c_n$ ($n\ge 0$) is defined by the generating function $x/\ln(1+x)=\sum_{n=0}^\infty c_n x^n/n!$. In special, we give an explicit expression in the case $l_1=\cdots=l_m=0$ for any integers $n\ge 1$ and $m\ge 2$. We also discuss the case for Cauchy numbers of the second kind $\widehat c_n$ in similar ways.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call