A short proof of Mathar's 2013 recurrence conjecture for the Laguerre sequence~A025166
Abstract
For the OEIS sequence A025166, defined by a(n) = -n!\,2n\,Ln(1/2) where Ln is the Laguerre polynomial of degree n, R.~J.~Mathar contributed in February 2013 the conjectured order-2 P-recursive recurrence \[ a(n) + (-4n+3)\, a(n-1) + 4(n-1)2\, a(n-2) \;=\; 0, n 2. \] We give a one-page proof. The exponential generating function F(x) = -\!(-x/(1-2x))/(1-2x) satisfies the first-order linear ODE (1-2x)2 F'(x) = (1-4x)\, F(x), and Mathar's recurrence then falls out by reading off the coefficient of xn/n!. Both steps are short. The supplementary archive includes a SymPy script which checks the ODE identically and the recurrence numerically up to n = 5000.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.