%I A001304
%S A001304 1,2,4,6,9,13,18,24,31,39,49,60,73,87,103,121,141,163,187,
%T A001304 213,242,273,307,343,382,424,469,517,568,622,680,741,806,
%U A001304 874,946,1022,1102,1186,1274,1366,1463,1564,1670,1780,1895
%N A001304 Expansion of 1/((1-x)^2*(1-x^2)*(1-x^5)).
%C A001304 Ways of making change for n cents using coins of 1, 2 and 5 cents, if 
               two different kinds of 1-cent coin are counted as different. - Matthew 
               Vandermast (ghodges14(AT)comcast.net), Feb 27 2003
%D A001304 L. Comtet, Advanced Combinatorics, Reidel, 1974, p. 113, Example (2), 
               D(n; 1,2,4,10).
%H A001304 INRIA Algorithms Project, <a href="http://algo.inria.fr/bin/encyclopedia?Search=ECSnb&argsearch=198">
               Encyclopedia of Combinatorial Structures 198</a>
%p A001304 1/(1-x)^2/(1-x^2)/(1-x^5)
%p A001304 a:= proc(n) local m, r; m := iquo (n, 10, 'r'); r:= r+1; (53+ (135+ 100*m) 
               *m) *m/6+ [1, 2, 4, 6, 9, 13, 18, 24, 31, 39][r]+ [0, 5, 11, 18, 
               26, 35, 45, 56, 68, 81][r]*m+ (r-1)*5 *m^2 end: seq (a(n), n=0..100); 
               [From Alois P. Heinz (heinz(AT)hs-heilbronn.de), Oct 05 2008]
%Y A001304 First differences are in A000115.
%Y A001304 Sequence in context: A006697 A079717 A114830 this_sequence A000064 A001305 
               A088575
%Y A001304 Adjacent sequences: A001301 A001302 A001303 this_sequence A001305 A001306 
               A001307
%K A001304 nonn
%O A001304 0,2
%A A001304 N. J. A. Sloane (njas(AT)research.att.com).