|
Search: id:A111473
|
|
|
| A111473 |
|
a(1) = 3, a(n) = least k such that concatenation of n copies of k with all previous concatenation gives a prime. |
|
+0
7
|
| |
|
|
OFFSET
|
1,1
|
|
|
EXAMPLE
|
3,311,311111,31111111111111 are all prime.
31111111111111 = one copy of 3, two copies of 1, three copies of 1, four copies of 11.
|
|
CROSSREFS
|
Cf. A111471, A111472, A111474.
Sequence in context: A060540 A087647 A100265 this_sequence A086766 A078688 A082466
Adjacent sequences: A111470 A111471 A111472 this_sequence A111474 A111475 A111476
|
|
KEYWORD
|
base,hard,more,nonn
|
|
AUTHOR
|
Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Aug 05 2005
|
|
|
Search completed in 0.002 seconds
|
