|
%I #17 Jul 11 2019 14:44:58
%S 1,4,6,10,14,16,18,22,24,26,30,34,38,40,42,46,50,54,56,58,62,64,66,70,
%T 72,74,78,82,86,88,90,94,96,98,102,104,106,110,114,118,120,122,126,
%U 130,134,136,138,142,146,150,152,154,158,160,162,166,168,170,174
%N P-positions for game of misere version of Mark.
%C The same as A036554 except for the replacement of dopey by vile powers of 2. - Aviezri Fraenkel, Apr 28 2011
%H Aviezri S. Fraenkel, <a href="http://dx.doi.org/10.1016/j.disc.2011.03.032">The vile, dopey, evil and odious game players</a>, Discrete Math. 312 (1) (2012) 42-46.
%p isA171944 := proc(n)
%p option remember;
%p if n =0 or n =2 then
%p true;
%p elif isA171945(n) then
%p false;
%p else
%p true ;
%p end if;
%p end proc:
%p isA171945 := proc(n)
%p option remember;
%p if n = 0 or n =2 then
%p false ;
%p elif n = 1 then
%p true;
%p elif n mod 2 <> 0 then
%p return false;
%p elif isA171944(n/2) then
%p true;
%p else
%p false ;
%p end if;
%p end proc:
%p for n from 0 to 400 do
%p if isA171945(n) then
%p printf("%d,",n);
%p end if;
%p end do: # _R. J. Mathar_, Mar 28 2013
%t lim = 210; S = {1}; A = {};
%t Do[d = Divisors[n]; If[Complement[d, S] != {n}, A = Append[A, n]; S = Union[S, d]], {n, 1, lim}];
%t A (* _Jean-François Alcover_, Jul 11 2019, after _Peter Luschny_ in A171944 *)
%Y Complement of A171944. Also for n>1, twice A171944. Cf. A036554.
%K nonn,easy
%O 1,2
%A _N. J. A. Sloane_, Oct 29 2010
|
