This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A026822 #15 Nov 09 2020 04:44:37 %S A026822 1,2,5,17,90,737,9671,203828,6939823,381894093,33995514100, %T A026822 4895735924493,1140740465920969,430064051388129806, %U A026822 262340212087225102629,258930219394142564424629,413511822712657762611235142,1068514808819727052729996031557,4467460829187101520121876019174959 %N A026822 CONTINUANT transform of Fibonacci number 1, 1, 2, 3, 5, 8, ... %H A026822 Alois P. Heinz, <a href="/A026822/b026822.txt">Table of n, a(n) for n = 1..75</a> %H A026822 N. J. A. Sloane, <a href="/transforms.txt">Transforms</a> %p A026822 with(combinat): %p A026822 a:= proc(n) option remember; `if`(n<0, 0, %p A026822 `if`(n=0, 1, fibonacci(n) *a(n-1) +a(n-2))) %p A026822 end: %p A026822 seq(a(n), n=1..20); # _Alois P. Heinz_, Aug 06 2013 %t A026822 a[n_] := a[n] = If[n<0, 0, If[n==0, 1, Fibonacci[n] a[n-1] + a[n-2]]]; %t A026822 Array[a, 20] (* _Jean-François Alcover_, Nov 09 2020, after Maple *) %K A026822 nonn %O A026822 1,2 %A A026822 _N. J. A. Sloane_, Jun 10 2002