|
Search: id:A121521
|
|
|
| A121521 |
|
Least positive k such that (10^n+1)^n + k is prime. |
|
+0
2
|
|
| 1, 2, 10, 2, 16, 12, 220, 60, 112, 222, 112, 30, 618, 348, 156, 248, 10, 290, 256, 2346, 118, 570, 738, 348, 1356, 4352, 1402, 470, 736, 300, 10428, 4962, 4882, 1382, 580, 948, 5112, 776, 358
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
The 100th term is 16456; ((10^100+1)^100)+16456 produces a probable prime with 10001 digits. Proof: PFGW Version 1.2.0 for Windows [FFT v23.8] Primality testing ((10^100+1)^100)+16456 [N-1/N+1, Brillhart-Lehmer-Selfridge] Running N-1 test using base 3 Running N-1 test using base 5 Running N+1 test using discriminant 13, base 1+sqrt(13) Running N+1 test using discriminant 13, base 4+sqrt(13) ((10^100+1)^100)+16456 is Fermat and Lucas PRP! (101.6085s+0.0803s) Done.
|
|
CROSSREFS
|
Cf. A121520.
Sequence in context: A069287 A102775 A010700 this_sequence A060466 A061196 A120862
Adjacent sequences: A121518 A121519 A121520 this_sequence A121522 A121523 A121524
|
|
KEYWORD
|
more,nonn
|
|
AUTHOR
|
Jason Earls (zevi_35711(AT)yahoo.com), Aug 05 2006
|
|
|
Search completed in 0.002 seconds
|
