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
Tanya Khovanova, Recursive Sequences
Index entries for linear recurrences with constant coefficients, signature (1, 1).
FORMULA
a(n) = round( (16phi-8)/5 phi^n) (works for n>4). - Thomas Baruchel, Sep 08 2004
a(n) = 8*F(n) = F(n+4) + F(n) + F(n-4) for n>3, where F=A000045.
G.f.: 8*x/(1-x-x^2). - Philippe Deléham, Nov 20 2008
MATHEMATICA
a={}; b=0; c=8; AppendTo[a, b]; AppendTo[a, c]; Do[b=b+c; AppendTo[a, b]; c=b+c; AppendTo[a, c], {n, 4!}]; a (* Vladimir Joseph Stephan Orlovsky, Sep 17 2008 *)
LinearRecurrence[{1, 1}, {0, 8}, 40] (* Harvey P. Dale, Jan 19 2018 *)
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
STATUS
approved