A short proof of Mathar's 2013 recurrence conjecture for the Meixner sequence A214615
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866913093346394112 |
|---|---|
| author | Niu, Tong |
| author_facet | Niu, Tong |
| contents | For the OEIS sequence A214615, defined by $a(n) = M_{n}(1)$ where $M_{n}$ is the $n$-th Meixner polynomial satisfying $M_{n+1}(x) = x\,M_{n}(x) - n^{2}\,M_{n-1}(x)$, R.~J.~Mathar contributed on 6~March 2013 the conjectured order-2 P-recursive recurrence $a(n) - a(n-1) + (n-1)^{2}\,a(n-2) = 0$ for $n \ge 2$. We give a one-page proof. The exponential generating function $F(t) = \exp\!\bigl(\arctan t\bigr)/\sqrt{1+t^{2}}$ satisfies the first-order linear ODE $(1+t^{2})\,F'(t) = (1-t)\,F(t)$, and Mathar's recurrence then falls out by reading off the coefficient of $t^{n}/n!$. Both steps are short. The supplementary archive includes a SymPy script that checks the ODE identically and the recurrence numerically up to $n = 500$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2605_03170 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | A short proof of Mathar's 2013 recurrence conjecture for the Meixner sequence A214615 Niu, Tong Combinatorics 05A15, 11B37, 33C45, 33F10 For the OEIS sequence A214615, defined by $a(n) = M_{n}(1)$ where $M_{n}$ is the $n$-th Meixner polynomial satisfying $M_{n+1}(x) = x\,M_{n}(x) - n^{2}\,M_{n-1}(x)$, R.~J.~Mathar contributed on 6~March 2013 the conjectured order-2 P-recursive recurrence $a(n) - a(n-1) + (n-1)^{2}\,a(n-2) = 0$ for $n \ge 2$. We give a one-page proof. The exponential generating function $F(t) = \exp\!\bigl(\arctan t\bigr)/\sqrt{1+t^{2}}$ satisfies the first-order linear ODE $(1+t^{2})\,F'(t) = (1-t)\,F(t)$, and Mathar's recurrence then falls out by reading off the coefficient of $t^{n}/n!$. Both steps are short. The supplementary archive includes a SymPy script that checks the ODE identically and the recurrence numerically up to $n = 500$. |
| title | A short proof of Mathar's 2013 recurrence conjecture for the Meixner sequence A214615 |
| topic | Combinatorics 05A15, 11B37, 33C45, 33F10 |
| url | https://arxiv.org/abs/2605.03170 |