%I A000716 M2788 N1123
%S A000716 1,3,9,22,51,108,221,429,810,1479,2640,4599,7868,13209,21843,
%T A000716 35581,57222,90882,142769,221910,341649,521196,788460,1183221,
%U A000716 1762462,2606604,3829437,5590110,8111346,11701998,16790136
%N A000716 Number of partitions of n into parts of 3 kinds.
%C A000716 A000712: (1, 2, 5, 10, 20, 36,...) = A000716 convolved with A010815. 
               [From Gary W. Adamson (qntmpkt(AT)yahoo.com), Oct 26 2008]
%D A000716 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, 
               Academic Press, 1995 (includes this sequence).
%D A000716 N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 
               (includes this sequence).
%D A000716 H. Gupta et al., Tables of Partitions. Royal Society Mathematical Tables, 
               Vol. 4, Cambridge Univ. Press, 1958, p. 122.
%H A000716 T. D. Noe, <a href="b000716.txt">Table of n, a(n) for n=0..500</a>
%H A000716 <a href="Sindx_Pro.html#1mxtok">Index entries for expansions of Product_{k 
               >= 1} (1-x^k)^m</a>
%H A000716 INRIA Algorithms Project, <a href="http://algo.inria.fr/bin/encyclopedia?Search=ECSnb&argsearch=391">
               Encyclopedia of Combinatorial Structures 391</a>
%H A000716 N. J. A. Sloane, <a href="transforms.txt">Transforms</a>
%F A000716 G.f.: Product_{m>=1} 1/(1-x^m)^3.
%F A000716 EULER transform of 3, 3, 3, 3, 3, 3, 3, 3...
%o A000716 (PARI) \ps100 for(n=0,100,print1((polcoeff(1/eta(x)^3,n,x)),","))
%Y A000716 Cf. A000713.
%Y A000716 A000712, A010815 [From Gary W. Adamson (qntmpkt(AT)yahoo.com), Oct 26 
               2008]
%Y A000716 Sequence in context: A143099 A000711 A121589 this_sequence A001628 A099166 
               A054442
%Y A000716 Adjacent sequences: A000713 A000714 A000715 this_sequence A000717 A000718 
               A000719
%K A000716 nonn
%O A000716 0,2
%A A000716 N. J. A. Sloane (njas(AT)research.att.com).
%E A000716 Extended with formula from Christian G. Bower (bowerc(AT)usa.net), Apr 
               15 1998.