Arithmetic properties of generalized Euler numbers
Combinatorics
2007-05-23 v1
Abstract
The generalized Euler number E_{n|k} counts the number of permutations of {1,2,...,n} which have a descent in position m if and only if m is divisible by k. The classical Euler numbers are the special case when k=2. In this paper, we study divisibility properties of a q-analog of E_{n|k}. In particular, we generalize two theorems of Andrews and Gessel about factors of the q-tangent numbers.
Cite
@article{arxiv.math/9801010,
title = {Arithmetic properties of generalized Euler numbers},
author = {Bruce E. Sagan and Ping Zhang},
journal= {arXiv preprint arXiv:math/9801010},
year = {2007}
}
Comments
9 pages, 0 figures, Latex, see related papers at http://www.math.msu.edu/~sagan