Prime-shift extensions of Kaplansky–Riordan's ménage identities: Mathar's recurrence and van Hoeij's congruences

Extending Kaplansky and Riordan's ménage identities (1946, pp. 121–122, equations (25) and (33)), we use Jovović's factorial-series generating function to prove the conjectures of Mathar (recurrence) and van Hoeij (prime-shift congruence) in OEIS A000159, revision 54, first and third FORMULA lines, dated 2 November 2015 and 10 June 2019. For the hit numbers u_h(n)=[t^h]U_n(t), the stronger uniform result is u_h(n)+2u_h(n+p)+u_h(n+2p) ≡ 0 (mod p) for every prime p, 1 <= h < p and n >= 0; the zero-hit case holds for n >= 1. It settles the neighboring two-, four- and five-hit congruences. We also prove prime-square antiperiodicity for three hits, give exact recurrence certificates for the neighboring diagonals, and correct the one-hit indexing formula by identifying it with a classical identity.

Authors

Institutions

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-21
DOI
https://doi.org/10.5281/zenodo.24413793
Primary Topic
Advanced Combinatorial Mathematics
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Prime-shift extensions of Kaplansky–Riordan's ménage identities: Mathar's recurrence and van Hoeij's congruences

Wenlin Zhang, Haobo Ma
Zenodo (CERN European Organization for Nuclear Research)
Advanced Combinatorial Mathematics
preprint

Prime-shift extensions of Kaplansky–Riordan's ménage identities: Mathar's recurrence and van Hoeij's congruences

Wenlin Zhang, Haobo Ma
preprint en

Abstract

Extending Kaplansky and Riordan's ménage identities (1946, pp. 121–122, equations (25) and (33)), we use Jovović's factorial-series generating function to prove the conjectures of Mathar (recurrence) and van Hoeij (prime-shift congruence) in OEIS A000159, revision 54, first and third FORMULA lines, dated 2 November 2015 and 10 June 2019. For the hit numbers u_h(n)=[t^h]U_n(t), the stronger uniform result is u_h(n)+2u_h(n+p)+u_h(n+2p) ≡ 0 (mod p) for every prime p, 1 <= h < p and n >= 0; the zero-hit case holds for n >= 1. It settles the neighboring two-, four- and five-hit congruences. We also prove prime-square antiperiodicity for three hits, give exact recurrence certificates for the neighboring diagonals, and correct the one-hit indexing formula by identifying it with a classical identity.

Zenodo (CERN European Organization for Nuclear Research)
National University of Singapore (SG)
Advanced Combinatorial Mathematics
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon