cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A125498 Odious cubes.

Original entry on oeis.org

1, 8, 64, 512, 2197, 4096, 12167, 15625, 17576, 24389, 32768, 42875, 79507, 91125, 97336, 117649, 125000, 132651, 140608, 195112, 205379, 226981, 262144, 300763, 328509, 343000, 357911, 389017, 456533, 493039, 614125, 636056, 704969, 729000
Offset: 1

Views

Author

Tanya Khovanova, Dec 27 2006

Keywords

Examples

			2197 is in the sequence because 2197=13^3 and 2197 in base 2 is 100010010101, having an odd number of 1's.
		

Crossrefs

Intersection of A000578 (cubes) and A000069 (odious numbers).

Programs

  • Maple
    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
    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
  • Mathematica
    Select[Range[0, 90]^3, OddQ @ DigitCount[#, 2][[1]] &] (* Amiram Eldar, Dec 09 2019 *)

Extensions

More terms from R. J. Mathar and Emeric Deutsch, Jan 07 2007