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.
%I A234218 #19 Apr 02 2017 16:53:14 %S A234218 2,13,23,29,43,59,61,67,71,73,79,89,97,101,103,109,113,131,139,149, %T A234218 151,157,163,167,173,179,181,191,193,197,199,211,229,241,251,293,311, %U A234218 313,337,353,367,383,389,397,409,419,431,439,443,461,467,479,499,509,521,541,563,577,601 %N A234218 Primes whose cubes are odious. %C A234218 Primes p with odious p^3. %C A234218 Note: "odious" means having an odd number of 1-bits in number's binary representation. So, put in another way, primes p such that A010060(A000578(p)) = 1. - _Antti Karttunen_, Dec 22 2013 %C A234218 Subsequence of the numbers 1, 2, 4, 8, 13, 16, 23, 25, 26, 29, 32, 35, 43, 45, 46, ... which have odious cubes. %H A234218 Antti Karttunen, <a href="/A234218/b234218.txt">Table of n, a(n) for n = 1..1001</a> %e A234218 Prime 2 is in this sequence because 2^3 = 8 and 8 is odious number. Prime 13 is in this sequence because 13*3 = 2197 and 2197 is odious number. %t A234218 Select[Prime[Range[1000]], OddQ[DigitCount[#^3, 2, 1]] &] (* _Indranil Ghosh_, Apr 02 2017 *) %o A234218 (Scheme, with Antti Karttunen's IntSeq-library) (define A234218 (MATCHING-POS 1 1 (lambda (n) (and (prime? n) (odd? (A000120 (expt n 3))))))) ;; _Antti Karttunen_, Dec 22 2013 %o A234218 (PARI) is(n)=isprime(n) && hammingweight(n^3)%2 \\ _Charles R Greathouse IV_, Mar 17 2014 %Y A234218 Cf. A000069, A000120, A000578, A010060, A125498, A192085, A194991. %K A234218 nonn,easy %O A234218 1,1 %A A234218 _Irina Gerasimova_, Dec 21 2013 %E A234218 Missing terms added by _Antti Karttunen_, Dec 22 2013