A360610 -id:A360610 - cp's OEIS frontend

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.

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, 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, 1331, 125, 27, 8, 8, 1, 1, 1, 1, 1, 1, 1728, 216, 64, 27, 8, 8, 1, 1, 1, 1, 1, 1

Offset: 1

Torlach Rush, Feb 17 2023

T(n,k) is a cube 1 <= k <= n.
Alternative construction: Write each column k with each cube repeated k times.
Row sums of triangle are A318742.

			Triangle begins:
   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;
 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;
1331, 125, 27,  8,  8,  1, 1, 1, 1, 1, 1;
1728, 216, 64, 27,  8,  8, 1, 1, 1, 1, 1, 1;
...

Cf. A000578, A318742, A360610.

Python
```
def T(n, k): return (n//k)**3
```

cp's OEIS Frontend

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.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Python