WOLFRAM|DEMONSTRATIONS PROJECT

Multiterm Nestedly Recursive Functions

a

1

2

b

1

2

c

1

2

a

2

0

b

2

2

c

2

2

a

3

0

b

3

2

c

3

2

range of n

250

join points

Recursion relations with a very simple form can lead to surprisingly complex behavior. The recursion is

f(n)=

a

1

f(n-

b

1

f(n-

c

1

))+

a

2

f(n-

b

2

f(n-

c

2

))+

a

3

f(n-

b

3

f(n-

c

3

))

.