A method for determining the mod-\(2^k\) behaviour of recursive sequences, with applications to subgroup counting
From MaRDI portal
Publication:456187
zbMath1260.05008arXiv1107.2015MaRDI QIDQ456187
Manuel Kauers, Christian Krattenthaler, Thomas W. Müller
Publication date: 23 October 2012
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1107.2015
Exact enumeration problems, generating functions (05A15) Subgroup theorems; subgroup growth (20E07) Recurrences (11B37) Congruences; primitive roots; residue systems (11A07)
Related Items (9)
On the period mod $m$ of polynomially-recursive sequences: a case study ⋮ Motzkin numbers and related sequences modulo powers of 2 ⋮ Free subgroup numbers modulo prime powers: the non-periodic case ⋮ A Riccati differential equation and free subgroup numbers for lifts of \(\mathrm{PSL}_2(\mathbb Z)\) modulo prime powers ⋮ Generalised Apéry numbers modulo 9 ⋮ A Stern-type congruence for the Schröder numbers ⋮ A classification of Motzkin numbers modulo 8 ⋮ Periodicity of free subgroup numbers modulo prime powers ⋮ Automatic congruences for diagonals of rational functions
This page was built for publication: A method for determining the mod-\(2^k\) behaviour of recursive sequences, with applications to subgroup counting
