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

 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 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A074346 a(1) = 10; a(n) is smallest number > a(n-1) such that the juxtaposition a(1)a(2)...a(n) is a prime. 12
 10, 13, 23, 49, 111, 113, 171, 211, 293, 309, 333, 387, 463, 479, 513, 687, 933, 973, 993, 1329, 1433, 1449, 1551, 2071, 2271, 2423, 2587, 2621, 2659, 2757, 2771, 2911, 3081, 3243, 3279, 3671, 4243, 4247, 4371, 4453, 4511, 5229, 6097, 6177, 6293, 6571 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS Michael S. Branicky, Table of n, a(n) for n = 1..439 MATHEMATICA a[1] = 10; a[n_] := a[n] = Block[{k = a[n - 1] + 1 + Mod[a[n - 1], 2], c = IntegerDigits @ Table[ a[i], {i, n - 1}]}, While[ !PrimeQ[ FromDigits @ Flatten @ Append[c, IntegerDigits[k]]], k += 2]; k]; Table[ a[n], {n, 46}] (* Robert G. Wilson v, Aug 05 2005 *) PROG (Python) from sympy import isprime def aupton(terms): alst, astr = [10], "10" while len(alst) < terms: k = alst[-1] + 1 + (alst[-1]%2) while not isprime(int(astr+str(k))): k += 2 alst.append(k) astr += str(k) return alst print(aupton(46)) # Michael S. Branicky, Oct 13 2021 CROSSREFS Cf. A111524, A111525, A074336. Cf. A074338, A074339, A074340, A074341, A074342, A074343, A074344, A074345. Sequence in context: A176762 A001273 A111524 * A126973 A220045 A101215 Adjacent sequences: A074343 A074344 A074345 * A074347 A074348 A074349 KEYWORD nonn,base AUTHOR Zak Seidov, Sep 23 2002 EXTENSIONS More terms from Robert G. Wilson v, Aug 05 2005 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 December 9 00:20 EST 2022. Contains 358698 sequences. (Running on oeis4.)