Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #14 Mar 31 2012 10:23:20
%S 10,18,20,22,26,30,36,52,54,62,72,74,90,94,126,129,136,144,148,152,
%T 154,156,158,160,168,180,188,190,192,200,208,212,216,218,220,222,224,
%U 232,244,252,254,257,264,272,278,288,296,304,306,308,310,314,318,328,346,350,360,378,382,384,392,400,408,414,416,424,432,436,440,442,444,446,448,456
%N Integers whose binary digits "1" define, iff these integers are not decreased by one, Arimaa pieces of both colors so that an enemy piece can be removable in all possible color combinations in one turn (= 4 steps) if sorted into a quadrant shape whose right angle lies in an Arimaa board corner.
%H <a href="http://arimaa.com/arimaa/papers">Academic Papers and Presentations</a>
%e 168 has the binary expansion 10101000. Sorting into a quadrant shape (like in A165197, A166537, the least-significant digit into the corner) with a "T" on position (3,3) leads to:
%e 001
%e 00
%e 11T
%e 0
%e Either the left piece pushes to right or the upper piece comes down and pushes in a right angle. So in both possible color combinations an enemy piece can be brought into the trap field "T". The following integers till 174 bring for possible removabilities sufficiently movable pieces into the 4 vacant corner fields.
%K nonn,base,uned
%O 1,1
%A _Leonhard Kreissig_, Dec 24 2010