Symbolic computation with P-finite sequences.

The talk consists in two parts. The first part is devoted to computer algebra algorithms for the manipulation of P-finite~(holonomic in one variable) sequences and the second part, based on M.~Petkov{\v s}ek's thesis, to the resolution of linear recurrences with polynomial coefficients.