13 lines
241 B
Text
13 lines
241 B
Text
L := proc(n, L_0, L_1, add)
|
|
if n = 0 then
|
|
return L_0;
|
|
elif n = 1 then
|
|
return L_1;
|
|
else
|
|
return L(n - 1) + L(n - 2) + add;
|
|
end if;
|
|
end proc:
|
|
|
|
Leonardo := n -> (L(1, 1, 1),[seq(0..n - 1)])
|
|
|
|
Fibonacci := n -> (L(0, 1, 0), [seq(0..n - 1)])
|