%I A053603
%S A053603 0,0,1,0,2,0,1,2,0,2,0,2,1,2,0,0,4,0,2,0,1,2,2,0,2,2,0,2,0,2,1,
%T A053603 4,0,0,2,0,2,2,2,2,0,0,3,2,0,0,4,0,2,2,0,4,0,0,0,2,3,2,2,0,2,2,
%U A053603 0,0,2,2,2,2,0,2,2,0,3,2,0,0,4,0,0,2,0,6,0,2,2,0,0,2,2,0,1,2,2
%N A053603 Number of ways to write n as an ordered sum of two nonzero triangular 
               numbers.
%Y A053603 Cf. A000217, A007294, A051611, A051533, A052343-A052348, A053604.
%Y A053603 Sequence in context: A096397 A103919 A035445 this_sequence A085794 A004548 
               A125921
%Y A053603 Adjacent sequences: A053600 A053601 A053602 this_sequence A053604 A053605 
               A053606
%K A053603 nonn
%O A053603 0,5
%A A053603 N. J. A. Sloane (njas(AT)research.att.com), Jan 20 2000