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 Plus annual

Presents the access of premium content as premium feature

Premium Content

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 Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Let $a_n$ denote the number of ways in which a chess rook can move from acorner cell to the opposite corner cell of an $n \times n \times n$three-dimensional chessboard, assuming that the piece moves closer to the goalcell at each step. We describe the computer-driven \emph{discovery and proof}of the fact that the generating series $G(x)= \sum_{n \geq 0} a_n x^n$ admitsthe following explicit expression in terms of a Gaussian hypergeometricfunction: \[ G(x) = 1 + 6 \cdot \int_0^x \frac{\,\pFq21{1/3}{2/3}{2} {\frac{27w(2-3w)}{(1-4w)^3}}}{(1-4w)(1-64w)} \, dw.\]

Explicit formula for the generating series of diagonal 3D rook paths