This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A034139 #13 May 28 2025 19:29:47 %S A034139 1,1,1,2,2,3,4,5,6,8,9,10,12,13,15,17,18,19,21,21,22,23,23,23,23,22, %T A034139 21,21,19,18,17,15,13,12,10,9,8,6,5,4,3,2,2,1,1,1,0,0,0,0,0,0,0,0,0,0, %U A034139 0,0,0,0,0,0,0,0,0,0,0,0,0,0 %N A034139 Number of partitions of n into distinct parts from [1, 9]. %D A034139 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 A034139 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 A034139 G.f.: (1+x)*(1+x^2)*(1+x^3)*...*(1+x^9). %K A034139 nonn %O A034139 0,4 %A A034139 _N. J. A. Sloane_