Hardinian Arrays
Copyright policy )Hardinian Arrays
In 2014, R.H. Hardin contributed a family of sequences about king-moves on an array to the On-Line Encyclopedia of Integer Sequences (OEIS). The sequences were recently noticed in an automated search of the OEIS by Kauers and Koutschan, who conjectured a recurrence for one of them. We prove their conjecture as well as some older conjectures stated in the OEIS entries. We also have some new conjectures for the asymptotics of Hardin's sequences.
- Rutgers, The State University of New Jersey United States
- Johannes Kepler University of Linz Austria
Symbolic computation of special functions (Gosper and Zeilberger algorithms, etc.), Exact enumeration problems, generating functions, FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO)
Symbolic computation of special functions (Gosper and Zeilberger algorithms, etc.), Exact enumeration problems, generating functions, FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO)
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).1 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!