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 A118656 #5 Jun 14 2013 09:50:51 %S A118656 12,8,8,5,8,5,5,3,8,5,5,3,8,5,5,3,5,3,8,5,5,3,5,3,5,3,3 %N A118656 If C represents the minimum number of segments required to construct n unit cubes, then this sequence represents the number of additional segments required to construct n+1 unit cubes. First differences of sequence A117227. %e A118656 a(1)=12 because 12 segments are required to construct the first unit cube. a(2)=8 because 8 additional unit segments are required to construct two unit cubes. %Y A118656 Cf. A117227. %K A118656 easy,nonn %O A118656 1,1 %A A118656 _Ron R. King_, May 18 2006