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 A288000 #15 Jan 26 2021 03:51:11 %S A288000 1,1,1,2,2,3,4,5,6,8,10,12,15,18,22,27,32,38,46,53,63,74,86,100,116, %T A288000 134,154,178,203,232,265,301,341,387,436,492,554,621,696,779,870,969, %U A288000 1080,1199,1331,1476,1632,1803,1991,2193,2414,2655,2914,3196,3502,3832 %N A288000 Expansion of 1/((1-x)(1-x^3)(1-x^5) ... (1-x^17)). %C A288000 Number of partitions of n into odd parts less than or equal to 17. %C A288000 Number of partitions (d1,d2,...,d9) of n such that 0 <= d1/1 <= d2/2 <= ... <= d9/9. %H A288000 Seiichi Manyama, <a href="/A288000/b288000.txt">Table of n, a(n) for n = 0..10000</a> %H A288000 <a href="/index/Rec#order_81">Index entries for linear recurrences with constant coefficients</a>, signature (1, 0, 1, -1, 1, -1, 1, -2, 2, -2, 2, -3, 3, -3, 4, -5, 5, -5, 5, -6, 7, -6, 7, -8, 9, -8, 9, -10, 10, -10, 10, -12, 12, -11, 11, -13, 12, -12, 12, -13, 13, -12, 12, -12, 13, -11, 11, -12, 12, -10, 10, -10, 10, -9, 8, -9, 8, -7, 6, -7, 6, -5, 5, -5, 5, -4, 3, -3, 3, -2, 2, -2, 2, -1, 1, -1, 1, -1, 0, -1, 1). %Y A288000 Cf. A259094. %K A288000 nonn %O A288000 0,4 %A A288000 _Seiichi Manyama_, Jun 04 2017