The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A089749 a(n) = smallest m > a(n-1) such that concatenation nm is a prime. 3
 1, 3, 7, 19, 21, 31, 33, 39, 41, 49, 51, 59, 61, 71, 79, 93, 107, 119, 121, 123, 139, 147, 159, 169, 171, 177, 179, 181, 191, 197, 219, 233, 247, 253, 257, 263, 273, 281, 293, 343, 351, 359, 391, 417, 427, 439, 441, 449, 451, 459, 461, 489, 503, 517, 529, 531 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS Up to a(10^6), a(n) =~ 100000 + 24n + 10^(-6*n), which is almost a straight line. - Robert G. Wilson v LINKS Robert Israel, Table of n, a(n) for n = 1..10000 EXAMPLE a(5) = 21 because the first prime after a(4) = 419 beginning with 5 is 521. MAPLE A[1]:= 1: for n from 2 to 100 do for m from A[n-1]+1 do if isprime(ncat(n, m)) then A[n]:= m; break fi od od: seq(A[i], i=1..100); # Robert Israel, Feb 14 2021 MATHEMATICA a[1] = 1; a[1] = 1; a[n_] := a[n] = Block[{k = IntegerDigits[n], l = a[n - 1] + 2}, While[ !PrimeQ[ FromDigits[ Join[k, IntegerDigits[l]]]], l += 2]; l]; Table[ a[n], {n, 1, 55}] CROSSREFS Sequence in context: A365139 A242170 A032675 * A032667 A109991 A248219 Adjacent sequences: A089746 A089747 A089748 * A089750 A089751 A089752 KEYWORD base,nonn AUTHOR Amarnath Murthy, Nov 20 2003 EXTENSIONS Corrected and extended by Robert G. Wilson v, Dec 05 2003 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified July 13 06:26 EDT 2024. Contains 374267 sequences. (Running on oeis4.)