Числа Leonardo

Числа Leonardo задаются следующей последовательностью:

1, 1, 3, 5, 9, 15, 25 ...

Рекурсивный способ

function LeonardoNumber( n : integer ):integer;
begin
  if n > 1 then result := LeonardoNumber( n - 1 ) + LeonardoNumber( n - 2 ) + 1
    else result := 1;
end;

Вычисление с помощью чисел Fibonacci

function LeonardoNumber2( n : integer ):integer;
begin
  result := 2 * FibonacciNumber( n + 1) - 1
end;

From the Free Pascal wiki, page "Leonardo number/ru", as it stood on 2020-02-19 after a change by Trev, out of the wiki's dump of 2024-05-26. Copyright stays with the author who wrote it, according to the old wiki's Licensing page. If you have concerns about this material, message the admin.