The number of [old-time] basketball games with final score \(n\):\(n\) where the home team was never losing but also never ahead by more than \(w\) points (Q870079)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The number of [old-time] basketball games with final score \(n\):\(n\) where the home team was never losing but also never ahead by more than \(w\) points |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The number of [old-time] basketball games with final score \(n\):\(n\) where the home team was never losing but also never ahead by more than \(w\) points |
scientific article |
Statements
The number of [old-time] basketball games with final score \(n\):\(n\) where the home team was never losing but also never ahead by more than \(w\) points (English)
0 references
12 March 2007
0 references
Summary: We show that the generating function (in \(n\)) for the number of walks on the square lattice with steps \((1,1)\), \((1,-1)\), \((2,2)\) and \((2,-2)\) from \((0,0)\) to \((2n,0)\) in the region \(0 \leq y\leq w\) satisfies a very special fifth order nonlinear recurrence relation in \(w\) that implies both its numerator and denominator satisfy a linear recurrence relation.
0 references
generating function
0 references
linear recurrence relation
0 references
