\textsc{IntegerSequences}: a package for computing with k-regular sequences
DOI10.1007/978-3-319-96418-8_49zbMATH Open1398.11161OpenAlexW2884864071WikidataQ60691825 ScholiaQ60691825MaRDI QIDQ1662284FDOQ1662284
Publication date: 17 August 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-96418-8_49
Recommendations
Symbolic computation and algebraic computation (68W30) Special sequences and polynomials (11B83) Automata sequences (11B85) Calculation of integer sequences (11Y55) Software, source code, etc. for problems pertaining to number theory (11-04)
Cited In (8)
- Title not available (Why is that?)
- Values of binary partition function represented by a sum of three squares
- On congruence schemes for constant terms and their applications
- Congruences for Apéry numbers βn =∑k=0nn k2n+k k
- IntegerSequences
- Automata and finite order elements in the Nottingham group
- Pattern avoidance in binary trees
- RComp: A \textit{Mathematica} package for computing with recursive sequences
Uses Software
This page was built for publication: \textsc{IntegerSequences}: a package for computing with \(k\)-regular sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1662284)