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 A358877 #38 Feb 19 2023 17:15:13 %S A358877 1,8,1,27,1,1,64,8,1,1,125,8,1,1,1,216,27,8,1,1,1,343,27,8,1,1,1,1, %T A358877 512,64,8,8,1,1,1,1,729,64,27,8,1,1,1,1,1,1000,125,27,8,8,1,1,1,1,1, %U A358877 1331,125,27,8,8,1,1,1,1,1,1,1728,216,64,27,8,8,1,1,1,1,1,1 %N A358877 Triangle read by rows: T(n,k) is the number of cubes of side length k that can be placed inside a cube of side length n without overlap, 1 <= k <= n. %C A358877 T(n,k) is a cube 1 <= k <= n. %C A358877 Alternative construction: Write each column k with each cube repeated k times. %C A358877 Row sums of triangle are A318742. %e A358877 Triangle begins: %e A358877 1; %e A358877 8, 1; %e A358877 27, 1, 1; %e A358877 64, 8, 1, 1; %e A358877 125, 8, 1, 1, 1; %e A358877 216, 27, 8, 1, 1, 1; %e A358877 343, 27, 8, 1, 1, 1, 1; %e A358877 512, 64, 8, 8, 1, 1, 1, 1; %e A358877 729, 64, 27, 8, 1, 1, 1, 1, 1; %e A358877 1000, 125, 27, 8, 8, 1, 1, 1, 1, 1; %e A358877 1331, 125, 27, 8, 8, 1, 1, 1, 1, 1, 1; %e A358877 1728, 216, 64, 27, 8, 8, 1, 1, 1, 1, 1, 1; %e A358877 ... %o A358877 (Python) %o A358877 def T(n, k): return (n//k)**3 %Y A358877 Cf. A000578, A318742, A360610. %K A358877 nonn,tabl %O A358877 1,2 %A A358877 _Torlach Rush_, Feb 17 2023