a(n) is the number of sets of distinct four-cuboid combinations that fill an n X n X n cube excluding combinations that contain cube-shaped cuboids.

A386756

a(n) is the number of sets of distinct four-cuboid combinations that fill an n X n X n cube excluding combinations that contain cube-shaped cuboids.

Terms

    a(0) =0a(1) =0a(2) =2a(3) =10a(4) =43a(5) =81a(6) =177a(7) =260a(8) =458a(9) =605a(10) =931a(11) =1169a(12) =1656a(13) =1995a(14) =2687a(15) =3145a(16) =4063a(17) =4674a(18) =5850a(19) =6617a(20) =8102a(21) =9044a(22) =10852a(23) =12008a(24) =14172a(25) =15540a(26) =18116a(27) =19714a(28) =22711a(29) =24585

External references