by Dimitris Prasakis
Last Updated February 11, 2019 10:20 AM

How can we solve the following recurrence relation using GF?

$a_n = 10*a_{n-1}-25*a_{n-1} + 5^n*{n+2 \choose 2}$

I think that most of it is pretty straightforward. What really concerns me is this part

$5^n{n+2 \choose 2}$

- ServerfaultXchanger
- SuperuserXchanger
- UbuntuXchanger
- WebappsXchanger
- WebmastersXchanger
- ProgrammersXchanger
- DbaXchanger
- DrupalXchanger
- WordpressXchanger
- MagentoXchanger
- JoomlaXchanger
- AndroidXchanger
- AppleXchanger
- GameXchanger
- GamingXchanger
- BlenderXchanger
- UxXchanger
- CookingXchanger
- PhotoXchanger
- StatsXchanger
- MathXchanger
- DiyXchanger
- GisXchanger
- TexXchanger
- MetaXchanger
- ElectronicsXchanger
- StackoverflowXchanger
- BitcoinXchanger
- EthereumXcanger