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 A387619 #11 Sep 04 2025 10:53:56
%S A387619 1,2,11,51,235,1092,5064,23489,108954,505377,2344171,10873339,
%T A387619 50435526,233943074,1085135139,5033353844,23347000765,108294084141,
%U A387619 502317568673,2329978980834,10807509809918,50130181109907,232526743191648,1078565548781339,5002881075314417
%N A387619 Number of ways to tile a 2 X n strip with squares, dominoes, and (straight and bent) trominoes.
%C A387619 Compare to A030186 which counts tilings with just squares and dominoes, and to A052980 which counts tilings with just dominos and bent trominos.
%H A387619 <a href="/index/Rec#order_06">Index entries for linear recurrences with constant coefficients</a>, signature (3,6,7,2,0,-1).
%F A387619 a(n) = 3*a(n-1) + 6*a(n-2) + 7*a(n-3) + 2*a(n-4) - a(n-6).
%F A387619 G.f.: (1 - x - x^2 - x^3)/(1 - 3*x - 6*x^2 - 7*x^3 - 2*x^4 + x^6).
%t A387619 LinearRecurrence[{3, 6, 7, 2, 0, -1}, {1, 2, 11, 51, 235, 1092}, 40]
%Y A387619 Cf. A030186, A052980.
%K A387619 nonn,easy,new
%O A387619 0,2
%A A387619 _Greg Dresden_ and Daeheon Shin, Sep 03 2025