cp's OEIS Frontend

A119464 Consider the standard game of Nim with 3 heaps and make a list of the losing positions (x,y,z) with x <= y <= z sorted by sum, ties broken by putting smallest value of x first, then y, then z; sequence gives x values.

%I A119464 #4 Mar 30 2012 17:36:54
%S A119464 0,0,0,0,1,0,0,1,0,2,0,1,2,3,3,0,0,1,0,2,0,1,2,3,3,0,4,0,1,4,5,5,0,2,
%T A119464 4,6,6,0,1,2,3,3,4,5,5,6,6,7,7,7,7,0,0,1,0,2,0,1,2,3,3,0,4,0,1,4,5,5,
%U A119464 0,2,4,6,6,0,1,2,3,3,4,5,5,6,6,7,7,7,7,0,8,0,1,8,9,9,0,2,8,10,10,0,1,2,3,3
%N A119464 Consider the standard game of Nim with 3 heaps and make a list of the losing positions (x,y,z) with x <= y <= z sorted by sum, ties broken by putting smallest value of x first, then y, then z; sequence gives x values.
%C A119464 Thanks to _Ray Chandler_ for help in clarifying the relation between this sorted list and the one in A080593.
%e A119464 The triples with sum <= 20 (this sequence is the first column) are:
%e A119464 0 0 0
%e A119464 0 1 1
%e A119464 0 2 2
%e A119464 0 3 3
%e A119464 1 2 3
%e A119464 0 4 4
%e A119464 0 5 5
%e A119464 1 4 5
%e A119464 0 6 6
%e A119464 2 4 6
%e A119464 0 7 7
%e A119464 1 6 7
%e A119464 2 5 7
%e A119464 3 4 7
%e A119464 3 5 6
%e A119464 0 8 8
%e A119464 0 9 9
%e A119464 1 8 9
%e A119464 0 10 10
%Y A119464 Cf. A119465, A119466 give the y and z values; A080593, A080594, A080595 give the same values sorted in a different way.
%K A119464 easy,nonn
%O A119464 1,10
%A A119464 _Joshua Zucker_, May 21 2006