%I #16 Jun 17 2019 02:17:05
%S 0,1,0,0,1,0,1,0,1,0,0,1,0,1,0,1,0,1,2,1,0,1,1,0,1,2,1,0,1,0,1,0,1,2,
%T 1,0,0,1,0,1,0,1,2,1,0,1,0,1,0,1,0,1,2,1,0,0,1,0,1,0,1,0,1,2,1,0,1,0,
%U 1,0,1,0,1,2,1,2,1,0,0,1,0,1,0,1,0,1,2,1,2,1,0,1,0,1,0,1,0,1,0,1,2,1,2,1,0,0,1,0,1,0,1,0,1,0,1,2,1,2,1,0,1,0,1,0,1,0,1,0,1,0,1,2,1,2,1
%N Irregular triangle read by rows: T(n,k) (n>=1, 0<=k<=n) gives winning pair of moves for the game of Concentration if there are n pairs of cards and k cards have been flipped, using 0 for NN, 1 for NO, and 2 for OO.
%D Ian Stewart, Concentration: A Winning Strategy, Mathematical Recreations Column, Scientific American, Vol. 265 (No. 4, Oct 1991), pp. 126-128.
%H Ian Stewart, <a href="/A299908/a299908.png">Concentration: A Winning Strategy</a>, Mathematical Recreations Column, Scientific American, Vol. 265 (No. 4, Oct 1991), pp. 126-128. [Annotated scan of just page 128]
%H Uri Zwick and Michael S. Paterson, <a href="https://doi.org/10.1016/0304-3975(93)90355-W">The memory game</a>, Theoretical Computer Science 110.1 (1993): 169-196.
%e Triangle begins:
%e 0,1,
%e 0,0,1,
%e 0,1,0,1,
%e 0,0,1,0,1,
%e 0,1,0,1,2,1,
%e 0,1,1,0,1,2,1,
%e 0,1,0,1,0,1,2,1,
%e 0,0,1,0,1,0,1,2,1,
%e 0,1,0,1,0,1,0,1,2,1,
%e 0,0,1,0,1,0,1,0,1,2,1,
%e 0,1,0,1,0,1,0,1,2,1,2,1,
%e 0,0,1,0,1,0,1,0,1,2,1,2,1,
%e 0,1,0,1,0,1,0,1,0,1,2,1,2,1,
%e 0,0,1,0,1,0,1,0,1,0,1,2,1,2,1,
%e 0,1,0,1,0,1,0,1,0,1,0,1,2,1,2,1,
%e ...
%K nonn,tabf
%O 1,19
%A _N. J. A. Sloane_, Feb 27 2018