OFFSET
0,1
LINKS
G. C. Greubel, Table of n, a(n) for n = 0..1000
Index entries for linear recurrences with constant coefficients, signature (0,1,0,1).
FORMULA
a(2n) = Fibonacci(n+4), a(2n+1) = Fibonacci(n+3).
a(n) = A053602(n+6).
a(n) = abs( A051792(n+11) ).
G.f.: (2 + 5*x + x^2 + 3*x^3)/(1 - x^2 - x^4). - G. C. Greubel, Dec 06 2022
MATHEMATICA
LinearRecurrence[{0, 1, 0, 1}, {2, 5, 3, 8}, 60] (* G. C. Greubel, Dec 06 2022 *)
PROG
(Magma) [Fibonacci(3 +Floor(n/2) +2*(n mod 2)): n in [0..60]]; // G. C. Greubel, Dec 06 2022
(SageMath) [fibonacci(3 +(n//2) + 2*(n%2)) for n in range(61)] # G. C. Greubel, Dec 06 2022
CROSSREFS
KEYWORD
nonn
AUTHOR
Gerald McGarvey, Aug 29 2004
STATUS
approved