The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A119466 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 z values. 6
 0, 1, 2, 3, 3, 4, 5, 5, 6, 6, 7, 7, 7, 7, 6, 8, 9, 9, 10, 10, 11, 11, 11, 11, 10, 12, 12, 13, 13, 13, 13, 12, 14, 14, 14, 14, 12, 15, 15, 15, 15, 14, 15, 15, 14, 15, 13, 15, 14, 13, 12, 16, 17, 17, 18, 18, 19, 19, 19, 19, 18, 20, 20, 21, 21, 21, 21, 20, 22, 22, 22, 22, 20, 23, 23 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 COMMENTS Thanks to Ray Chandler for help in clarifying the relation between this sorted list and the one in A080595. LINKS EXAMPLE The triples with sum <= 20 (this sequence is the third column) are: 0 0 0 0 1 1 0 2 2 0 3 3 1 2 3 0 4 4 0 5 5 1 4 5 0 6 6 2 4 6 0 7 7 1 6 7 2 5 7 3 4 7 3 5 6 0 8 8 0 9 9 1 8 9 0 10 10 CROSSREFS A119464, A119465 give the x and y values; A080593, A080594, A080595 give the same values sorted in a different way. Sequence in context: A123579 A166493 A005185 * A100922 A047785 A027923 Adjacent sequences:  A119463 A119464 A119465 * A119467 A119468 A119469 KEYWORD easy,nonn AUTHOR Joshua Zucker, May 21 2006 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified January 17 09:54 EST 2020. Contains 330949 sequences. (Running on oeis4.)