Your data matches 1 statistic following compositions of up to 3 maps.
(click to perform a complete search on your data)
St000137: Integer partitions ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1]
=> 1
[2]
=> 0
[1,1]
=> 0
[3]
=> 1
[2,1]
=> 1
[1,1,1]
=> 1
[4]
=> 0
[3,1]
=> 0
[2,2]
=> 2
[2,1,1]
=> 0
[1,1,1,1]
=> 0
[5]
=> 1
[4,1]
=> 1
[3,2]
=> 1
[3,1,1]
=> 1
[2,2,1]
=> 1
[2,1,1,1]
=> 1
[1,1,1,1,1]
=> 1
[6]
=> 0
[5,1]
=> 0
[4,2]
=> 0
[4,1,1]
=> 0
[3,3]
=> 2
[3,2,1]
=> 0
[3,1,1,1]
=> 0
[2,2,2]
=> 2
[2,2,1,1]
=> 0
[2,1,1,1,1]
=> 0
[1,1,1,1,1,1]
=> 0
[7]
=> 1
[6,1]
=> 1
[5,2]
=> 1
[5,1,1]
=> 1
[4,3]
=> 1
[4,2,1]
=> 1
[4,1,1,1]
=> 1
[3,3,1]
=> 3
[3,2,2]
=> 3
[3,2,1,1]
=> 1
[3,1,1,1,1]
=> 1
[2,2,2,1]
=> 1
[2,2,1,1,1]
=> 1
[2,1,1,1,1,1]
=> 1
[1,1,1,1,1,1,1]
=> 1
[8]
=> 0
[7,1]
=> 0
[6,2]
=> 0
[6,1,1]
=> 0
[5,3]
=> 0
[5,2,1]
=> 0
Description
The Grundy value of an integer partition. Consider the two-player game on an integer partition. In each move, a player removes either a box, or a 2x2-configuration of boxes such that the resulting diagram is still a partition. The first player that cannot move lose. This happens exactly when the empty partition is reached. The grundy value of an integer partition is defined as the grundy value of this two-player game as defined in [1]. This game was described to me during Norcom 2013, by Urban Larsson, and it seems to be quite difficult to give a good description of the partitions with Grundy value 0.