Problem Statement

Leonardo numbers   are also known as the   Leonardo series.

The   Leonardo numbers   are a sequence of numbers defined by:

This task will be using the 3rd equation (above) to calculate the Leonardo numbers.

Edsger W. Dijkstra   used   Leonardo numbers   as an integral part of his   smoothsort   algorithm.

The first few Leonardo numbers are:

(The last task requirement will produce the Fibonacci numbers.)

Show all output here on this page.

Let's start with the solution:

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)])