%I A001312
%S A001312 1,1,2,2,3,4,5,6,7,8,11,12,15,16,19,22,25,28,31,34,40,43,
%T A001312 49,52,58,64,70,76,82,88,98,104,114,120,130,140,150,160,
%U A001312 170,180,195,205,220,230,245,260,275,290,305,320,342,357
%N A001312 Number of ways of making change for n cents using coins of 1, 2, 5, 10, 
               50, 100 cents.
%D A001312 R. L. Graham, D. E. Knuth and O. Patashnik, Concrete Mathematics. Addison-Wesley, 
               Reading, MA, 1990, p. 316.
%D A001312 G. P\'{o}lya and G. Szeg\"{o}, Problems and Theorems in Analysis, Springer-Verlag, 
               NY, 2 vols., 1972, Vol. 1, p. 1.
%H A001312 H. Bottomley, <a href="a8.gif">Initial terms of A000008, A001301, A001302, 
               A001312, A001313</a>
%H A001312 INRIA Algorithms Project, <a href="http://algo.inria.fr/bin/encyclopedia?Search=ECSnb&argsearch=181">
               Encyclopedia of Combinatorial Structures 181</a>
%H A001312 <a href="Sindx_Mag.html#change">Index entries for sequences related to 
               making change.</a>
%p A001312 1/(1-x)/(1-x^2)/(1-x^5)/(1-x^10)/(1-x^50)/(1-x^100)
%t A001312 a[n_] := SeriesTerm[1/((1 - x)(1 - x^2)(1 - x^5)(1 - x^10)(1 - x^50)(1 
               - x^100)), {x, 0, n}]
%Y A001312 Sequence in context: A121385 A029015 A000008 this_sequence A001301 A001302 
               A001313
%Y A001312 Adjacent sequences: A001309 A001310 A001311 this_sequence A001313 A001314 
               A001315
%K A001312 nonn,easy
%O A001312 0,3
%A A001312 N. J. A. Sloane (njas(AT)research.att.com).