cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A136583 n such that floor(sqrt(10^(2*n-1))) is (probably) prime.

Original entry on oeis.org

1, 2, 7, 18, 33, 206, 468, 1061, 6831, 40377
Offset: 1

Views

Author

Lekraj Beedassy, Jan 09 2008

Keywords

Comments

Number of digits of sqrt(10)-primes (A136582).
The n such that A017934(2*n-1) is (probably) prime.

Crossrefs

Programs

  • 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
  • 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 *)

Extensions

a(6) - a(8) from Robert G. Wilson v, Jan 20 2008
Probable terms a(9) and a(10) from Jason Kimberley, Aug 19 and Sep 03 2011