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!)
A203170 Sum of the fourth powers of the first n odd-indexed Fibonacci numbers. 3

%I #10 Dec 09 2016 13:44:40

%S 0,1,17,642,29203,1365539,64107780,3011403301,141469813301,

%T 6646055880582,312223061019703,14667837157106759,689076118833981960,

%U 32371909717271872585,1520790680382055836761,71444790066793903279242

%N Sum of the fourth powers of the first n odd-indexed Fibonacci numbers.

%C Natural bilateral extension (brackets mark index 0): ..., -1365539, -29203, -642, -17, -1, [0], 1, 17, 642, 29203, 1365539, ... That is, a(-n) = -a(n).

%F Let F(n) be the Fibonacci number A000045(n).

%F a(n) = Sum_{k=1..n} F(2k-1)^4.

%F Closed form: a(n) = (1/75)(F(8n) + 12 F(4n) + 18 n).

%F Recurrence: a(n) - 56 a(n-1) + 440 a(n-2) - 770 a(n-3) + 440 a(n-4) - 56 a(n-5) + a(n-6) = 0.

%F G.f.: A(x) = (x - 39 x^2 + 130 x^3 - 39 x^4 + x^5)/(1 - 56 x + 440 x^2 - 770 x^3 + 440 x^4 - 56 x^5 + x^6) = x(1 - 39 x + 130 x^2 - 39 x^3 + x^4)/((1 - x)^2 (1 - 7 x + x^2)(1 - 47 x + x^2)).

%t a[n_Integer] := (1/75)(Fibonacci[8n] + 12*Fibonacci[4n] + 18 n); Table[a[n], {n, 0, 20}]

%Y Cf. A203169, A203171, A203172.

%Y Cf. A001906, A103433, A163200.

%K nonn,easy

%O 0,3

%A _Stuart Clary_, Dec 30 2011

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 18 20:26 EDT 2024. Contains 371781 sequences. (Running on oeis4.)