%I #9 Mar 30 2012 16:52:03
%S 1,1,2,2,1,2,2,3,3,3,1,2,2,3,3,3,4,4,4,4,1,2,2,3,3,3,4,4,4,4,5,5,5,5,
%T 5,1,2,2,3,3,3,4,4,4,4,5,5,5,5,5,6,6,6,6,6,6,1,2,2,3,3,3,4,4,4,4,5,5,
%U 5,5,5,6,6,6,6,6,6,7,7,7,7,7,7,7,1,2,2,3,3,3,4,4,4,4,5,5,5,5,5,6,6,6,6,6,6,7,7,7,7,7,7,7,8,8,8,8,8,8,8,8,1,2,2
%N Write n = C(i,3)+C(j,2)+C(k,1) with i>j>k>=0; sequence gives j values.
%C See A194847.
%D D. E. Knuth, The Art of Computer Programming, vol. 4A, Combinatorial Algorithms, Section 7.2.1.3, Eq. (20), p. 360.
%F Equals A056557(n) + 1.
%p See A194847.
%Y The [i,j,k] values are [A194847, A194848, A056558].
%K nonn
%O 0,3
%A _N. J. A. Sloane_, Sep 03 2011