|
|
A054857
|
|
Number of ways to tile a 5 X n region with square tiles of size up to 5 X 5.
|
|
14
|
|
|
1, 1, 8, 28, 117, 472, 1916, 7765, 31497, 127707, 517881, 2100025, 8515772, 34532063, 140030059, 567832091, 2302600696, 9337214060, 37863085664, 153537580071, 622606110920, 2524713292359, 10237896957896, 41515420557135
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,3
|
|
LINKS
|
|
|
FORMULA
|
a(n) = b(1)a(n-1)+b(2)a(n-2)+...+b(n)a(0), a(0)=a(1)=1, b(n) as defined in A054858.
a(n) = 2*a(n-1) +7*a(n-2) +6*a(n-3) -a(n-4) -5*a(n-5) -2*a(n-6) -3*a(n-7) -a(n-8). - R. J. Mathar, Nov 02 2008
G.f.: -(x^3+x^2+x-1)/(x^8+3*x^7+2*x^6+5*x^5+x^4-6*x^3-7*x^2-2*x+1). - Colin Barker, Jul 10 2012
|
|
EXAMPLE
|
a(2) = 8 as there is 1 tiling of a 5 X 2 region with only 1 X 1 tiles, 4 tilings with exactly one 2 X 2 tile and 3 tilings with exactly two 2 X 2 tiles.
|
|
MATHEMATICA
|
f[ {A_, B_} ] := Module[ {til = A, basic = B}, {Flatten[ Append[ til, ListConvolve[ A, B ] ] ], AppendTo[ basic, B[ [ -1 ] ] + B[ [ -2 ] ] + B[ [ -3 ] ] ]} ]; NumOfTilings[ n_ ] := Nest[ f, {{1, 1, 8, 28, 117, 472, 1916, 7765}, {1, 7, 13, 20, 35, 66, 118, 218}}, n - 2 ][ [ 1 ] ] NumOfTilings[ 30 ]
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
Silvia Heubach (silvi(AT)cine.net), Apr 21 2000
|
|
STATUS
|
approved
|
|
|
|