|
%I #21 Sep 08 2022 08:45:39
%S 199,13201,1970299,224056801,28374454999,3450736132801,
%T 426236170575799,52337681992411201,6441140796368008699,
%U 792018481913198430001,97420733208491869044199,11981539981561372141075201
%N a(n) = L(11*n)/L(n) where L(n) = A000204(n).
%C All numbers in this sequence are:
%C congruent to 99 mod 100 (iff n is odd),
%C congruent to 1 mod 100 (iff n is even).
%H G. C. Greubel, <a href="/A153179/b153179.txt">Table of n, a(n) for n = 1..475</a>
%H <a href="/index/Rec#order_11">Index entries for linear recurrences with constant coefficients</a>, signature (89,4895,-83215,-582505,1514513,1514513,-582505,-83215,4895,89,-1).
%F From _R. J. Mathar_, Oct 22 2010: (Start)
%F a(n) = +89*a(n-1) +4895*a(n-2) -83215*a(n-3) -582505*a(n-4) +1514513*a(n-5) +1514513*a(n-6) -582505*a(n-7) -83215*a(n-8) +4895*a(n-9) +89*a(n-10) -a(n-11).
%F G.f.: -1 -1/(1+x) +(-2-47*x)/(x^2+47*x+1) +(2-3*x)/(x^2-3*x+1) +(-2-7*x)/(x^2+7*x+1) +(2-123*x)/(x^2-123*x+1) +(2-18*x)/(x^2-18*x+1).
%F a(n) = -(-1)^n -(-1)^n*A087265(n) +A005248(n) -(-1)^n*A056854(n) +A065705(n) +A087215(n). (End)
%t Table[LucasL[11*n]/LucasL[n], {n, 1, 50}]
%o (PARI) {lucas(n) = fibonacci(n+1) + fibonacci(n-1)};
%o for(n=0,30, print1( lucas(11*n)/lucas(n), ", ")) \\ _G. C. Greubel_, Dec 21 2017
%o (Magma) [Lucas(11*n)/Lucas(n): n in [0..30]]; // _G. C. Greubel_, Dec 21 2017
%Y Cf. A000032, A000204, A110391, A153173, A153175, A153177.
%K nonn
%O 1,1
%A _Artur Jasinski_, Dec 20 2008
| 