Skip to main content

Computation of Some Integer Sequences in Maple

  • Conference paper
  • First Online:
  • 596 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 10490))

Abstract

We consider some integer sequences connected with combinatorial applications. Specifically, we consider Stirling partition and cycle numbers, associated Stirling partition and cycle numbers, and Eulerian numbers of the first and second kinds. We consider their evaluation in different contexts. One context is the calculation of a single value based on single input arguments. A more common context, however, is the calculation of a sequence of values. We compare strategies for both. Where possible, we compare with existing Maple implementations.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   59.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   79.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Notes

  1. 1.

    Product placement: times found using an Intel i7 in a Lenovo Ultrabook.

References

  1. Graham, R.L., Knuth, D.E., Patashnik, O.: Concrete Mathematics. Addison-Wesley Publishing Co., Reading (1994)

    MATH  Google Scholar 

  2. Comtet, L.: Advanced Combinatorics. D. Reidel Publishing Co., Dordrecht (1974)

    Book  MATH  Google Scholar 

  3. Howard, F.T.: Associated stirling numbers. Fibonacci Quart. 18(4), 303–315 (1980)

    MathSciNet  MATH  Google Scholar 

  4. Corless, R.M., Jeffrey, D.J., Knuth, D.E.: A sequence of series for the Lambert W Function. In: Kuechlin, W.W. (ed.) Proceedings of the ISSAC 1997. ACM Press (1997)

    Google Scholar 

  5. Karamata, J.: Theoreme sur la sommabilite exponentielle et d’autres sommabilites rattachant. Mathematica, Cluj 9, 164–178 (1935). Romania

    MATH  Google Scholar 

  6. Knuth, D.E.: Two notes on notation. Am. Math. Mon. 99, 403–422 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  7. Stirling, J.: Methodus Differentialis, London (1730)

    Google Scholar 

  8. Lehmer, D.H.: Generalized Eulerian numbers. J. Combin. Theory Ser. A 32, 195–215 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  9. Wilf, H.S.: The asymptotic behavior of the stirling numbers of the first kind. J. Combin. Theory Ser. A 64, 344–349 (1993)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to W. L. Fan .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Fan, W.L., Jeffrey, D.J., Postma, E. (2017). Computation of Some Integer Sequences in Maple. In: Gerdt, V., Koepf, W., Seiler, W., Vorozhtsov, E. (eds) Computer Algebra in Scientific Computing. CASC 2017. Lecture Notes in Computer Science(), vol 10490. Springer, Cham. https://doi.org/10.1007/978-3-319-66320-3_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-66320-3_10

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-66319-7

  • Online ISBN: 978-3-319-66320-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics