OEIS A240513, revision 11, FORMULA 1–3: ladder proofs and extensions of Bala (2014)
We prove the three empirical formulas in OEIS A240513, revision 11, FORMULA entries 1–3, and extend Bala's (2014) Chebyshev treatment of the related norm sequence by making the ladder connection explicit. These formulas are Hardin's order-five recurrence, Barker's generating function, and Mathar's relation to A105309. The objects are binary two-column arrays in which no cell has exactly two equal-valued orthogonal neighbors, with the first cell fixed to zero. A transfer on sixteen ordered pairs of rows gives the recurrence and generating function. A norm identity proves the relation to A105309. The same construction proves the empirical width-three and width-four recurrences in A240514–A240515 and A240519; their minimal orders are 20 and 48. At every fixed width the generating function is rational. We also give correctly indexed Chebyshev identities and correct the sign and shift in A105309's Chebyshev-transform formula.
Authors
- Wenlin Zhang (ORCID: https://orcid.org/0009-0005-2414-7968)
- Haobo Ma
Institutions
- National University of Singapore (SG)
Publication Details
- Journal
- Zenodo (CERN European Organization for Nuclear Research)
- Published
- 2026-11-21
- DOI
- https://doi.org/10.5281/zenodo.24409471
- Primary Topic
- Advanced Combinatorial Mathematics
- Type
- preprint