OFFSET
0,1
LINKS
Colin Barker, Table of n, a(n) for n = 0..1000
Index entries for linear recurrences with constant coefficients, signature (2,0,-1).
FORMULA
a(n) = Fibonacci(n+5)+2 = A157725(n+5).
a(n) = 2*a(n-1) - a(n-3).
From Elmo R. Oliveira, Apr 17 2026: (Start)
G.f.: (7 - 4*x - 5*x^2)/((1 - x)*(1 - x - x^2)).
E.g.f.: 2*exp(x) + exp(x/2)*(25*cosh(sqrt(5)*x/2) + 11*sqrt(5)*sinh(sqrt(5)*x/2))/5. - Stefano Spezia, Apr 19 2026
MATHEMATICA
LinearRecurrence[{2, 0, -1}, {7, 10, 15}, 40] (* Harvey P. Dale, Jun 10 2022 *)
PROG
(PARI) pisotL(nmax, a1, a2) = {
a=vector(nmax); a[1]=a1; a[2]=a2;
for(n=3, nmax, a[n] = ceil(a[n-1]^2/a[n-2]));
a
}
pisotL(50, 7, 10) \\ Colin Barker, Aug 07 2016
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
STATUS
approved
