A147983 A sequence from 3-by-n Chomp: Values of r where is a P-position (p,q,r) have a pattern. This algorithm is very efficient. When length of period and start matrix is not in interest (only r have or not have pattern), algorithm generate sequence: 120,400,402,...10501,10583,10585 in 0.00013 second

120, 400, 402, 422, 424, 513, 576, 583, 585, 593, 605, 610, 861, 888, 890, 892, 904, 1013, 1015, 1059, 1129, 1141, 1143, 1163, 1216, 1281, 1291, 1293, 1295, 1419, 1448, 1508, 15231525, 1537, 1561, 1723, 1747, 1824, 1868, 1870, 1875, 1889, 2003, 2010