A034136 - OEIS

%I #14 May 28 2025 19:30:41

%S 1,1,1,2,2,3,4,4,4,5,5,5,5,4,4,4,3,2,2,1,1,1,0,0,0,0,0,0,0,0,0,0,0,0,

%T 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,

%U 0,0,0,0,0,0,0,0,0,0,0,0,0

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

%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^6).

%Y Cf. A000009, A034137-A034150.

%K nonn

%O 0,4

%A _N. J. A. Sloane_