|
%I #31 Aug 07 2022 08:38:34
%S 1,2,4,7,8,11,13,14,16,19,22,26,28,31,32,37,38,41,44,47,49,52,56,59,
%T 61,62,64,67,73,74,76,79,82,88,91,94,97,98,103,104,107,109,112,118,
%U 121,122,124,127,128,131,133,134,137,143,146,148,151,152,157,158,164,167,173
%N Numbers n such that all divisors of n have an odd number of 1's in their binary expansions.
%C Subsequence of A000069. - _Michel Marcus_, Feb 09 2014
%C Numbers all of whose divisors are odious. - _Bernard Schott_, Jul 22 2022
%H Amiram Eldar, <a href="/A093696/b093696.txt">Table of n, a(n) for n = 1..10000</a>
%F {n: A356018(n) =0 }. - _R. J. Mathar_, Aug 07 2022
%e 14 is in the sequence because its divisors are [1, 2, 7, 14] and in binary: 1, 10, 111 and 1110, all have an odd number of 1's.
%p isA001969 := proc(n)
%p if wt(n) mod 2 = 0 then
%p true;
%p else
%p false;
%p end if;
%p end proc:
%p isA093696 := proc(n)
%p for d in numtheory[divisors](n) do
%p if isA001969(d) then
%p return false;
%p end if;
%p end do;
%p true;
%p end proc:
%p for n from 1 to 200 do
%p if isA093696(n) then
%p printf("%d,",n);
%p end if;
%p end do: # _R. J. Mathar_, Feb 13 2014
%t odiousQ[n_] := OddQ @ DigitCount[n, 2][[1]]; Select[Range[200], AllTrue[ Divisors[#], odiousQ ] &] (* _Amiram Eldar_, Dec 09 2019 *)
%o (PARI) is(n)=fordiv(n,d,if(hammingweight(d)%2==0, return(0))); 1 \\ _Charles R Greathouse IV_, Mar 29 2013
%o (Python)
%o from sympy import divisors, isprime
%o def c(n): return bin(n).count("1")&1
%o def ok(n): return n > 0 and all(c(d) for d in divisors(n, generator=True))
%o print([k for k in range(174) if ok(k)]) # _Michael S. Branicky_, Jul 24 2022
%Y Cf. A000069, A001969, A227872, A330289, A355968, A355969.
%Y Similar sequences: A062687, A190217, A337741, A337941, A355596.
%Y A000079 is a subsequence.
%K nonn,base
%O 1,2
%A _Jason Earls_, May 16 2004
|
