Hypergeometric-type sequences are a generalization of hypergeometric sequences, allowing for linear combinations of interlaced hypergeometric terms. They form a subring of the ring of holonomic sequences and can be used to represent a wide range of discrete functions, including those involving trigonometric functions with linear arguments.
This paper presents algorithms for efficiently processing and analyzing hypergeometric-type sequences, including computing holonomic recurrence equations and performing Hadamard product operations.