OFFSET
0,5
LINKS
Colin Barker, Table of n, a(n) for n = 0..1000
László Németh, Pascal pyramid in the space H^2 x R, arXiv:1701.06022 [math.CO], 2017 (4th line of Table 1).
Index entries for linear recurrences with constant coefficients, signature (5,-8,5,-1).
FORMULA
a(n) = 5*a(n-1) - 8*a(n-2) + 5*a(n-3) - a(n-4), n >= 5.
G.f.: x^3*(1 - 2*x) / ((1 - x)^2*(1 - 3*x + x^2)). - Colin Barker, Oct 07 2017
For n > 0, a(n) = Fibonacci(2*n - 5) + n - 3 = Sum_{k=1..n-2} Sum_{j=0..k-1} A001519(j). - Ehren Metcalfe, Apr 18 2019
MATHEMATICA
LinearRecurrence[{5, -8, 5, -1}, {0, 0, 0, 1, 3}, 33] (* a(0)=0 inserted by Georg Fischer, Apr 08 2019 *)
PROG
(PARI) concat(vector(3), Vec(x^3*(1 - 2*x) / ((1 - x)^2*(1 - 3*x + x^2)) + O(x^50))) \\ Colin Barker, Oct 07 2017
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Eric M. Schmidt, Sep 30 2017
STATUS
approved