ABSTRACT
In the previous chapter, we spent considerable time and effort to find out how large the numbers Sn(q) are. In this chapter, we will mostly concentrate on how nice they are, or rather, how nice the sequence {Sn(q)}1≤n is. By abuse of language, we will often refer to this sequence as the sequence Sn(q). First, of course, we should define what we mean by “nice.” We have already
made one important definition, that of P -recursive (or polynomially recursive) sequences in Exercise 29 of Chapter 1, but for easy reference we repeat that definition here.
