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 A260411 #4 Aug 13 2015 03:52:42 %S A260411 0,0,0,1,0,1,1,0,2,0,1,2,2,2,0,3,1,1,3,1,4,0,1,3,1,2,1,5,0,2,3,2,4,2, %T A260411 4,0,2,3,6,3,2,3,1,3,1,5,4,4,2,2,2,2,3,5,4,2,2,3,4,2,4,1,4,1,5,4,3,4, %U A260411 3,4,0,7,5,5,2,4,3,1,7,4,5,3,3,8,1,2,6,2,6,2,5 %N A260411 Number of ways n can be represented as a sum of a positive cube, a positive square, and a positive triangular number. %C A260411 Indices of zeros: A115162. %C A260411 It appears that there are 14 zeros and 33 ones. Conjecture: every integer appears in the sequence finitely many times. %e A260411 8 = 1 + 1 + 6 = 1 + 4 + 3, two representations, so a(8)=2. %Y A260411 Cf. A115162. %K A260411 nonn %O A260411 0,9 %A A260411 _Alex Ratushnyak_, Jul 24 2015