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 A060026 #18 Oct 01 2023 13:02:27
%S A060026 1,0,1,1,2,2,4,3,5,5,7,6,9,6,8,5,5,-1,-2,-13,-18,-33,-45,-68,-86,-121,
%T A060026 -151,-198,-244,-310,-373,-464,-553,-671,-793,-948,-1107,-1309,-1517,
%U A060026 -1771,-2039,-2360,-2696,-3098,-3519,-4011,-4534,-5137,-5774,-6508,-7283,-8163,-9099,-10153,-11269
%N A060026 Expansion of (1-x-x^N)/((1-x)(1-x^2)(1-x^3)...(1-x^N)) for N = 7.
%C A060026 Difference of the number of partitions of n+6 into 6 parts and the number of partitions of n+6 into 7 parts. - _Wesley Ivan Hurt_, Apr 16 2019
%H A060026 Ray Chandler, <a href="/A060026/b060026.txt">Table of n, a(n) for n = 0..1000</a>
%H A060026 P. A. MacMahon, <a href="https://doi.org/10.1112/plms/s1-17.1.139">Perpetual reciprocants</a>, Proc. London Math. Soc., 17 (1886), 139-151; Coll. Papers II, pp. 584-596.
%H A060026 <a href="/index/Par#part">Index entries for sequences related to partitions</a>
%H A060026 <a href="/index/Rec#order_28">Index entries for linear recurrences with constant coefficients</a>, signature (1, 1, 0, 0, -1, 0, -1, -1, 0, 1, 1, 2, 0, 0, 0, -2, -1, -1, 0, 1, 1, 0, 1, 0, 0, -1, -1, 1).
%F A060026 a(n) = A026812(n+6) - A026813(n+6). - _Wesley Ivan Hurt_, Apr 16 2019
%t A060026 With[{nn=7},CoefficientList[Series[(1-x-x^nn)/Times@@(1-x^Range[nn]),{x,0,60}],x]] (* _Harvey P. Dale_, May 15 2016 *)
%Y A060026 Cf. A026812, A026813.
%Y A060026 Cf. For other values of N: A060022 (N=3), A060023 (N=4), A060024 (N=5), A060025 (N=6), this sequence (N=7), A060027 (N=8), A060028 (N=9), A060029 (N=10).
%K A060026 sign,easy
%O A060026 0,5
%A A060026 _N. J. A. Sloane_, Mar 17 2001