Hardin's six-column trace recurrence and Barker's generating functions

We prove the empirical recurrence in R. H. Hardin's OEIS entry A185765, revision 9, sole FORMULA field (October 3, 2025; submitted February 3, 2011). It counts labeled (n+1)-by-6 binary arrays whose contiguous 2-by-2 blocks have unequal traces at horizontal and vertical neighbors. A row-pair transfer operator reduces the all-length assertion to three exact finite identities. The recurrence holds for every n >= 13 and fails at n = 12, where its residual is -4160. Its reduced rational generating function proves that nine is the least possible eventual recurrence order over Q. The same method proves the smaller-width recurrences and Colin Barker's conjectural generating functions in A185761-A185764, including his two-column closed form. Transposition, divisibility by eight, and rationality at every fixed width give further consequences for Hardin's bivariate table A185769.

Authors

Institutions

Publication Details

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

Hardin's six-column trace recurrence and Barker's generating functions

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

Hardin's six-column trace recurrence and Barker's generating functions

Wenlin Zhang, Haobo Ma
preprint en

Abstract

We prove the empirical recurrence in R. H. Hardin's OEIS entry A185765, revision 9, sole FORMULA field (October 3, 2025; submitted February 3, 2011). It counts labeled (n+1)-by-6 binary arrays whose contiguous 2-by-2 blocks have unequal traces at horizontal and vertical neighbors. A row-pair transfer operator reduces the all-length assertion to three exact finite identities. The recurrence holds for every n >= 13 and fails at n = 12, where its residual is -4160. Its reduced rational generating function proves that nine is the least possible eventual recurrence order over Q. The same method proves the smaller-width recurrences and Colin Barker's conjectural generating functions in A185761-A185764, including his two-column closed form. Transposition, divisibility by eight, and rationality at every fixed width give further consequences for Hardin's bivariate table A185769.

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