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!)
A081077 a(n) = Lucas(4*n+2) + 3, or Lucas(2*n)*Lucas(2*n+2). 0

%I #31 Dec 16 2023 17:45:30

%S 6,21,126,846,5781,39606,271446,1860501,12752046,87403806,599074581,

%T 4106118246,28143753126,192900153621,1322157322206,9062201101806,

%U 62113250390421,425730551631126,2918000611027446,20000273725560981

%N a(n) = Lucas(4*n+2) + 3, or Lucas(2*n)*Lucas(2*n+2).

%D Hugh C. Williams, Edouard Lucas and Primality Testing, John Wiley and Sons, 1998, p. 75.

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

%F a(n) = 8a(n-1) - 8a(n-2) + a(n-3).

%F a(n) = A081067(n)+1. - _R. J. Mathar_, May 18 2007

%F G.f.: -3*(2-9*x+2*x^2)/(x-1)/(x^2-7*x+1) = -3/(x-1)+(-3*x+3)/(x^2-7*x+1). - _R. J. Mathar_, Nov 18 2007

%F Sum_{n>=0} 1/a(n) = sqrt(5)/10. - _Amiram Eldar_, Oct 05 2020

%p luc := proc(n) option remember: if n=0 then RETURN(2) fi: if n=1 then RETURN(1) fi: luc(n-1)+luc(n-2): end: for n from 0 to 40 do printf(`%d,`,luc(4*n+2)+3) od: # _James A. Sellers_, Mar 05 2003

%t Table[LucasL[4*n + 2] + 3, {n, 0, 30}] (* _Amiram Eldar_, Oct 05 2020 *)

%o (PARI) Vec(-3*(2-9*x+2*x^2)/(x-1)/(x^2-7*x+1) + O(x^30)) \\ _Michel Marcus_, Dec 23 2014

%Y Cf. A000032 (Lucas numbers), A081067.

%K nonn,easy

%O 0,1

%A _R. K. Guy_, Mar 04 2003

%E More terms from _James A. Sellers_, Mar 05 2003

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 March 28 05:39 EDT 2024. Contains 371235 sequences. (Running on oeis4.)