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 A219968 #26 Sep 06 2022 13:28:37 %S A219968 1,1,1,2,3,4,8,13,19,35,58,89,154,256,405,681,1131,1822,3025,5012, %T A219968 8156,13465,22257,36415,59976,98961,162370,267184,440335,723521, %U A219968 1190237,1960146,3223045,5301876,8727650,14355677,23615683,38865307,63937660,105184761 %N A219968 Number of tilings of a 3 X n rectangle using straight (3 X 1) trominoes and 2 X 2 tiles. %H A219968 Alois P. Heinz, <a href="/A219968/b219968.txt">Table of n, a(n) for n = 0..1000</a> %H A219968 <a href="/index/Rec#order_09">Index entries for linear recurrences with constant coefficients</a>, signature (1,0,3,-2,0,-1,1,0,1). %F A219968 G.f.: -(x-1)^2*(x^2+x+1)^2 / (x^9+x^7-x^6-2*x^4+3*x^3+x-1). %F A219968 a(n) = 1 + Sum_{i=0..n-3} a(i)*(1 + B*(B-1)) where B=floor((n-i)/3). E.g. a(7) = 1 + a(0)*3 + a(1)*3 + a(2)*1 + a(3)*1 + a(4)*1 = 13. - _Greg Dresden_ and Andrew Chang, Aug 23 2022 %e A219968 a(6) = 8, because there are 8 tilings of a 3 X 6 rectangle using straight (3 X 1) trominoes and 2 X 2 tiles: %e A219968 ._._._._._._. ._____._._._. ._._____._._. ._._._____._. %e A219968 | | | | | | | |_____| | | | | |_____| | | | | |_____| | %e A219968 | | | | | | | |_____| | | | | |_____| | | | | |_____| | %e A219968 |_|_|_|_|_|_| |_____|_|_|_| |_|_____|_|_| |_|_|_____|_| %e A219968 ._._._._____. ._____._____. .___.___.___. ._____._____. %e A219968 | | | |_____| |_____|_____| | | | | |_____|_____| %e A219968 | | | |_____| |_____|_____| |___|_._|___| | | | | %e A219968 |_|_|_|_____| |_____|_____| |_____|_____| |___|___|___| %p A219968 gf:= -(x-1)^2*(x^2+x+1)^2 / (x^9+x^7-x^6-2*x^4+3*x^3+x-1): %p A219968 a:= n-> coeff(series(gf, x, n+1), x, n): %p A219968 seq(a(n), n=0..50); %Y A219968 Column k=3 of A219967. %K A219968 nonn,easy %O A219968 0,4 %A A219968 _Alois P. Heinz_, Dec 02 2012