cp's OEIS Frontend

A054858 Number of basic blocks of size 5xn for tilings with square tiles of size up to 5 X 5.

%I A054858 #20 Aug 25 2020 06:05:58
%S A054858 1,7,13,20,35,66,118,218,402,738,1358,2498,4594,8450,15542,28586,
%T A054858 52578,96706,177870,327154,601730,1106754,2035638,3744122,6886514,
%U A054858 12666274,23296910,42849698,78812882,144959490,266622070
%N A054858 Number of basic blocks of size 5xn for tilings with square tiles of size up to 5 X 5.
%C A054858 Basic blocks of size 5xn are tilings of a 5xn area that cannot be vertically split into two smaller tilings of size 5xk and 5x(n-k).
%H A054858 S. Heubach, <a href="https://www.calstatela.edu/sites/default/files/users/u1231/Papers/cgtc30.pdf">Tiling an m-by-n area with squares of size up to k-by-k (m<=5)</a>, Congressus Numerantium 140 (1999), 43-64.
%H A054858 <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (1,1,1).
%F A054858 a(n) = a(n-1)+a(n-2)+a(n-3) for n>8, a(1)=1, a(2)=7, a(3)=13, a(4)=20, a(5)=35, a(6)=66, a(7)=218
%F A054858 G.f.: x^5+2*x^4-x^3+5*x^2-x-10+2*(-4*x+5-5*x^2)/(1-x-x^2-x^3). a(n) = 10*A000213(n)-8*A000073(n+1), n>5. [_R. J. Mathar_, Nov 02 2008]
%e A054858 a(3)=7 as the nature of basic blocks requires that the tiling cannot be split vertically into smaller tilings. Thus there needs to be one 2 X 2 tile whose lower left corner is in column 1 and one whose llc is in column 2. There are 7 ways to place these two 2 X 2 tiles.
%t A054858 f[ {A_, B_} ] := Module[ {til = A, basic = B}, {Flatten[ Append[ til, ListConvolve[ A, B ] ]], AppendTo[ basic, B[[ -1 ]] + B[[ -2 ]] + B[[ -3 ] ]]} ]; NumOfBasicBlocks[ n_ ] := Nest[ f, {{1, 1, 8, 28, 117, 472, 1916, 7765}, {1, 7, 13, 20, 35, 66, 118, 218}}, n-2 ][[ 2 ]] NumOfBasicBlocks[ 30 ]
%t A054858 LinearRecurrence[{1,1,1},{1,7,13,20,35,66,118,218},40] (* _Harvey P. Dale_, Dec 06 2018 *)
%Y A054858 Cf. A054857.
%K A054858 easy,nonn
%O A054858 1,2
%A A054858 Silvia Heubach (silvi(AT)cine.net), Apr 21 2000