|
%I #21 Apr 27 2017 19:35:21
%S 1,1,2,3,3,4,5,7,8,11,13,18,21,29,34,47,55,76,89,123,144,199,233,322,
%T 377,521,610,843,987,1364,1597,2207,2584,3571,4181,5778,6765,9349,
%U 10946,15127,17711,24476,28657,39603,46368,64079,75025,103682,121393,167761
%N a(2n-1)=F(n+1), a(2n)=L(n), where F(n) and L(n) are the Fibonacci and the Lucas sequences.
%C Alternate Fibonacci and Lucas sequence respecting their natural order.
%C See A116470 for an essentially identical sequence.
%H Reinhard Zumkeller, <a href="/A115339/b115339.txt">Table of n, a(n) for n = 1..10000</a>
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/FibonacciNumber.html">Fibonacci Number</a>
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/LucasNumber.html">Lucas Number.</a>
%H <a href="/index/Rec#order_04">Index entries for linear recurrences with constant coefficients</a>, signature (0,1,0,1).
%F a(n+2) = a(n) + a(n-2).
%F G.f.: x*( -1-x-x^2-2*x^3 ) / ( -1+x^2+x^4 ). - _R. J. Mathar_, Mar 08 2011
%t f[n_] := If[OddQ@n, Fibonacci[(n + 3)/2], Fibonacci[n/2 - 1] + Fibonacci[n/2 + 1]]; Array[f, 50] (* _Robert G. Wilson v_ *)
%o (Haskell)
%o a115339 n = a115339_list !! (n-1)
%o a115339_list = [1, 1, 2, 3] ++
%o zipWith (+) a115339_list (drop 2 a115339_list)
%o -- _Reinhard Zumkeller_, Aug 03 2013
%o (PARI) x='x+O('x^50); Vec(x*(-1-x-x^2-2*x^3)/(-1+x^2+x^4)) \\ _G. C. Greubel_, Apr 27 2017
%Y Cf. A000045, A000032.
%Y Cf. A000930.
%K easy,nonn
%O 1,3
%A _Giuseppe Coppoletta_, Mar 06 2006
%E More terms from _Robert G. Wilson v_, Apr 29 2006
|
