Skip to main content
SpringerLink
Log in

Several computing formulas for combinatorial sums

  • Published:
Applied Mathematics-A Journal of Chinese Universities Aims and scope Submit manuscript

Abstract

In this paper, by Riordan array several computing formulas for the combinatorial sums are given.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Shapiro, L. V., Getu, S., Woan, W. J., et al., The Riordan group, Discrete Appl. Math., 1991,34:229–239.

    Article  MATH  Google Scholar 

  2. Sprugnoli, R., Riordan arrays and combinatorial sums, Discrete Math., 1994,132:267–290.

    Article  MATH  Google Scholar 

  3. Sprugnoli, R., Riordan arrays and the Abel-Gould identity, Discrete Math., 1995,142:213–223.

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Math., Hainan Normal College, 571158, Haikou

    Li Dachao & Shang Shiqi

  2. Hainan Radio and TV Univ., 570105, Haikou

    Li Dachao & Shang Shiqi

Authors
  1. Li Dachao
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Shang Shiqi
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Li, D., Shang, S. Several computing formulas for combinatorial sums. Appl. Math. Chin. Univ. 17, 119–124 (2002). https://doi.org/10.1007/s11766-002-0035-5

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11766-002-0035-5

MR Subject Classification

Keywords

Search

Navigation