A226578 Smallest number of integer-sided squares needed to tile a 5 X n rectangle.

0, 5, 4, 4, 5, 1, 5, 5, 5, 6, 2, 6, 6, 6, 7, 3, 7, 7, 7, 8, 4, 8, 8, 8, 9, 5, 9, 9, 9, 10, 6, 10, 10, 10, 11, 7, 11, 11, 11, 12, 8, 12, 12, 12, 13, 9, 13, 13, 13, 14, 10, 14, 14, 14, 15, 11, 15, 15, 15, 16, 12, 16, 16, 16, 17, 13, 17, 17, 17, 18, 14, 18, 18

Offset

0,2

Links

Alois P. Heinz, Table of n, a(n) for n = 0..1000

Index entries for linear recurrences with constant coefficients, signature (1,0,0,0,1,-1)

Formula

G.f.: x*(x^6-x^5-4*x^4+x^3-x+5)/(x^6-x^5-x+1).

a(n) = 1 + a(n-5) for n>6.

Example

a(11) = 6:
._._._._._._._._._._._.
|         |     |     |
|         |     |     |
|         |_____|_____|
|         |   |   |   |
|_________|___|___|___|

Maple

a:= n-> `if`(n=1, 5, iquo(n, 5, 'r') +[0, 4$3, 5][r+1]):
seq(a(n), n=0..80);

Crossrefs

Row m=5 of A113881, A219158.

Sequence in context: A244999 A201129 A261509 * A134206 A134209 A232007

Adjacent sequences: A226575 A226576 A226577 * A226579 A226580 A226581

Keyword

nonn,easy

Author

Alois P. Heinz, Jun 12 2013

Status

approved