Skip to main content
SpringerLink
Log in

IntegerSequences: A Package for Computing with k-Regular Sequences

  • Conference paper
  • First Online:
Mathematical Software – ICMS 2018 (ICMS 2018)

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

Included in the following conference series:

Abstract

IntegerSequences is a Mathematica package for computing with integer sequences. Its support for k-regular sequences includes basic closure properties, guessing recurrences, and computing automata. Recent applications have included establishing the structure of extremal a / b-power-free words, obtaining a product formula for the generating function enumerating binomial coefficients by their p-adic valuations, and proving congruences for combinatorial sequences modulo prime powers.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

Institutional subscriptions

Notes

  1. 1.

    https://wolfr.am/uZ4DJDth.

  2. 2.

    http://reference.wolfram.com/language/ref/DifferenceRoot.html.

References

  1. Allouche, J.-P., Shallit, J.: The ring of \(k\)-regular sequences. Theoret. Comput. Sci. 98, 163–197 (1992)

    Article  MathSciNet  Google Scholar 

  2. Charlier, É., Rampersad, N., Shallit, J.: Enumeration and decidable properties of automatic sequences. Int. J. Found. Comput. Sci. 23, 1035–1066 (2012)

    Article  MathSciNet  Google Scholar 

  3. Christol, G., Kamae, T., Mendès France, M., Rauzy, G.: Suites algébriques, automates et substitutions. Bulletin de la Société Mathématique de France 108, 401–419 (1980)

    Article  MathSciNet  Google Scholar 

  4. Eu, S.-P., Liu, S.-C., Yeh, Y.-N.: Catalan and Motzkin numbers modulo 4 and 8. Eur. J. Comb. 29, 1449–1466 (2008)

    Article  MathSciNet  Google Scholar 

  5. Fine, N.: Binomial coefficients modulo a prime. Amer. Math. Monthly 54, 589–592 (1947)

    Article  MathSciNet  Google Scholar 

  6. The On-Line Encyclopedia of Integer Sequences. http://oeis.org

  7. Parreau, A., Rigo, M., Rowland, E., Vandomme, É.: A new approach to the 2-regularity of the \(\ell \)-abelian complexity of 2-automatic sequences. Electron. J. Comb. 22 (2015) #P1.27

    Google Scholar 

  8. Pudwell, L., Rowland, E.: Avoiding fractional powers over the natural numbers. Electron. J. Comb. 25 (2018) #P2.27

    Google Scholar 

  9. Rowland, E.: IntegerSequences. https://people.hofstra.edu/Eric_Rowland/packages.html#IntegerSequences

  10. Rowland, E.: A matrix generalization of a theorem of Fine. Integers 18A, A18 (2018)

    MathSciNet  Google Scholar 

  11. Rowland, E., Shallit, J.: Avoiding 3/2-powers over the natural numbers. Discrete Math. 312, 1282–1288 (2012)

    Article  MathSciNet  Google Scholar 

  12. Rowland, E., Yassawi, R.: Automatic congruences for diagonals of rational functions. Journal de Théorie des Nombres de Bordeaux 27, 245–288 (2015)

    Article  MathSciNet  Google Scholar 

  13. Rowland, E., Zeilberger, D.: A case study in meta-automation: automatic generation of congruence automata for combinatorial sequences. J. Differ. Equ. Appl. 20, 973–988 (2014)

    Article  MathSciNet  Google Scholar 

  14. Shallit, J.: Remarks on inferring integer sequences. https://cs.uwaterloo.ca/shallit/Talks/infer.ps

  15. Spiegelhofer, L., Wallner, M.: An explicit generating function arising in counting binomial coefficients divisible by powers of primes. Acta Arithmetica 181, 27–55 (2017)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Hofstra University, Hempstead, NY, 11549, USA

    Eric Rowland

Authors
  1. Eric Rowland
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Eric Rowland .

Editor information

Editors and Affiliations

  1. University of Bath, Bath, United Kingdom

    James H. Davenport

  2. Johannes Kepler University, Linz, Austria

    Manuel Kauers

  3. University of Waterloo, Waterloo, Ontario, Canada

    George Labahn

  4. Czech Technical University in Prague, Prague 6, Czech Republic

    Josef Urban

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG, part of Springer Nature

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Rowland, E. (2018). IntegerSequences: A Package for Computing with k-Regular Sequences. In: Davenport, J., Kauers, M., Labahn, G., Urban, J. (eds) Mathematical Software – ICMS 2018. ICMS 2018. Lecture Notes in Computer Science(), vol 10931. Springer, Cham. https://doi.org/10.1007/978-3-319-96418-8_49

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-96418-8_49

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-96417-1

  • Online ISBN: 978-3-319-96418-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation