cp's OEIS Frontend

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.

A288581 a(0)=1, a(1)=0; thereafter a(n) = 2^Fibonacci(n-1)*a(n-1) + a(n-2).

Original entry on oeis.org

1, 0, 1, 2, 9, 74, 2377, 608586, 4985538889, 10455432852752714, 179622968672387565806504265, 6471599478241175343734843735327078926076234, 4005726056166563547283223187979602658910620746504772987089147436550473
Offset: 0

Views

Author

N. J. A. Sloane, Jul 04 2017

Keywords

Crossrefs

Cf. A288582.

Programs

  • Maple
    with(combinat);
    d:=proc(n) option remember;
    if n <= 1 then 1-n else 2^fibonacci(n-1)*d(n-1)+d(n-2); fi; end;
    [seq(d(n),n=0..12)];