login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A156092 Alternating sum of the squares of the first n Fibonacci numbers with index divisible by 4. 4
0, -9, 432, -20304, 953865, -44811360, 2105180064, -98898651657, 4646131447824, -218269279396080, 10254010000167945, -481720200728497344, 22630595424239207232, -1063156264738514242569, 49945713847285930193520, -2346385394557700204852880 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
COMMENTS
Natural bilateral extension (brackets mark index 0): ..., -953865, 20304, -432, 9, 0, [0], -9, 432, -20304, 953865, -44811360, ... This is (-A156092)-reversed followed by A156092. That is, A156092(-n) = -A156092(n-1).
LINKS
FORMULA
Let F(n) be the Fibonacci number A000045(n) and let L(n) be the Lucas number A000032(n).
a(n) = sum_{k=1..n} (-1)^k F(4k)^2.
Closed form: a(n) = (-1)^n (L(8n+4) - 7)/35.
Factored closed form: a(n) = (-1)^n F(4n) F(4n+4)/7.
Recurrence: a(n) + 47 a(n-1) + a(n-2) = (-1)^n 9.
Recurrence: a(n) + 48 a(n-1) + 48 a(n-2) + a(n-3) = 0.
G.f.: A(x) = -9 x/(1 + 48 x + 48 x^2 + x^3) = -9 x/((1 + x)(1 + 47 x + x^2)).
MATHEMATICA
a[n_Integer] := If[ n >= 0, Sum[ (-1)^k Fibonacci[4k]^2, {k, 1, n} ], Sum[ -(-1)^k Fibonacci[-4k]^2, {k, 1, -n - 1} ] ]
CROSSREFS
Sequence in context: A081481 A160376 A271652 * A092813 A242280 A266294
KEYWORD
sign,easy
AUTHOR
Stuart Clary, Feb 04 2009
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 08:45 EDT 2024. Contains 371782 sequences. (Running on oeis4.)