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 A061197 #7 Jan 24 2023 21:15:06 %S A061197 1,0,1,0,1,1,0,1,1,1,0,0,2,1,1,0,0,1,2,1,1,0,0,2,2,2,1,1,0,0,1,3,2,2, %T A061197 1,1,0,0,1,3,4,2,2,1,1,0,0,0,3,4,4,2,2,1,1,0,0,0,3,5,5,4,2,2,1,1,0,0, %U A061197 0,3,5,6,5,4,2,2,1,1,0,0,0,2,7,7,7,5,4,2,2,1,1,0,0,0,2,6,9,8,7,5,4,2,2,1,1 %N A061197 Table by antidiagonals T(n,k) of number of partitions of k where the largest part is less than or equal to n and where there are no more than two of any particular sized part. %F A061197 T(n, k) = T(n-1, k) + T(n-1, k-n) + T(n-1, k-2*n) with T(0, 0)=1 and T(n, k)=0 if n or k are negative. [Corrected by _Sean A. Irvine_, Jan 24 2023] %e A061197 Table begins: %e A061197 1, 0, 0, 0, 0, 0, ..., %e A061197 1, 1, 1, 0, 0, 0, ..., %e A061197 1, 1, 2, 1, 2, 1, ..., %e A061197 1, 1, 2, 2, 3, 3, ..., %e A061197 ... %e A061197 T(3,5)=3 since 5 can be written as 3+2 or 3+1+1 or 2+2+1. %Y A061197 Main diagonal is A000726. %K A061197 nonn,tabl %O A061197 0,13 %A A061197 _Henry Bottomley_, Apr 20 2001