A026822 CONTINUANT transform of Fibonacci number 1, 1, 2, 3, 5, 8, ...

1, 2, 5, 17, 90, 737, 9671, 203828, 6939823, 381894093, 33995514100, 4895735924493, 1140740465920969, 430064051388129806, 262340212087225102629, 258930219394142564424629, 413511822712657762611235142, 1068514808819727052729996031557, 4467460829187101520121876019174959

Offset: 1

Author

N. J. A. Sloane, Jun 10 2002

Keywords

• nonn

Links

• Alois P. Heinz, Table of n, a(n) for n = 1..75
• N. J. A. Sloane, Transforms

Programs

Maple

with(combinat):
a:= proc(n) option remember; `if`(n<0, 0,
      `if`(n=0, 1, fibonacci(n) *a(n-1) +a(n-2)))
    end:
seq(a(n), n=1..20);  # Alois P. Heinz, Aug 06 2013

Mathematica

a[n_] := a[n] = If[n<0, 0, If[n==0, 1, Fibonacci[n] a[n-1] + a[n-2]]];
Array[a, 20] (* Jean-François Alcover, Nov 09 2020, after Maple *)