Academia.eduAcademia.edu

Outline

A Riordan array proof of

2002

Abstract

We give an alternative proof of an identity that appeared recently in Integers. By using the concept of Riordan arrays we obtain a short, elementary proof.

References (5)

  1. I. P. Goulden and D. M. Jackson. Combinatorial Enumeration. John Wiley & S., 1983.
  2. R. L. Graham, D. E. Knuth, and O. Patashnik. Concrete Mathematics. Addison- Wesley, 1989.
  3. A. Panholzer and H. Prodinger. A generating functions proof of a curious identity. Integers: The Electronic Journal of Combinatorial Number Theory, 2:A6, 3 pp., 2002.
  4. R. Sprugnoli. Riordan arrays and combinatorial sums. Discrete Mathematics, 132:267-290, 1994.
  5. Z.-W. Sun. A curious identity involving binomial coefficients. Integers: The Electronic Journal of Combinatorial Number Theory, 2:A4, 8 pp., 2002.