|
| |
|
|
A095072
|
|
Primes in whose binary expansion the number of 0-bits is one more than the number of 1-bits.
|
|
2
| |
|
|
17, 67, 73, 97, 263, 269, 277, 281, 293, 337, 353, 389, 401, 449, 1039, 1051, 1063, 1069, 1109, 1123, 1129, 1163, 1171, 1187, 1193, 1201, 1249, 1291, 1301, 1321, 1361, 1543, 1549, 1571, 1609, 1667, 1669, 1697, 1801, 4127, 4157, 4211, 4217
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
LINKS
| A. Karttunen and J. Moyer, C-program for computing the initial terms of this sequence
|
|
|
MATHEMATICA
| Select[Prime[Range[500]], Differences[DigitCount[#, 2]] == {1} &]
|
|
|
PROG
| (PARI) isA095072(n)=my(v=binary(n)); #v==2*sum(i=1, #v, v[i])+1&&isprime(n)
(PARI) forprime(p=2, 4250, v=binary(p); s=0; for(k=1, #v, s+=if(v[k]==0, +1, -1)); if(s==1, print1(p, ", ")))
|
|
|
CROSSREFS
| Intersection of A000040 and A031444. Subset of A095071.
Cf. A095052.
Sequence in context: A157474 A024215 A095071 * A180529 A039452 A171748
Adjacent sequences: A095069 A095070 A095071 * A095073 A095074 A095075
|
|
|
KEYWORD
| nonn,base,easy
|
|
|
AUTHOR
| Antti Karttunen (his-firstname.his-surname(AT)iki.fi), Jun 01 2004
|
| |
|
|
