|
Search: id:A104206
|
|
|
| A104206 |
|
Concatenation of the smallest and the largest n-digit primes. |
|
+0
2
|
|
| 27, 1197, 101997, 10099973, 1000799991, 100003999983, 10000039999991, 1000001999999989, 100000007999999937, 10000000079999999967, 1000000001999999999977, 100000000003999999999989
(list; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
LINKS
|
Chris Caldwell The First 10,000 Primes
|
|
EXAMPLE
|
27 is obtained by concatenating the smallest 1-digit prime and the largest 1-digit prime.
1197 is obtained by concatenating the smallest 2-digit prime and the largest 2-digit prime.
|
|
MAPLE
|
for n from 0 to 30 do for m from 1 to 10^(n+1)-1 do if isprime(10^n + m) then printf(`%d`, 10^n+m); break; fi: od: for m from 1 to 10^(n+1)-1 do if isprime(10^(n+1) - m) then printf(`%d`, 10^(n+1)-m); break; fi: od: printf(`, `): od: (Sellers)
|
|
CROSSREFS
|
Sequence in context: A143366 A143705 A159457 this_sequence A163568 A066300 A075547
Adjacent sequences: A104203 A104204 A104205 this_sequence A104207 A104208 A104209
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Parthasarathy Nambi (PachaNambi(AT)yahoo.com), Apr 01 2005
|
|
EXTENSIONS
|
More terms from James A. Sellers (sellersj(AT)math.psu.edu), May 02 2005
|
|
|
Search completed in 0.002 seconds
|
