Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A109503
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A109503 Numbers n such that 66 * 10^n + 1 is prime. +0
1
0, 1, 4, 5, 11, 30, 60, 64, 869, 1685, 12109 (list; graph; listen)
OFFSET

1,3

COMMENT

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).

CROSSREFS

Sequence in context: A000769 A050831 A056799 this_sequence A067371 A068719 A034773

Adjacent sequences: A109500 A109501 A109502 this_sequence A109504 A109505 A109506

KEYWORD

nonn

AUTHOR

Jason Earls (zevi_35711(AT)yahoo.com), Aug 29 2005

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 18 21:37 EST 2009. Contains 171024 sequences.


AT&T Labs Research