%I A118015
%S A118015 0,0,0,1,3,5,7,9,12,16,20,24,28,33,39,45,51,57,64,72,80,88,96,105,115,
%T A118015 125,135,145,156,168,180,192,204,217,231,245,259,273,288,304,320,336,
%U A118015 352,369,387,405,423,441,460,480,500,520,540,561,583,605,627,649,672
%N A118015 [n^2/5].
%C A118015 It seems that for n>=5, a(n) = maximum number of non-overlapping 1x5 
               rectangles that can be packed into an n x n square. Rectangles can 
               only be placed parallel to the sides of the square. Verified with 
               http://lagrange.ime.usp.br/~lobato/packing/run/index.php [From Dmitry 
               Kamenetsky (dkamen(AT)rsise.anu.edu.au), Aug 03 2009]
%F A118015 G.f.: x^3*(1+x)/((1+x+x^2+x^3+x^4)*(1-x)^3). [From Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), 
               Nov 18 2008]
%F A118015 a(n)=A008732(n-4)+A008732(n-3). [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), 
               Nov 22 2008]
%o A118015 (MAGMA) [ n^2 div 5: n in [0..58] ]; [From Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), 
               Nov 18 2008]
%Y A118015 Cf. A000290, A007590, A000212, A002620, A056827, A118013.
%Y A118015 Sequence in context: A080751 A025218 A007078 this_sequence A122643 A096231 
               A100432
%Y A118015 Adjacent sequences: A118012 A118013 A118014 this_sequence A118016 A118017 
               A118018
%K A118015 nonn
%O A118015 0,5
%A A118015 Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Apr 10 2006