tags:

views:

30

answers:

0
Q: 

Recurrence Relation

Hi, everyone I have simple recurrence relation and I need to solve it in teta() terms.

(n-1)^2 f(n) = (n-1)(n+1)f(n-1) + (n-3)(n+1)f(n-2) + (n(n-1))/2

That would be great if you can help me out. Thanks

related questions

Which languages support *recursive* function literals / anonymous functions?
Recursive List Flattening
Faster Directory Walk with VB6 Query: Cache and Ram issues?
How do I write a generic memoize function?
Examples of Recursive functions
Recursive overloading semantics in the Scala REPL - JVM languages
Shortest Root to Leaf Path
Topological sort, recursive, using generators.
How do you recursively unzip archives in a directory and its subdirectories from the Unix command-line?
Real-world examples of recursion
Building a Table Dependency Graph With A Recurssive Query
Recursion or Iteration?
Recursive lambda expression to traverse a tree in C#
Is it possible to make a recursive SQL query ?
Recursive function for an xml file (hierarchial data).
Can Ruby convert an acts_as_nested_set to a JSON hash cleanly without recursion?
Recursion in Live VC++ Code
How do you get the last record generated in a recursive CTE?
How to keep a "things done" count in a recursive algorithm in Java?
What is tail-recursion?
Find number of files in all subdirectories
Is there some way to speed up recursion by remembering child nodes?
What is the best way to learn recursion?
Expression Evaluation and Tree Walking using polymorphism? (ala Steve Yegge)
What is recursion and when should I use it?