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 A161364 #5 Jun 02 2025 01:43:51 %S A161364 1,1,0,2,0,0,2,1,0,0,4,1,0,0,0,3,2,2,0,0,0,7,2,2,0,0,0,0,7,3,2,3,0,0, %T A161364 0,0,12,3,4,3,0,0,0,0,0,13,5,4,3,5,0,0,0,0,0,22,6,6,3,5,0,0,0,0,0,0,2, %U A161364 5,7,6,6,5,7,0,0,0,0,0,0,4,9,8,6,5,7,0,0,0,0,0,0,0 %N A161364 Triangle read by rows, modified version of A161363; row sums = A000041. %C A161364 Row sums = A000041, the partition numbers. %F A161364 Given triangle A161363, (the inverse of partition triangle A026794); multiply by (-1), delete right border of 1's, and shift down 1 row inserting a "1" at T(0,0); = triangle M. Let Q = an infinite lower triangular matrix with A000041 as the right border and the rest zeros. Triangle A161364 = M * Q. %e A161364 First few rows of the triangle = %e A161364 1; %e A161364 1, 0; %e A161364 2, 0, 0; %e A161364 2, 1, 0, 0; %e A161364 4, 1, 0, 0, 0; %e A161364 3, 2, 2, 0, 0, 0; %e A161364 7, 2, 2, 0, 0, 0, 0; %e A161364 7, 3, 2, 3, 0, 0, 0, 0; %e A161364 12, 3, 4, 3, 0, 0, 0, 0, 0; %e A161364 13, 5, 4, 3, 5, 0, 0, 0, 0, 0; %e A161364 22, 6, 6, 3, 5, 0, 0, 0, 0, 0, 0; %e A161364 25, 7, 6, 6, 5, 7, 0, 0, 0, 0, 0, 0; %e A161364 42, 9, 8, 6, 5, 7, 0, 0, 0, 0, 0, 0, 0; %e A161364 48, 13, 8, 9, 5, 7, 11, 0, 0, 0, 0, 0, 0, 0; %e A161364 ... %Y A161364 A161363, A000041 %K A161364 nonn,tabl %O A161364 0,4 %A A161364 _Gary W. Adamson_, Jun 07 2009