OFFSET
0,2
REFERENCES
A. T. Benjamin and J. J. Quinn, Proofs that really count: the art of combinatorial proof, M.A.A. 2003, p. 15.
LINKS
G. C. Greubel, Table of n, a(n) for n = 0..1000
Tanya Khovanova, Recursive Sequences
Index entries for linear recurrences with constant coefficients, signature (1, 1).
FORMULA
a(n) = 11*F(n) = F(n+4) + F(n+2) + F(n) + F(n-2) + F(n-4) with n > 3 and F = A000045.
G.f.: 11*x/(1-x-x^2). - Philippe Deléham, Nov 20 2008
a(n) = Fibonacci(n+5) - Fibonacci(n-5), where Fibonacci(-5..-1) = 5, -3, 2, -1, 1. - Bruno Berselli, May 22 2015
MATHEMATICA
Table[11 Fibonacci(n), {n, 0, 40}] (* Bruno Berselli, May 22 2015 *)
PROG
(Magma) [11*Fibonacci(n): n in [0..40]]; // Bruno Berselli, May 22 2015
(PARI) x='x+O('x^50); concat([0], Vec(11*x/(1-x-x^2))) \\ G. C. Greubel, Aug 25 2017
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
EXTENSIONS
More terms from Bruno Berselli, May 22 2015
STATUS
approved