Hostname: page-component-76fb5796d-x4r87 Total loading time: 0 Render date: 2024-04-26T01:00:34.627Z Has data issue: false hasContentIssue false
  • English
  • Français

SOME PROPERTIES OF A SEQUENCE ANALOGOUS TO EULER NUMBERS

Part of: Elementary number theory

Published online by Cambridge University Press:  12 June 2012

ZHI-HONG SUN
ZHI-HONG SUN*
Affiliation:
School of Mathematical Sciences, Huaiyin Normal University, Huaian, Jiangsu 223001, PR China (email: zhihongsun@yahoo.com)
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

Let $\{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\}$.

Keywords

congruencesummation formulaEuler number

MSC classification

Secondary: 11A07: Congruences; primitive roots; residue systems
Type
Research Article
Information
Bulletin of the Australian Mathematical Society , Volume 87 , Issue 3 , June 2013 , pp. 425 - 440
Copyright
Copyright © 2012 Australian Mathematical Publishing Association Inc. 

References

[1]Bateman, H., Higher Transcendental Functions, Vol. I (McGraw-Hill, New York, 1953).Google Scholar
[2]Chen, K. W., ‘Congruences for Euler numbers’, Fibonacci Quart. 42 (2004), 128–140.Google Scholar
[3]Cosgrave, J. B. & Dilcher, K., ‘Mod $p^3$ analogues of theorems of Gauss and Jacobi on binomial coefficients’, Acta Arith. 142 (2010), 103–118.CrossRefGoogle Scholar
[4]Mattarei, S. & Tauraso, R., ‘Congruences for central binomial sums and finite polylogarithms’, J. Number Theory, to appear.Google Scholar
[5]Sun, Z. H., ‘Congruences involving Bernoulli polynomials’, Discrete Math. 308 (2008), 71–112.CrossRefGoogle Scholar
[6]Sun, Z. H., ‘Euler numbers modulo $2^n$’, Bull. Aust. Math. Soc. 82 (2010), 221–231.CrossRefGoogle Scholar
[7]Sun, Z. H., ‘Congruences for sequences similar to Euler numbers’, J. Number Theory 132 (2012), 675–700.CrossRefGoogle Scholar
[8]Sun, Z. H., ‘Identities and congruences for a new sequence’, Int. J. Number Theory 8 (2012), 207–225.CrossRefGoogle Scholar