Abstract
AbstractLet $\{U_n\}$ be given by $U_0=1$ and $U_n=-2\sum _{k=1}^{[n/2]} \binom n{2k}U_{n-2k}\ (n\ge 1)$, where $[\cdot ]$ is the greatest integer function. Then $\{U_n\}$ is analogous to the Euler numbers and $U_{2n}=3^{2n}E_{2n}(\frac 13)$, where $E_m(x)$ is the Euler polynomial. In a previous paper we gave many properties of $\{U_n\}$. In this paper we present a summation formula and several congruences involving $\{U_n\}$.
Publisher
Cambridge University Press (CUP)
Reference8 articles.
1. Congruences for sequences similar to Euler numbers
2. S. Mattarei & R. Tauraso , ‘Congruences for central binomial sums and finite polylogarithms’, J. Number Theory, to appear.
3. Congruences for Euler numbers;Chen;Fibonacci Quart.,2004
4. EULER NUMBERS MODULO 2n
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献