maths

the Fibonacci sequence is recursively defined as follows

f(0)=1
f(1)=1
f(n)=f(n-2)+f(n-1) for n>=2

so you end up with

1 1 2 3 5 8 13 21 etc.

Religous Education:

tell me fibonacci

Thanks Rom,
-----------------------------------------------------------------------

That did not sound very polite Religious Education.
I might have made you say please first