\textsc{IntegerSequences}: a package for computing with k-regular sequences
From MaRDI portal
Publication:1662284
Recommendations
Cited in
(10)- scientific article; zbMATH DE number 742882 (Why is no real title available?)
- An elementary proof of Bridy's theorem
- Values of binary partition function represented by a sum of three squares
- IntegerSequences
- On congruence schemes for constant terms and their applications
- Automata and finite order elements in the Nottingham group
- Pattern avoidance in binary trees
- RComp: A \textit{Mathematica} package for computing with recursive sequences
- Congruences for Apéry numbers \(\beta_n = \sum_{k = 0}^n \binom{n}{k}^2 \binom{n + k}{k}\)
- Combinatorics on words and generating Dirichlet series of automatic sequences
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)