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.
%I A127864 #31 Nov 11 2024 05:02:18
%S A127864 1,1,5,11,33,87,241,655,1793,4895,13377,36543,99841,272767,745217,
%T A127864 2035967,5562369,15196671,41518081,113429503,309895169,846649343,
%U A127864 2313089025,6319476735,17265131521,47169216511,128868696065,352075825151,961889042433,2627929735167
%N A127864 Number of tilings of a 2 X n board with 1 X 1 and L-shaped tiles (where the L-shaped tiles cover 3 squares).
%C A127864 The signed version of this sequence appears as A077917.
%H A127864 Alois P. Heinz, <a href="/A127864/b127864.txt">Table of n, a(n) for n = 0..1000</a>
%H A127864 P. Z. Chinn, R. Grimaldi and S. Heubach, <a href="http://www.cs.uwaterloo.ca/journals/JIS/VOL10/Heubach/heubach40.html">Tiling with Ls and Squares</a>, J. Int. Sequences 10 (2007) #07.2.8.
%H A127864 S. Heubach, <a href="https://www.calstatela.edu/sites/default/files/users/u1231/Presentations/talklv.pdf">Tiling with Ls and Squares</a>, 2005.
%H A127864 <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (1,4,2).
%F A127864 a(n) = a(n-1) + 4*a(n-2) + 2*a(n-3).
%F A127864 a(n) = (-1)^n + (1/sqrt(3)) * ((1+sqrt(3))^n - (1-sqrt(3))^n).
%F A127864 G.f.: 1/(1 - x - 4*x^2 - 2*x^3).
%F A127864 a(n) = A028860(n+2) + (-1)^n. - _R. J. Mathar_, Oct 29 2010
%F A127864 E.g.f.: exp(-x) + (2/sqrt(3))*exp(x)*sinh(sqrt(3)*x). - _G. C. Greubel_, Dec 08 2022
%F A127864 From _Greg Dresden_, Nov 10 2024: (Start)
%F A127864 a(n) = 1 + 4*a(n-2) + 6*Sum_{i=0..n-3} a(i) for n>1.
%F A127864 a(2*n) = a(n)^2 + 4*a(n-1)^2 + 4*a(n-1)*a(n-2) for n>1. (End)
%e A127864 a(2) = 5 because the 2 X 2 board can be tiled either with 4 squares or with a single L-shaped tile (in four orientations) together with a single square tile.
%t A127864 CoefficientList[Series[1/(1-x-4*x^2-2*x^3), {x,0,30}], x]
%o A127864 (Magma) I:=[1,1,5]; [n le 3 select I[n] else Self(n-1) + 4*Self(n-2) + 2*Self(n-3): n in [1..41]]; // _G. C. Greubel_, Dec 08 2022
%o A127864 (SageMath)
%o A127864 A028860 = BinaryRecurrenceSequence(2,2,-1,1)
%o A127864 def A127864(n): return A028860(n+2) + (-1)^n
%o A127864 [A127864(n) for n in range(51)] # _G. C. Greubel_, Dec 08 2022
%Y A127864 Cf. A077917, A127865, A127866, A127867, A127868, A127869, A127870, A127871, A127872.
%Y A127864 Column k=2 of A220054. - _Alois P. Heinz_, Dec 03 2012
%K A127864 easy,nonn
%O A127864 0,3
%A A127864 Silvia Heubach (sheubac(AT)calstatela.edu), Feb 03 2007