Self-Convolutions of Generalized Narayana Numbers

Abstract

For the Fibonacci numbers Fn, we have the self-convolution formula 5 Σi=0n Fi Fn-i = (2n)Fn+1 - (n+1)Fn. We find the corresponding self-convolution formula for the Narayana numbers Rn which satisfy Rn = Rn-1 + Rn-3, and then generalize it to the k-step Narayana numbers Rn with order-k recurrence formula Rn = Rn-1 + Rn-k.

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…