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.

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

This page as a plain text file.
%I A386847 #17 Aug 11 2025 10:33:11
%S A386847 0,0,1,3,10,19,30,44,64,84,100,141,150,202,218,279,282,382,365,478,
%T A386847 470,603,568,749,690,897,840,1066,980,1279,1151,1473,1357,1716,1552,
%U A386847 1988,1785,2265,2062,2573,2327,2947,2640,3296,3006,3718,3361,4182,3774,4659,4251
%N A386847 a(n) is the number of sets of distinct five-cuboid combinations that fill an n X n X n cube excluding combinations that contain strict cuboids.
%C A386847 A strict cuboid is a cuboid with all three dimensions different to each other.
%C A386847 Alternatively a(n) is number of ways to decompose (n,n,n) triplet into sets of distinct unordered geometrically feasible five triplets of the form (x,y,z) excluding x != y != z in any of the triplets.
%e A386847 (4,4,4) triplet can be decomposed into sets of five triplets in 31 different ways and only the following three sets do not contain strict cuboids:
%e A386847   {(1,1,1), (1,1,2), (1,1,4), (1,3,3), (3,4,4)},
%e A386847   {(1,1,1), (1,1,2), (1,3,3), (1,4,4), (3,3,4)},
%e A386847   {(1,1,3), (1,1,4), (1,3,3), (1,4,4), (2,4,4)}.
%Y A386847 Cf. A384479.
%K A386847 nonn
%O A386847 1,4
%A A386847 _Janaka Rodrigo_, Aug 05 2025
%E A386847 a(16)-a(39) from _Sean A. Irvine_, Aug 06 2025
%E A386847 More terms from _Jinyuan Wang_, Aug 10 2025