Code required for recurrence relations

*To*: mathgroup at smc.vnet.net*Subject*: [mg90235] Code required for recurrence relations*From*: "Ant King" <mathstutoring at ntlworld.com>*Date*: Thu, 3 Jul 2008 06:10:00 -0400 (EDT)

Hi all I am running v. 6.03 and would like to know if anyone is aware of any code (or has a function) that will perform the following task Take a generating function, such as 2*x/(1-x)^2, and use it to extract the recurrence relation from whence it came - in this case it just generates the even numbers So the function will be something like f[2*x/(1-x)^2,u,n] and would output something like u[n]->u[n-1]+2 Many thanks Ant

**Follow-Ups**:**Re: Code required for recurrence relations***From:*Daniel Lichtblau <danl@wolfram.com>

**Re: Code required for recurrence relations***From:*Andrzej Kozlowski <akoz@mimuw.edu.pl>