login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A109503 Numbers n such that 66 * 10^n + 1 is prime. 0
0, 1, 4, 5, 11, 30, 60, 64, 869, 1685, 12109 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
COMMENTS
All terms proved prime. Proof for the largest: PFGW Version 1.2.0 for Windows [FFT v23.8] Primality testing 66*10^12109+1 [N-1, Brillhart-Lehmer-Selfridge] Running N-1 test using base 7 Calling Brillhart-Lehmer-Selfridge with factored part 69.89% 66*10^12109+1 is prime! (27.9892s+0.0059s). No more terms up to 38800, although another is 65460 found by Peter Benson (listed at Caldwell's Top-5000 Primes site).
LINKS
PROG
(PARI) is(n)=ispseudoprime(66*10^n+1) \\ Charles R Greathouse IV, Jun 13 2017
CROSSREFS
Sequence in context: A216963 A259821 A352681 * A304224 A304135 A251240
KEYWORD
nonn
AUTHOR
Jason Earls, Aug 29 2005
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 08:08 EDT 2024. Contains 371782 sequences. (Running on oeis4.)