cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A166473 a(n) = 2^L(n+1) * 3^L(n)/12, where L(n) is the n-th Lucas number (A000032(n)).

This page as a plain text file.
%I A166473 #9 Sep 08 2022 08:45:48
%S A166473 2,36,864,373248,3869835264,17332899271409664,
%T A166473 804905577934332296851095552,
%U A166473 167416167663978753511691999938432197602574336
%N A166473 a(n) = 2^L(n+1) * 3^L(n)/12, where L(n) is the n-th Lucas number (A000032(n)).
%C A166473 For m>1, A166469(A002110(m)*a(n)) = L(m+n).
%C A166473 A166469(a(n)) = L(n+2) - 2 = A014739(n).
%H A166473 G. C. Greubel, <a href="/A166473/b166473.txt">Table of n, a(n) for n = 1..14</a>
%F A166473 a(n) = A166471(n)/12.
%F A166473 For n>1, a(n) = 12*a(n-1) * a(n-2).
%t A166473 Table[(2^LucasL[n+1] 3^LucasL[n])/12,{n,10}] (* _Harvey P. Dale_, Aug 17 2011 *)
%o A166473 (PARI) lucas(n) = fibonacci(n+1) + fibonacci(n-1);
%o A166473 vector(10, n,  2^(lucas(n+1)-2)*3^(lucas(n)-1) ) \\ _G. C. Greubel_, Jul 22 2019
%o A166473 (Magma) [2^(Lucas(n+1)-2)*3^(Lucas(n)-1): n in [1..10]]; // _G. C. Greubel_, Jul 22 2019
%o A166473 (Sage) [2^(lucas_number2(n+1,1,-1)-2)*3^(lucas_number2(n,1,-1)-1) for n in (1..10)] # _G. C. Greubel_, Jul 22 2019
%o A166473 (GAP) List([1..10], n-> 2^(Lucas(1,-1,n+1)[2]-2)*3^(Lucas(1,-1,n)[2]-1)); # _G. C. Greubel_, Jul 22 2019
%Y A166473 Subsequence of A003586, A025487.
%K A166473 nonn
%O A166473 1,1
%A A166473 _Matthew Vandermast_, Nov 05 2009