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

The n-th Delannoy number and the n-th Schr\"oder number given by$D_n=\sum_{k=0}^n\binom{n}{k}\binom{n+k}{k}$ and$S_n=\sum_{k=0}^n\binom{n}{k}\binom{n+k}{k}/(k+1)$ respectively arise naturallyfrom enumerative combinatorics. Let p be an odd prime. We mainly show that$$\sum_{k=1}^{p-1}D_k/k^2=2(-1/p)E_{p-3} (mod p)$$ and$$\sum_{k=1}^{p-1}S_k/m^k=(m^2-6m+1)/(2m)*(1-((m^2-6m+1)/p) (mod p),$$ where(-) is the Legendre symbol, E_0,E_1,E_2,... are Euler numbers and m is anyinteger not divisible by p. We also conjecture that$\sum_{k=1}^{p-1}D_k^2/k^2=-2q_p(2)^2 (mod p)$, where $q_p(2)=(2^{p-1}-1)/p$.

On Delannoy numbers and Schr\"oder numbers