[go: up one dir, main page]

login
Search: a275432 -id:a275432
     Sort: relevance | references | number | modified | created      Format: long | short | data
Losing positions n (P-positions) in the following game: two players take turns dividing the current value of n by either a prime power > 1 or by A007947(n) to obtain the new value of n. The winner is the player whose division results in 1.
+10
0
1, 12, 18, 20, 28, 44, 45, 50, 52, 63, 68, 75, 76, 92, 98, 99, 116, 117, 120, 124, 147, 148, 153, 164, 168, 171, 172, 175, 188, 207, 212, 216, 236, 242, 244, 245, 261, 264, 268, 270, 275, 279, 280, 284, 292, 312, 316, 325, 332, 333, 338, 356, 363, 369, 378, 387, 388
OFFSET
1,2
COMMENTS
The game is equivalent to the game of Nim with the additional allowed move consisting of removing one object from each pile.
MATHEMATICA
Clear[moves, los]; A003557[n_]:= {Module[{aux = FactorInteger[n], L=Length[FactorInteger[n]]}, Product[aux[[i, 1]]^(aux[[i, 2]]-1), {i, L}]]};
moves[n_] :=moves[n] = Module[{aux = FactorInteger[n], L=Length[ FactorInteger [n]]}, Union[Flatten[Table[n/aux[[i, 1]]^j, {i, 1, L}, {j, 1, aux[[i, 2]]}], 1], A003557[n]]]; los[1]=True; los[m_] := los[m] = If[PrimeQ[m], False, Union@Flatten@Table[los[moves[m][[i]]], {i, 1, Length[moves[m]]}] == {False}]; Select[Range[400], los]
KEYWORD
nonn
AUTHOR
STATUS
approved

Search completed in 0.008 seconds