cp's OEIS Frontend

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.

A115723 Table of partitions of n with maximum rectangle k.

This page as a plain text file.
%I A115723 #17 Feb 16 2025 08:33:00
%S A115723 1,0,2,0,1,2,0,0,2,3,0,0,1,4,2,0,0,0,5,2,4,0,0,0,3,4,6,2,0,0,0,1,4,11,
%T A115723 2,4,0,0,0,0,3,14,4,6,3,0,0,0,0,1,15,6,12,4,4,0,0,0,0,0,13,8,18,9,6,2,
%U A115723 0,0,0,0,0,8,10,25,14,12,2,6,0,0,0,0,0,4,9,30,22,20,4,10,2
%N A115723 Table of partitions of n with maximum rectangle k.
%C A115723 T(n,k)=0 if n > A006218(k).
%H A115723 Alois P. Heinz, <a href="/A115723/b115723.txt">Rows n = 1..141, flattened</a>
%H A115723 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/FerrersDiagram.html">Ferrers Diagram.</a>
%F A115723 Sum_{k=1..n} k * T(n,k) = A182099(n).
%e A115723 The table starts:
%e A115723   1;
%e A115723   0, 2;
%e A115723   0, 1, 2;
%e A115723   0, 0, 2, 3;
%e A115723   0, 0, 1, 4, 2;
%e A115723   0, 0, 0, 5, 2,  4;
%e A115723   0, 0, 0, 3, 4,  6, 2;
%e A115723   0, 0, 0, 1, 4, 11, 2,  4;
%e A115723   0, 0, 0, 0, 3, 14, 4,  6, 3;
%e A115723   0, 0, 0, 0, 1, 15, 6, 12, 4, 4;
%e A115723   ...
%Y A115723 Cf. A000005 (diagonal), A000041 (row sums), A061017 (column indices of leftmost nonzero elements), A115724 (column sums), A115727, A115728, A006218, A182099.
%K A115723 nonn,tabl,look
%O A115723 1,3
%A A115723 _Franklin T. Adams-Watters_, Mar 11 2006