OFFSET
0,3
REFERENCES
R. Schumacher, Explicit formulas for sums involving the squares of the first n Tribonacci numbers, Fib. Q., 58:3 (2020), 194-202.
LINKS
Paolo Xausa, Table of n, a(n) for n = 0..1000
Index entries for linear recurrences with constant coefficients, signature (3,-1,-1,-3,1,1,1).
FORMULA
From Colin Barker, Sep 13 2020: (Start)
G.f.: x^2*(2 - x + x^3) / ((1 - x)*(1 - x - x^2 - x^3)^2).
a(n) = 3*a(n-1) - a(n-2) - a(n-3) - 3*a(n-4) + a(n-5) + a(n-6) + a(n-7) for n>6. (End)
MATHEMATICA
LinearRecurrence[{3, -1, -1, -3, 1, 1, 1}, {0, 0, 2, 5, 13, 33, 75}, 40] (* Paolo Xausa, Jul 06 2026 *)
PROG
(PARI) a(n)=([0, 1, 0, 0, 0, 0, 0; 0, 0, 1, 0, 0, 0, 0; 0, 0, 0, 1, 0, 0, 0; 0, 0, 0, 0, 1, 0, 0; 0, 0, 0, 0, 0, 1, 0; 0, 0, 0, 0, 0, 0, 1; 1, 1, 1, -3, -1, -1, 3]^n*[0; 0; 2; 5; 13; 33; 75])[1, 1] \\ Charles R Greathouse IV, May 25 2026
CROSSREFS
KEYWORD
nonn,easy,changed
AUTHOR
N. J. A. Sloane, Sep 12 2020
STATUS
approved
