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.

Showing 1-2 of 2 results.

A387040 a(n) is the number of distinct five-cuboid combinations that fill an n X n X n cube with cuboids of different volumes.

Original entry on oeis.org

0, 0, 2, 26, 206, 442, 1531, 2661, 5574, 8514, 15614, 20331, 34500, 44814, 64503, 83143, 117759, 141290, 193436, 226722, 295978, 351953, 447208, 507508, 637447, 732322, 887044, 1001577, 1213233, 1337525, 1611692, 1786560, 2088648, 2321052, 2673275, 2929254, 3404667
Offset: 1

Views

Author

Janaka Rodrigo, Aug 14 2025

Keywords

Comments

Alternatively a(n) is the number of ways to decompose (n,n,n) triplet into geometrically feasible five distinct unordered triplets of the form (x,y,z) with no pair having equal value for the product x*y*z.

Examples

			According to A384479(5), (5,5,5) triplet can be decomposed into 209 distinct sets of five triplets and only three of them contain pair of triplets with equal value for x*y*z. Those are,
   {(1,2,5), (1,3,5), (1,4,5), (2,2,5), (3,4,5)},
   {(1,1,5), (1,4,5), (2,2,5), (2,3,5), (2,5,5)},
   {(1,3,5), (1,4,5), (2,2,5), (2,3,5), (2,4,5)}.
Therefore a(5) = 209-3 = 206.
		

Crossrefs

Extensions

a(15)-a(16) from Sean A. Irvine, Aug 19 2025
More terms from Jinyuan Wang, Aug 29 2025

A387121 Array read by antidiagonals: T(n,k) is the number of sets of k integer sided cuboids with distinct volumes that fill an n X n X n cube.

Original entry on oeis.org

1, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 0, 2, 1, 1, 0, 0, 4, 3, 2, 1, 0, 0, 2, 11, 8, 2, 1, 0, 0, 1, 26, 47, 11, 3, 1, 0, 0, 0, 55, 206, 77, 19, 3, 1, 0, 0, 0, 48, 793, 442, 183, 23, 4, 1, 0, 0, 0, 23, 2653, 2451, 1531, 259, 35, 4, 1, 0, 0, 0, 0, 6706, 13022, 12178
Offset: 1

Views

Author

Janaka Rodrigo, Aug 16 2025

Keywords

Comments

The partitions here must be valid packings of the n X n X n cube, hence T(n,k) is generally less than the number of partitions of n^3 into distinct cuboids (x,y,z) with 1 <= x,y,z <= n and no pair of triplets having equal volume x*y*z.

Examples

			Array begins:
  1     0     0     0     0
  1     0     0     0     0
  1     1     2     4     2
  1     1     3    11    26
  1     2     8    47   206
  1     2    11    77   442
  1     3    19   183  1531
  1     3    23   259  2661
  1     4    35   457  5574
  1     4    40   599  8514
  ...
		

Crossrefs

Columns are A004526 (k=2), A381847 (k=3), A385580 (k=4), A387040 (k=5).

Formula

T(n,1) = 1, T(n,k) = 0 for k > n^3.

Extensions

More terms from Sean A. Irvine, Aug 25 2025
Showing 1-2 of 2 results.