A short proof of Mathar's 2016 recurrence conjecture for OEIS A176677

Abstract

For the OEIS sequence A176677, defined by the quadratic convolution recurrence a(0) = a(1) = 1 and a(n+1) = Σp=0n a(p) a(n-p) - 1 for n 1, R.~J.~Mathar contributed in March 2016 the conjectured order-4 P-recursive recurrence \[ (n+1)\,a(n) + 2(-3n+1)\,a(n-1) + (9n-13)\,a(n-2) - 4\,a(n-3) + 4(-n+4)\,a(n-4) = 0. \] We give a short proof. The convolution recurrence translates directly into the algebraic equation z(1-z) G(z)2 - (1-z) G(z) + (1 - z - z2) = 0 for the ordinary generating function G(z), and Mathar's recurrence then drops out as the coefficient form of a 1st-order linear inhomogeneous ODE q0(z) G(z) + q1(z) G'(z) = R(z) that we verify by polynomial division modulo the algebraic equation. The polynomial q1(z) admits the factorization q1(z) = -z(z-1)(2z-1)(2z2 + 3z - 1), whose roots are exactly the singularities of G. Deutsch's combinatorial interpretation (Motzkin paths of length n-1 with two-coloured level-zero horizontal steps) is preserved.

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…