This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A156086 #5 Feb 10 2014 01:31:39
%S A156086 0,9,450,21186,995355,46760580,2196752004,103200583725,4848230683206,
%T A156086 227763641527110,10700042921091135,502674253649756424,
%U A156086 23614989878617461000,1109401850041370910801,52118271962065815346890,2448449380367051950393290
%N A156086 Sum of the squares of the first n Fibonacci numbers with index divisible by 4.
%C A156086 Natural bilateral extension (brackets mark index 0): ..., -21186, -450, -9, 0, [0], 9, 450, 21186, 995355, ... This is (-A156086)-reversed followed by A156086. That is, A156086(-n) = -A156086(n-1).
%F A156086 Let F(n) be the Fibonacci number A000045(n).
%F A156086 a(n) = sum_{k=1..n} F(4k)^2.
%F A156086 Closed form: a(n) = F(8n+4)/15 - (2n + 1)/5.
%F A156086 Recurrence: a(n) - 48 a(n-1) + 48 a(n-2) - a(n-3) = 18.
%F A156086 Recurrence: a(n) - 49 a(n-1) + 96 a(n-2) - 49 a(n-3) + a(n-4) = 0.
%F A156086 G.f.: A(x) = (9 x + 9 x^2)/(1 - 49 x + 96 x^2 - 49 x^3 + x^4) = 9 x (1 + x)/((1 - x)^2 (1 - 47 x + x^2)).
%t A156086 a[n_Integer] := If[ n >= 0, Sum[ Fibonacci[4k]^2, {k, 1, n} ], -Sum[ Fibonacci[-4k]^2, {k, 1, -n - 1} ] ]
%Y A156086 Cf. A156087, A156092, A156093.
%K A156086 nonn,easy
%O A156086 0,2
%A A156086 _Stuart Clary_, Feb 04 2009