|
Search: id:A105347
|
|
|
| A105347 |
|
Concatenation of the largest and the smallest n-digit primes (in that order). |
|
+0
1
|
|
| 72, 9711, 997101, 99731009, 9999110007, 999983100003, 99999911000003, 9999998910000019, 999999937100000007, 99999999671000000007, 9999999997710000000019, 999999999989100000000003
(list; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
LINKS
|
Chris Caldwell, The First 10,000 Primes.
|
|
EXAMPLE
|
The largest and smallest 1-digit primes are 7 and 2, so the first term is 72.
The largest and smallest 2-digit primes are 97 and 11, so the second term is 9711.
|
|
MAPLE
|
for n from 0 to 30 do 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: for m from 1 to 10^(n+1)-1 do if isprime(10^n + m) then printf(`%d`, 10^n+m); break; fi: od: printf(`, `): od: (Sellers)
|
|
CROSSREFS
|
Cf. A104206.
Sequence in context: A103861 A119750 A093272 this_sequence A093236 A146500 A060507
Adjacent sequences: A105344 A105345 A105346 this_sequence A105348 A105349 A105350
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
Parthasarathy Nambi (PachaNambi(AT)yahoo.com), Apr 30 2005
|
|
EXTENSIONS
|
More terms from James A. Sellers (sellersj(AT)math.psu.edu), May 02 2005
|
|
|
Search completed in 0.002 seconds
|
