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 A288344 #24 Oct 02 2023 14:26:25
%S A288344 1,2,4,7,12,19,30,45,67,97,138,192,265,359,482,639,840,1092,1410,1803,
%T A288344 2291,2889,3621,4508,5584,6875,8424,10269,12463,15055,18115,21704,
%U A288344 25910,30814,36522,43137,50794,59618,69774,81422,94760,109984,127338,147058,169438
%N A288344 Expansion of 1 / ((1-x)^2*(1-x^2)*(1-x^3)*...*(1-x^9)).
%C A288344 Number of partitions of at most n into at most 9 parts.
%H A288344 Seiichi Manyama, <a href="/A288344/b288344.txt">Table of n, a(n) for n = 0..10000</a>
%H A288344 Richard J. Mathar, <a href="/A293482/a293482.pdf">Size of the Set of Residues of Integer Powers of Fixed Exponent</a>, research paper, 2017.
%H A288344 <a href="/index/Rec#order_46">Index entries for linear recurrences with constant coefficients</a>, signature (2, 0, -1, 0, -1, 1, -1, 1, 0, -1, 1, 2, -1, 0, 0, -1, -1, 0, 0, -1, 1, 0, 2, 0, 1, -1, 0, 0, -1, -1, 0, 0, -1, 2, 1, -1, 0, 1, -1, 1, -1, 0, -1, 0, 2, -1).
%o A288344 (PARI) x='x+O('x^99); Vec(1/((1-x)*prod(i=1, 9, (1-x^i)))) \\ _Altug Alkan_, Mar 28 2018
%Y A288344 Number of partitions of at most n into at most k parts: A002621 (k=4), A002622 (k=5), A288341 (k=6), A288342 (k=7), A288343 (k=8), this sequence (k=9), A288345 (k=10).
%Y A288344 Cf. A288256, A008638 (first differences).
%K A288344 nonn,easy
%O A288344 0,2
%A A288344 _Seiichi Manyama_, Jun 08 2017