A333649 Numbers k such that the second k binary digits of Pi represent a prime (leading zeros allowed).

3, 7, 41, 93, 166, 316, 1449, 6605, 10015, 13097, 16284, 19075, 35137

Offset

1,1

Comments

Numbers k such that floor(2^(2*k-2)*Pi) mod 2^k is prime.

A random number of k binary digits has probability ~ constant/k of being prime, so heuristically we should expect the sequence to be infinite, but growing exponentially.

Links

Table of n, a(n) for n=1..13.

Example

a(2)=7 is in the sequence because the first 14 binary digits in Pi are 11.001001000011; the second 7 binary digits are 1000011, or 67 in decimal, which is prime.

Maple

L:= floor(Pi*2^19998):
select(n -> isprime(floor(L*2^(2*n-20000)) mod 2^n), [$1..10000]);

Prog

(PARI) default(realprecision, 10^5);
is(k) = ispseudoprime(floor(4^(k-1)*Pi)%2^k); \\ Jinyuan Wang, Mar 31 2020

Crossrefs

Cf. A004601.

Sequence in context: A128647 A071730 A058815 * A089656 A018970 A018968

Adjacent sequences: A333646 A333647 A333648 * A333650 A333651 A333652

Keyword

nonn,base,more

Author

Robert Israel, Mar 31 2020

Extensions

a(9) from Jinyuan Wang, Mar 31 2020

a(10)-a(13) from Chai Wah Wu, Apr 06 2020

Status

approved