cp's OEIS Frontend

A258160 a(n) = 8*Lucas(n).

%I A258160 #44 Aug 20 2022 18:49:43
%S A258160 16,8,24,32,56,88,144,232,376,608,984,1592,2576,4168,6744,10912,17656,
%T A258160 28568,46224,74792,121016,195808,316824,512632,829456,1342088,2171544,
%U A258160 3513632,5685176,9198808,14883984,24082792,38966776,63049568,102016344,165065912
%N A258160 a(n) = 8*Lucas(n).
%H A258160 Bruno Berselli, <a href="/A258160/b258160.txt">Table of n, a(n) for n = 0..300</a>
%H A258160 Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html#onePlusOne">Recursive Sequences: a(n) = a(n-1)+a(n-2)</a>.
%H A258160 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (1,1).
%F A258160 G.f.: 8*(2 - x)/(1 - x - x^2).
%F A258160 a(n)   = Fibonacci(n+6) - Fibonacci(n-6), where Fibonacci(-6..-1) = -8, 5, -3, 2, -1, 1 (see similar sequences listed in Crossrefs).
%F A258160 a(n)   = Lucas(n+4) + Lucas(n) + Lucas(n-4), where Lucas(-4..-1) = 7, -4, 3, -1.
%F A258160 a(n)   = a(n-1) + a(n-2) for n>1, a(0)=16, a(1)=8.
%F A258160 a(n)   = 2*A156279(n).
%F A258160 a(n+1) = 4*A022112(n).
%t A258160 Table[8 LucasL[n], {n, 0, 40}]
%t A258160 CoefficientList[Series[8*(2 - x)/(1 - x - x^2), {x, 0, 50}], x] (* _G. C. Greubel_, Dec 21 2017 *)
%o A258160 (Sage) [8*lucas_number2(n, 1, -1) for n in (0..40)]
%o A258160 (Magma) [8*Lucas(n): n in [0..40]];
%o A258160 (PARI) a(n)=([0,1; 1,1]^n*[16;8])[1,1] \\ _Charles R Greathouse IV_, Oct 07 2015
%Y A258160 Cf. A022112, A039834, A156279.
%Y A258160 Cf. A022091: 8*Fibonacci(n).
%Y A258160 Cf. A022352: Fibonacci(n+6) + Fibonacci(n-6).
%Y A258160 Cf. sequences with the formula Fibonacci(n+k)-Fibonacci(n-k): A000045 (k=1); A000032 (k=2); A022087 (k=3); A022379 (k=4, without initial 6); A022345 (k=5); this sequence (k=6); A022363 (k=7).
%K A258160 nonn,easy
%O A258160 0,1
%A A258160 _Bruno Berselli_, May 22 2015