OFFSET
0,2
COMMENTS
Partial sums of A102312.
Other sequences in the OEIS related to the sum of Fibonacci(k*n) (although not defined as such) are:
k = 1: A000071 = Fibonacci(n) - 1 (delete leading 0);
k = 2: A027941 = Fibonacci(2n+1) - 1;
k = 3: A099919 = (Fibonacci(3n+2) - 1)/2;
k = 4: A058038 = Fibonacci(2n)*Fibonacci(2n+2);
k = 6: A053606 = (Fibonacci(6n+3) - 2)/4.
These sequences appear to be second order linear inhomogeneous sequences of the form: a(0) = 0, a(1) = Fibonacci(k), a(n) = L(k)*a(n-1) + (-1)^(k+1)*a(n-2) + Fibonacci(k), where L(n) = A000032(n), n > 1.
The Koshy reference gives the closed form:
Sum_{i=0..n} Fibonacci(k*i) = (Fibonacci(n*k+k) - (-1)^k*Fibonacci(n*k) - Fibonacci(k))/(L(k) - (-1)^k - 1).
REFERENCES
Thomas Koshy; Fibonacci and Lucas numbers with applications, Wiley,2001, p. 86.
LINKS
Index entries for linear recurrences with constant coefficients, signature (12,-10,-1).
FORMULA
G.f.: 5*x/((x - 1)*(x^2 + 11*x - 1)). - R. J. Mathar, Dec 09 2010
a(n) = 11*a(n) + a(n-1) + 5, n > 1.
a(n) = 12*a(n-1) - 10*a(n-2) - a(n-3), n > 2.
a(n) = 1/11*(Fibonacci(5*n+5) + Fibonacci(5n) - 5).
MAPLE
with(combinat):fs5:=n-> sum(fibonacci(5*k), k=0..n):
seq(fs5(n), n=0..18)
PROG
(PARI) a(n)=(fibonacci(5*n+5)+fibonacci(5*n)-5)/11 \\ Charles R Greathouse IV, Jun 11 2015
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Gary Detlefs, Dec 07 2010
STATUS
approved