WOLFRAM|DEMONSTRATIONS PROJECT

Call Graphs of Nestedly Recursive Functions

​
f(n)=af(n-bf(n-c)):
a
3
b
1
c
1
range of n
30
indirect calls
exclude n<1
include labels
f(n)=3f(n-1f(n-1))
Nestedly recursive functions nestedly "call" previous instances of themselves. Even very simple recursion relations can lead to a complex sequence of values for nestedly recursive functions.