×

Congruences for the q-secant numbers. (English) Zbl 0455.10006


MSC:

11B39 Fibonacci and Lucas numbers and polynomials and generalizations
11A07 Congruences; primitive roots; residue systems
05A15 Exact enumeration problems, generating functions
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] André, D., Sur les permutations alternées, J. Math. Pures Appl., 7, 167-184 (1881) · JFM 13.0152.02
[2] Andrews, G. E., The theory of partitions, Encyclopedia of Mathematics and its Applications, Vol. 2 (1976), Addison-Wesley: Addison-Wesley Reading, Mass. · Zbl 0371.10001
[3] Andrews, G. E.; Gessel, I., Divisibility properties of the \(q\)-tangent numbers, Proc. Amer. Math. Soc., 68, 380-384 (1978) · Zbl 0401.10020
[4] Gessel, I., Generating functions and enumeration of sequences, Ph.D. Thesis (1977), Massachusetts Institute of Technology
[5] Jackson, F. H., A basic-sine and cosine with symbolical solutions of certain differential equations, Proc. Edinburgh Math. Soc., 22, 28-39 (1904) · JFM 35.0445.01
[6] Nielsen, N., Traité Élémentaire des Nombres de Bernoulli (1923), Gauthier-Villars: Gauthier-Villars Paris · JFM 50.0170.04
[7] D. Rawlings, Generalized Worpitzky identities, with applications to permutation enumeration, European J. Combin., to appear.; D. Rawlings, Generalized Worpitzky identities, with applications to permutation enumeration, European J. Combin., to appear. · Zbl 0471.05006
[8] Schützenberger, M. P., Oral communication (1975), Combinatorics Conference: Combinatorics Conference Oberwolfach
[9] Stanley, R. P., Binomial posets, Möbius inversion and permutation enumeration, J. Combin. Theory Ser. A, 20, 336-356 (1976) · Zbl 0331.05004
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.