Fibonacci

[Michele Dondi]

On Tue, 13 Dec 2005, kohmoto wrote:

>    I rewrote the definition.
>    %N A000001 If a(n-2) is i-th Fibnacci number then
>                     a(n)=Fibonacci(i+a(n-1)), a(1)=1, a(2)=2.
>                     Where Fibonacci(n) means the following function f(n)
>                     f(n)=f(n-1)+f(n-2), f(1)=1, f(2)=2
>    %e A000001 a(5)=Fibonacci(3+8)=144.
>                      Because a(3) is third Fibonacci number and a(4)=8

Just like differential equations, recursive relations defining sequences 
are meaningless if you don't give contour conditions, i.e. initial values. 
You may take them for granted, but IMHO you should specify them.


Michele
-- 
[Harrigan runs through an old woman's apartment, chasing the Predator.]
Lieutenant Mike Harrigan: It's okay! I'm a cop! 
Old Lady: I don't think he gives a shit!
- Predator 2 (1990)