A short proof of Mathar's 2013 recurrence conjecture for the Meixner sequence A214615

Abstract

For the OEIS sequence A214615, defined by a(n) = Mn(1) where Mn is the n-th Meixner polynomial satisfying Mn+1(x) = x\,Mn(x) - n2\,Mn-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 2. We give a one-page proof. The exponential generating function F(t) = \!( t)/1+t2 satisfies the first-order linear ODE (1+t2)\,F'(t) = (1-t)\,F(t), and Mathar's recurrence then falls out by reading off the coefficient of tn/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.

0

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.

Discussion (0)

Sign in to join the discussion.

Loading comments…