login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A104206
Concatenation of the smallest and the largest n-digit primes.
2
27, 1197, 101997, 10099973, 1000799991, 100003999983, 10000039999991, 1000001999999989, 100000007999999937, 10000000079999999967, 1000000001999999999977, 100000000003999999999989, 10000000000399999999999971, 1000000000003799999999999973
OFFSET
0,1
LINKS
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: # James A. Sellers, May 02 2005
MATHEMATICA
FromDigits/@Table[Flatten[{IntegerDigits[NextPrime[10^n]], IntegerDigits[ NextPrime[ 10^(n+1), -1]]}], {n, 0, 15}] (* Harvey P. Dale, Aug 06 2013 *)
CROSSREFS
Sequence in context: A290946 A223552 A357228 * A327596 A163568 A066300
KEYWORD
nonn,base,less
AUTHOR
Parthasarathy Nambi, Apr 01 2005
EXTENSIONS
More terms from James A. Sellers, May 02 2005
Edited by Charles R Greathouse IV, Apr 27 2010
More terms from Harvey P. Dale, Aug 06 2013
STATUS
approved