cp's OEIS Frontend

A226581 Smallest number of integer-sided squares needed to tile an 8 X n rectangle.

%I A226581 #19 Sep 05 2021 22:02:26
%S A226581 0,8,4,5,2,5,4,7,1,7,5,6,3,6,5,8,2,8,6,7,4,7,6,9,3,9,7,8,5,8,7,10,4,
%T A226581 10,8,9,6,9,8,11,5,11,9,10,7,10,9,12,6,12,10,11,8,11,10,13,7,13,11,12,
%U A226581 9,12,11,14,8,14,12,13,10,13,12,15,9,15,13,14,11
%N A226581 Smallest number of integer-sided squares needed to tile an 8 X n rectangle.
%H A226581 Alois P. Heinz, <a href="/A226581/b226581.txt">Table of n, a(n) for n = 0..1000</a>
%H A226581 <a href="/index/Rec#order_09">Index entries for linear recurrences with constant coefficients</a>, signature (1,0,0,0,0,0,0,1,-1)
%F A226581 G.f.: x*(2*x^9-2*x^8-6*x^7+3*x^6-x^5+3*x^4-3*x^3+x^2-4*x+8) / (x^9-x^8-x+1).
%F A226581 a(n) = 1 + a(n-8) for n>9.
%e A226581 a(17) = 8:
%e A226581 ._._._._._._._._._._._._._._._._._.
%e A226581 |               |       |         |
%e A226581 |               |       |         |
%e A226581 |               |       |         |
%e A226581 |               |_______|         |
%e A226581 |               |       |_________|
%e A226581 |               |       |     |   |
%e A226581 |               |       |     |___|
%e A226581 |_______________|_______|_____|_|_|
%p A226581 a:= n-> `if`(n=1, 8, iquo(n, 8, 'r') +[0, 6, 4, 5, 2, 5, 4, 7][r+1]):
%p A226581 seq(a(n), n=0..100);
%t A226581 LinearRecurrence[{1,0,0,0,0,0,0,1,-1},{0,8,4,5,2,5,4,7,1,7,5},80] (* _Harvey P. Dale_, Sep 07 2016 *)
%Y A226581 Row m=8 of A113881, A219158.
%K A226581 nonn,easy
%O A226581 0,2
%A A226581 _Alois P. Heinz_, Jun 12 2013