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