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 A227588 #23 Dec 02 2024 16:31:50 %S A227588 1,1,1,1,2,1,1,3,2,1,1,4,4,2,1,1,5,7,5,2,1,1,6,12,12,6,2,1,1,7,18,24, %T A227588 16,7,2,1,1,8,26,46,42,23,8,2,1,1,9,35,83,101,73,29,9,2,1 %N A227588 Maximum label within a minimal labeling of k >= 0 identical n-sided dice (n >= 1) yielding the most possible sums; square array A(n,k), read by antidiagonals. %H A227588 The <a href="https://research.ibm.com/haifa/ponderthis/challenges/July2013.html">IBM Ponder This July 2013</a> challenge asks for A(8,3). %e A227588 Three tetrahedra labeled (1, 2, 8, 12) yield the 20 possible sums 3, 4, 5, 6, 10, 11, 12, 14, 15, 16, 17, 18, 21, 22, 24, 25, 26, 28, 32, 36. No more sums can be obtained by different labelings, and no labeling with labels < 12 yields 20 possible sums. Therefore A(4,3) = 12. %e A227588 Square array A(n,k) begins: %e A227588 1, 1, 1, 1, 1, 1, 1, 1, ... %e A227588 1, 2, 2, 2, 2, 2, 2, ... %e A227588 1, 3, 4, 5, 6, 7, ... %e A227588 1, 4, 7, 12, 16, ... %e A227588 1, 5, 12, 24, ... %e A227588 1, 6, 18, ... %e A227588 1, 7, ... %e A227588 1, ... %Y A227588 Cf. A227589, A227590, A227358. %K A227588 nonn,tabl,more %O A227588 1,5 %A A227588 _Jens Voß_, Jul 17 2013