|
Search: id:A110980
|
|
|
| A110980 |
|
Integers n such that 10^n+99 is prime. |
|
+0
4
|
|
| 1, 2, 4, 6, 13, 14, 16, 17, 19, 30, 31, 60, 68, 73, 113, 144, 276, 288, 364, 449, 473, 739, 833, 1171, 1732, 2292, 3912, 7673
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
Some of the larger entries may only correspond to probable primes.
|
|
EXAMPLE
|
If n=6, we have 10^6+99 = 1000000+99 = 1000099, which is prime.
|
|
MATHEMATICA
|
q=99; s=""; For[a=q, a<=q, s="10^n+"<>ToString[a]<>":"; n=0; For[i=1, i< 10^3, If[PrimeQ[10^i+a], n=1; s=s<>ToString[i]<>", "]; i++ ]; If[n>0, Print[s]]; a++ ] - Vladimir Orlovsky (4vladimir(AT)gmail.com), Apr 29 2008
|
|
CROSSREFS
|
Cf. A049054, A088274, A088275, A095688, A107083, A108049, A108050, A108052, A108054.
Sequence in context: A087902 A081457 A127105 this_sequence A058598 A087549 A109078
Adjacent sequences: A110977 A110978 A110979 this_sequence A110981 A110982 A110983
|
|
KEYWORD
|
hard,nonn
|
|
AUTHOR
|
Julien Peter Benney (jpbenney(AT)ftml.net), Sep 30 2005
|
|
EXTENSIONS
|
1 added by Vladimir Orlovsky, May 02 2008
|
|
|
Search completed in 0.002 seconds
|
