|
%I #11 Dec 09 2019 09:20:49
%S 1,8,64,512,2197,4096,12167,15625,17576,24389,32768,42875,79507,91125,
%T 97336,117649,125000,132651,140608,195112,205379,226981,262144,300763,
%U 328509,343000,357911,389017,456533,493039,614125,636056,704969,729000
%N Odious cubes.
%H Amiram Eldar, <a href="/A125498/b125498.txt">Table of n, a(n) for n = 1..10000</a>
%e 2197 is in the sequence because 2197=13^3 and 2197 in base 2 is 100010010101, having an odd number of 1's.
%p isA000069 := proc(n) local b2 ; b2 := convert(n,base,2) ; if sum(op(i,b2),i=1..nops(b2)) mod 2 = 1 then RETURN(true) ; else RETURN(false) ; fi ; end : for n from 1 to 80 do if isA000069(n^3) then printf("%d,",n^3) ; fi ; od ; # _R. J. Mathar_, Jan 07 2007
%p a:=proc(n) local n2: n2:=convert(n^3,base,2): if sum(n2[j],j=1..nops(n2)) mod 2 = 1 then n^3 else fi end: seq(a(n),n=1..100); # _Emeric Deutsch_, Jan 10 2007
%t Select[Range[0, 90]^3, OddQ @ DigitCount[#, 2][[1]] &] (* _Amiram Eldar_, Dec 09 2019 *)
%Y Intersection of A000578 (cubes) and A000069 (odious numbers).
%K base,nonn
%O 1,2
%A _Tanya Khovanova_, Dec 27 2006
%E More terms from _R. J. Mathar_ and _Emeric Deutsch_, Jan 07 2007
|
