O'Reilly logo
  • wenyang duan thinks this is interesting:

Perhaps the simplest type of recurrence reduces immediately to a product. The recurrence

an = xnan – 1     for n > 0 with a0 = 1

is equivalent to

Image

From

Cover of An Introduction to the Analysis of Algorithms, Second Edition

Note

Give a try.