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!)
A014437 Odd Fibonacci numbers. 13

%I #64 Sep 29 2023 04:16:12

%S 1,1,3,5,13,21,55,89,233,377,987,1597,4181,6765,17711,28657,75025,

%T 121393,317811,514229,1346269,2178309,5702887,9227465,24157817,

%U 39088169,102334155,165580141,433494437,701408733,1836311903,2971215073

%N Odd Fibonacci numbers.

%H Nathaniel Johnston, <a href="/A014437/b014437.txt">Table of n, a(n) for n = 0..500</a>

%H <a href="/index/Rec#order_04">Index entries for linear recurrences with constant coefficients</a>, signature (0,4,0,1).

%F Fibonacci(3n+1) union Fibonacci(3n+2).

%F a(n) = Fibonacci(3*floor((n+1)/2)) + (-1)^n). - _Antti Karttunen_, Feb 05 2001

%F G.f.: ( -1-x+x^2-x^3 ) / ( -1+4*x^2+x^4 ). - _R. J. Mathar_, Feb 16 2011

%F a(2n) = v-w, a(2n+1) = v+w, with v=A001076(n+1), w=A001076(n). Therefore, a(2n)+a(2n+1) = 2*A001076(n+1). - _Ralf Stephan_, Aug 31 2013

%F From _Vladimir Reshetnikov_, Oct 30 2015: (Start)

%F a(n) = ((cos(Pi*n/2)-sqrt(phi)*sin(Pi*n/2))/phi^((3*n+2)/2) + (sqrt(phi)*cos(Pi*n/2)^2+sin(Pi*n/2)^2)*phi^((3*n+1)/2))/sqrt(5), where phi=(1+sqrt(5))/2.

%F E.g.f.: (cos(x/phi^(3/2))/phi - sin(x/phi^(3/2))/sqrt(phi) + cosh(x*phi^(3/2))*phi + sinh(x*phi^(3/2))*sqrt(phi))/sqrt(5).

%F (End)

%p with(combinat):A014437:=proc(n)return fibonacci((3*floor((n+1)/2)) + (-1)^n):end:

%p seq(A014437(n),n=0..31); # _Nathaniel Johnston_, Apr 18 2011

%t RecurrenceTable[{a[n] == 4*a[n-2] + a[n-4], a[0]==1, a[1]==1, a[2]==3, a[3]==5},a,{n,0,500}] (* _G. C. Greubel_, Oct 30 2015 *)

%t Table[ SeriesCoefficient[(-1 - x + x^2 - x^3)/(-1 + 4*x^2 + x^4), {x, 0, n}], {n, 0, 20}] (* _Nikolaos Pantelidis_, Feb 01 2023 *)

%t Select[Fibonacci[Range[50]],OddQ] (* _Harvey P. Dale_, Sep 01 2023 *)

%o (Magma) [Fibonacci((3*Floor((n+1)/2)) + (-1)^n): n in [0..50]]; // _Vincenzo Librandi_, Apr 18 2011

%o (PARI) Vec((-1-x+x^2-x^3)/(-1+4*x^2+x^4) + O(x^200)) \\ _Altug Alkan_, Oct 31 2015

%o (PARI) apply( A014437(n)=fibonacci(n\/2*3+(-1)^n), [0..30]) \\ _M. F. Hasler_, Nov 18 2018

%Y Cf. A001651, A059878, A000045.

%Y Cf. A360957 (sum of reciprocals).

%K nonn,easy

%O 0,3

%A _Mohammad K. Azarian_

%E a(30)-a(31) from _Vincenzo Librandi_, Apr 18 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 25 12:14 EDT 2024. Contains 371969 sequences. (Running on oeis4.)