# Greetings from The On-Line Encyclopedia of Integer Sequences! https://backiee.wasmer.app/https_oeis_org/

Search: id:a034150
Showing 1-1 of 1

%I A034150 #23 May 28 2025 19:30:13
%S A034150 1,1,1,2,2,3,4,5,6,8,10,12,15,18,22,27,32,38,46,54,64,75,87,101,117,
%T A034150 135,155,178,203,231,263,297,335,378,424,475,531,591,657,729,806,889,
%U A034150 980,1076,1180,1293,1411,1538,1674
%N A034150 Number of partitions of n into distinct parts from [1, 20].
%D A034150 Mohammad K. Azarian, A Generalization of the Climbing Stairs Problem, Mathematics and Computer Education, Vol. 31, No. 1, pp. 24-28, Winter 1997. MathEduc Database (Zentralblatt MATH, 1997c.01891). - _Mohammad K. Azarian_, Aug 22 2010
%H A034150 Mohammad K. Azarian, <a href="http://cs.ucmo.edu/~mjms/2004.1/azar6.pdf">A Generalization of the Climbing Stairs Problem II</a>, Missouri Journal of Mathematical Sciences, Vol. 16, No. 1, Winter 2004, pp. 12-17. Zentralblatt MATH, Zbl 1071.05501. - _Mohammad K. Azarian_, Aug 22 2010
%F A034150 G.f.: (1+x)*(1+x^2)*(1+x^3)*...*(1+x^20).
%o A034150 (PARI) a(n) = polcoeff(prod(k=1, 20, 1 + x^k), n); \\ _Michel Marcus_, Mar 07 2015
%K A034150 nonn
%O A034150 0,4
%A A034150 _N. J. A. Sloane_

# Content is available under The OEIS End-User License Agreement: https://backiee.wasmer.app/https_oeis_org/LICENSE