A095058 Number of primes with a single 0-bit (A095078) in range ]2^n,2^(n+1)].
0, 1, 2, 2, 3, 0, 4, 4, 3, 1, 5, 1, 4, 0, 3, 2, 8, 1, 11, 4, 5, 0, 7, 1, 2, 0, 1, 5, 4, 0, 7, 5, 1, 1, 9, 0, 6, 0, 7, 1, 6, 0, 4, 7, 2, 1, 10, 3, 3, 1, 2, 1, 6, 0, 4, 3, 0, 1, 8, 3, 3, 0, 3, 1, 8, 1, 2, 2, 3, 0, 9, 1, 5, 2, 5, 8, 3, 0, 10, 3, 0, 2, 4, 4, 6, 1
Offset: 1
Keywords
Links
- T. D. Noe, Table of n, a(n) for n=1..2048
- A. Karttunen and J. Moyer, C-program for computing the initial terms of this sequence
- Samuel S. Wagstaff, Jr., Prime Numbers with a fixed number of one bits or zero bits in their binary representation, Exp. Math. vol. 10, issue 2 (2001) 267, Table 3. - From _N. J. A. Sloane_, Jun 19 2011.
- Samuel S. Wagstaff, Jr., Prime Numbers with a fixed number of one bits or zero bits in their binary representation, Exp. Math. vol. 10, issue 2 (2001) 267, Table 3.
- Index entries for sequences related to occurrences of various subsets of primes in range ]2^n,2^(n+1)]
Crossrefs
Cf. A095018.
Programs
-
PARI
a(n) = sum(k=2^n+1, 2^(n+1), isprime(k) && (#select(x->x==0, binary(k))==1)); \\ Michel Marcus, Sep 11 2015
Comments