Download PDFOpen PDF in browser

Computation of Some Integer Sequences in Maple

(EasyChair Preprint no. 4)

16 pagesPublished: November 20, 2017

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.

Keyphrases: Eulerian numbers of the first order, Eulerian numbers of the second order, Maple, r-associated Stirling cycle numbers, r-associated Stirling partition numbers

Links:
BibTeX entry
BibTeX does not have the right entry for preprints. This is a hack for producing the correct reference:
@Booklet{EasyChair:4,
  author = {W.L. Fan and David J. Jeffrey and Erik Postma},
  title = {Computation of Some Integer Sequences in Maple},
  howpublished = {EasyChair Preprint no. 4},
  doi = {10.29007/pjn4},
  year = {EasyChair, 2017}}
Download PDFOpen PDF in browser