Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A108240
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A108240 Numbers n such that (10^n)^2 + 5*(10^n) - 1 is prime. +0
1
0, 1, 2, 7, 45, 54, 60, 99, 195, 271, 476, 1491, 2713 (list; graph; listen)
OFFSET

1,3

COMMENT

All of these primes have been certified. Primality proof for the largest: PFGW Version 20041001.Win_Stable (v1.2 RC1b) [FFT v23.8] Primality testing (10^2713)^2+5*(10^2713)-1 [N+1, Brillhart-Lehmer-Selfridge] Running N+1 test using discriminant 7, base 1+sqrt(7) Calling Brillhart-Lehmer-Selfridge with factored part 34.96% (10^2713)^2+5*(10^2713)-1 is prime! (216.4510s+10.6592s)

CROSSREFS

Cf. A108195.

Sequence in context: A107354 A006118 A083670 this_sequence A064606 A066612 A098637

Adjacent sequences: A108237 A108238 A108239 this_sequence A108241 A108242 A108243

KEYWORD

more,nonn

AUTHOR

Jason Earls (zevi_35711(AT)yahoo.com), Jun 17 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 November 30 22:12 EST 2008. Contains 150989 sequences.


AT&T Labs Research