|
| |
|
|
A095077
|
|
Primes with four 1-bits in their binary expansion.
|
|
3
| |
|
|
23, 29, 43, 53, 71, 83, 89, 101, 113, 139, 149, 163, 197, 263, 269, 277, 281, 293, 337, 353, 389, 401, 449, 523, 547, 593, 643, 673, 773, 1031, 1049, 1061, 1091, 1093, 1097, 1217, 1283, 1289, 1297, 1409, 1553, 1601, 2069, 2083, 2089, 2129
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
LINKS
| T. D. Noe, Table of n, a(n) for n=1..1000
A. Karttunen and J. Moyer, C-program for computing the initial terms of this sequence
|
|
|
MATHEMATICA
| Select[Prime[Range[320]], Plus@@IntegerDigits[#, 2] == 4 &] (* From Alonso del Arte (alonso.delarte(AT)gmail.com), Jan 11 2011 *)
|
|
|
PROG
| (PARI) bits1_4(x) = { nB = floor(log(x)/log(2)); z = 0;
for(i=0, nB, if(bittest(x, i), z++; if(z>4, return(0); ); ); );
if(z == 4, return(1); , return(0); ); };
forprime(x=17, 2129, if(bits1_4(x), print1(x, ", "); ); );
[W. Bomfim webonfim(AT)bol.com Jan 11, 2011]
|
|
|
CROSSREFS
| Subset of A027699. Differs from A085448 first time at n=19, where a(n)=337, while A085448 continues from there with 311, whose binary expansion has six 1-bits, not four. Cf. A095057.
Cf. A000215 (primes having two bits set), A081091 (three bits set)
Sequence in context: A007637 A161723 A085448 * A106989 A106988 A127834
Adjacent sequences: A095074 A095075 A095076 * A095078 A095079 A095080
|
|
|
KEYWORD
| nonn,easy,base
|
|
|
AUTHOR
| Antti Karttunen (his-firstname.his-surname(AT)iki.fi), Jun 01 2004
|
| |
|
|
