English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Tools annual

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

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.

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