A381847 a(n) is the number of ways to partition an n X n X n cube into 3 noncongruent cuboids.
0, 0, 2, 3, 8, 11, 19, 23, 35, 40, 55, 62, 80, 88, 110, 119, 144, 155, 183, 195, 227, 240, 275, 290, 328, 344, 386, 403, 448, 467, 515, 535, 587, 608, 663, 686, 744, 768, 830, 855, 920, 947, 1015, 1043, 1115, 1144, 1219, 1250, 1328, 1360, 1442, 1475, 1560
Offset: 1
Examples
(1,1,1) and (2,2,2) cannot be decomposed in three distinct triplets giving first two terms; a(1) = a(2) = 0. (3,3,3) can be decomposed into two triplets (3,3,2), (3,3,1) by applying the rule and repeat the process for one the triplets at a time for obtaining the following two sets: {(3,3,2), (3,2,1), (3,1,1)}, {(3,3,1), (3,2,2), (3,2,1)}. Therefore, a(3) = 2.
Links
- Sean A. Irvine, Java program (github)
- Index entries for linear recurrences with constant coefficients, signature (0,2,1,-1,-2,0,1).
Formula
G.f.: x^3*(2+3*x+4*x^2+3*x^3+2*x^4)/((1+x+x^2)*(1+x)^2*(1-x)^3). - Jinyuan Wang, Aug 03 2025
Extensions
More terms from Sean A. Irvine, May 11 2025
Comments