A034141 - OEIS

%I #15 May 28 2025 19:32:20

%S 1,1,1,2,2,3,4,5,6,8,10,12,14,16,19,22,25,28,32,35,39,43,46,49,53,56,

%T 59,62,64,66,68,69,69,70,69,69,68,66,64,62,59,56,53,49,46,43,39,35,32,

%U 28,25,22,19,16,14,12,10,8,6

%N Number of partitions of n into distinct parts from [1, 11].

%D Mohammad K. Azarian, A Generalization of the Climbing Stairs Problem II, 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

%D 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

%F G.f.: (1+x)*(1+x^2)*(1+x^3)*...*(1+x^11).

%t CoefficientList[Series[Times@@(1+x^Range[11]),{x,0,60}],x] (* _Harvey P. Dale_, Jul 10 2012 *)

%K nonn

%O 0,4

%A _N. J. A. Sloane_