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.
%I A117227 #7 Jun 19 2013 13:55:28 %S A117227 12,20,28,33,41,46,51,54,62,67,72,75,83,88,93,96,101,104,112,117,122, %T A117227 125,130,133,138,141,144 %N A117227 Minimum number of unit segments required to construct n unit cubes. %C A117227 This generalizes the 2-dimensional version which is A078633. %e A117227 a(2)=20 because 12 unit segments are required to construct each cube but 4 units are shared. I.e., a(2)=12+8=20. %Y A117227 Cf. A078633. %K A117227 easy,nonn %O A117227 1,1 %A A117227 _Ron R. King_, Apr 22 2006