|
|
A136583
|
|
n such that floor(sqrt(10^(2*n-1))) is (probably) prime.
|
|
3
|
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
Number of digits of sqrt(10)-primes (A136582).
The n such that A017934(2*n-1) is (probably) prime.
|
|
LINKS
|
|
|
MATHEMATICA
|
rd = RealDigits[Sqrt[10], 10, 10^5][[1]]; Do[ If[ PrimeQ@ FromDigits@ Take[rd, n], Print@n], {n, 10^5}] (* Robert G. Wilson v, Jan 20 2008 *)
|
|
PROG
|
(Magma) for n in [1..10^6] do if IsPrime(Isqrt(10^(2*n-1))) then printf "%o, ", n; end if; end for; // Jason Kimberley, Sep 03 2011
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,base,more
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|