A069608 -id:A069608 - cp's OEIS frontend

A074342 a(1) = 6; a(n) is smallest number > a(n-1) such that the juxtaposition a(1)a(2)...a(n) is a prime.

6, 7, 19, 21, 23, 27, 57, 183, 207, 231, 247, 267, 399, 417, 441, 459, 569, 603, 693, 847, 933, 1107, 1149, 1197, 1251, 1581, 1619, 2061, 2137, 2139, 2339, 2643, 2703, 2743, 2847, 2987, 3199, 3447, 3477, 3641, 3919, 4241, 4369, 4599, 4761, 6647, 6739, 6831

Offset: 1

Zak Seidov, Sep 23 2002

Michael S. Branicky, Table of n, a(n) for n = 1..439

Cf. A046256, A069608, A074336, A074338, A074339, A074340, A074341, A074343, A074344, A074345, A074346.

a[1] = 6; 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, 48}] (* Robert G. Wilson v *)
nxt[{j_,a_}]:=Module[{k=a+2},While[CompositeQ[j(10^ IntegerLength[ k])+k],k+=2];{j(10^IntegerLength[k])+k,k}]; Join[{6},NestList[ nxt,{67,7},50][[All,2]]] (* Requires Mathematica version 10 or later *) (* Harvey P. Dale, Jun 19 2021 *)

from sympy import isprime
def aupton(terms):
  alst, astr = [6], "6"
  for n in range(2, terms+1):
    an = alst[-1] + 1
    while not isprime(int(astr+str(an))): an += 1
    alst, astr = alst + [an], astr + str(an)
  return alst
print(aupton(62)) # Michael S. Branicky, Jun 07 2021

Corrected and extended by Robert G. Wilson v, Aug 05 2005

A111525 a(1) = 10; a(n) = smallest number such that the juxtaposition a(1)a(2)...a(n) is a prime.

Original entry on oeis.org

10, 1, 3, 3, 3, 29, 1, 3, 3, 11, 9, 7, 23, 61, 11, 3, 91, 137, 7, 11, 31, 93, 17, 9, 273, 51, 397, 9, 99, 41, 111, 129, 111, 801, 109, 131, 297, 37, 621, 21, 807, 143, 87, 57, 231, 187, 53, 169, 77, 613, 867, 41, 199, 773, 523, 227, 27, 499, 171, 329, 67, 483, 393, 179

Offset: 1

Amarnath Murthy, Jason Earls and Robert G. Wilson v, Aug 05 2005

Cf. A111524, A074346, A092528, A069603, A069605, A069606, A069607, A069608, A069609, A069610, A069611, A111525.

a[1] = 10; a[n_] := a[n] = Block[{k = 1, c = IntegerDigits @ Table[ a[i], {i, n - 1}]}, While[ !PrimeQ[ FromDigits @ Flatten @ Append[c, IntegerDigits[k]]], k += 2]; k]; Table[ a[n], {n, 63}]

A069621 a(1) = 9; a(2n) = smallest prime that is a right concatenation of a(2n-1) and a number with no insignificant zeros and a(2n+1) = smallest prime ending in ( the least significant digits) a(2n). Alternate left and right concatenation yielding primes.

Original entry on oeis.org

9, 97, 197, 1973, 31973, 319733, 3319733, 331973311, 6331973311, 633197331131, 5633197331131, 563319733113127, 6563319733113127, 65633197331131279, 3465633197331131279, 346563319733113127933, 18346563319733113127933

Offset: 1

Amarnath Murthy, Mar 27 2002

			a(4) = 1973 starting with a(3) =197 and a(5) = 31973 ending in a(4) = 1973.

Cf. A053582, A069605, A069606, A069607, A069608, A069609, A069610, A069611, A069613, A069614, A069615, A069616, A069617, A069618, A069619, A069620.

More terms from Antonio G. Astudillo (afg_astudillo(AT)lycos.com), Mar 30 2003

A069613 a(1) = 1; a(2n) is smallest prime starting with a(2n-1) and a number with no insignificant zeros, and a(2n+1) is smallest prime ending in a(2n-1). Alternate left and right concatenation yielding primes.

Original entry on oeis.org

1, 11, 211, 2111, 22111, 2211127, 12211127, 122111279, 14122111279, 1412211127927, 211412211127927, 21141221112792721, 1321141221112792721, 132114122111279272169, 27132114122111279272169, 2713211412211127927216947

Offset: 1

Amarnath Murthy, Mar 27 2002

a(6) is not 2211109 because the 0 in this number is considered insignificant (for comparison, the 0 in 22111109 would be significant, but this value is not the smallest possible extension of a(5)=22111). - Sean A. Irvine, May 07 2024

			a(4) = 2111 starting with a(3) =211 and a(5) = 22111 ending in a(4) = 2111.

Cf. A053582, A069605, A069606, A069607, A069608, A069609, A069610, A069611, A069614.

More terms from Robert Gerbicz, Aug 27 2002

Name clarified by Sean A. Irvine, May 07 2024

A069615 a(1) = 3; a(2n) = smallest prime starting (in the most significant digits) with a(2n-1) (i.e., as a right concatenation of a(2n-1) and a number with no insignificant zeros); a(2n+1) = smallest prime ending in (the least significant digits) a(2n-1). Alternate left and right concatenation yielding primes.

Original entry on oeis.org

3, 31, 131, 1319, 21319, 213193, 12213193, 122131939, 1122131939, 112213193957, 27112213193957, 271122131939573, 3271122131939573, 327112213193957339, 2327112213193957339, 232711221319395733969, 13232711221319395733969

Offset: 1

Amarnath Murthy, Mar 27 2002

			a(4) = 1319 starting with a(3) = 131 and a(5) = 21319 ending in a(4) = 1319.

Cf. A053582, A069605, A069606, A069607, A069608, A069609, A069610, A069611, A069613, A069614.

More terms from Antonio G. Astudillo (afg_astudillo(AT)lycos.com), Mar 30 2003

A069616 a(1) = 4; a(2n) = smallest prime that is a right concatenation of a(2n-1) and a number with no insignificant zeros and a(2n+1) = smallest prime ending in ( the least significant digits) a(2n-1). Alternate left and right concatenation yielding primes.

Original entry on oeis.org

4, 41, 241, 2411, 32411, 324113, 6324113, 63241133, 1563241133, 15632411339, 815632411339, 81563241133919, 281563241133919, 2815632411339191, 322815632411339191, 32281563241133919151, 432281563241133919151

Offset: 1

Amarnath Murthy, Mar 27 2002

			a(4) = 2411 starting with a(3) =241 and a(5) = 32411 ending in a(4) = 2411.

Cf. A053582, A069605, A069606, A069607, A069608, A069609, A069610, A069611, A069613, A069614, A069615.

More terms from Antonio G. Astudillo (afg_astudillo(AT)lycos.com), Mar 30 2003

A069617 a(1) = 5; a(2n) = smallest prime that is a right concatenation of a(2n-1) and a number with no insignificant zeros and a(2n+1) = smallest prime ending in ( the least significant digits) a(2n-1). Alternate left and right concatenation yielding primes.

Original entry on oeis.org

5, 53, 353, 3533, 33533, 3353321, 113353321, 1133533213, 101133533213, 10113353321311, 310113353321311, 3101133533213117, 143101133533213117, 14310113353321311739, 314310113353321311739, 314310113353321311739103

Offset: 1

Amarnath Murthy, Mar 27 2002

			a(4) = 3533 starting with a(3) = 353 and a(5) = 33533 ending in a(4) = 3533.

Cf. A053582, A069605, A069606, A069607, A069608, A069609, A069610, A069611, A069613, A069614, A069615, A069616.

More terms from Antonio G. Astudillo (afg_astudillo(AT)lycos.com), Mar 30 2003

A069618 a(1) = 6; a(2n) = smallest prime that is a right concatenation of a(2n-1) and a number with no insignificant zeros and a(2n+1) = smallest prime ending in ( the least significant digits) a(2n-1). Alternate left and right concatenation yielding primes.

Original entry on oeis.org

6, 61, 461, 46133, 246133, 2461337, 22461337, 224613371, 12224613371, 1222461337117, 151222461337117, 15122246133711733, 615122246133711733, 615122246133711733213, 9615122246133711733213, 961512224613371173321349

Offset: 1

Amarnath Murthy, Mar 27 2002

			a(4) = 46133 starting with a(3) = 461 and a(5) = 246133 in a(4) = 46133.

Cf. A053582, A069605, A069606, A069607, A069608, A069609, A069610, A069611, A069613, A069614, A069615, A069616, A069617.

More terms from Antonio G. Astudillo (afg_astudillo(AT)lycos.com), Mar 30 2003

A069619 a(1) = 7; a(2n) = smallest prime that is a right concatenation of a(2n-1) and a number with no insignificant zeros and a(2n+1) = smallest prime ending in ( the least significant digits) a(2n-1). Alternate left and right concatenation yielding primes.

Original entry on oeis.org

7, 71, 271, 2711, 52711, 5271121, 135271121, 1352711219, 271352711219, 27135271121911, 1227135271121911, 122713527112191161, 20122713527112191161, 20122713527112191161109, 2720122713527112191161109

Offset: 1

Amarnath Murthy, Mar 27 2002

			a(4) = 2711 starting with a(3) = 271 and a(5) = 52711 in a(4) = 2711.

Cf. A053582, A069605, A069606, A069607, A069608, A069609, A069610, A069611, A069613, A069614, A069615, A069616, A069617, A069618.

More terms from Antonio G. Astudillo (afg_astudillo(AT)lycos.com), Mar 30 2003

A069620 a(1) = 8; a(2n) = smallest prime that is a right concatenation of a(2n-1) and a number with no insignificant zeros and a(2n+1) = smallest prime ending in ( the least significant digits) a(2n-1). Alternate left and right concatenation yielding primes.

Original entry on oeis.org

8, 83, 283, 2833, 32833, 328331, 2328331, 232833127, 3232833127, 323283312749, 14323283312749, 1432328331274927, 281432328331274927, 28143232833127492741, 3628143232833127492741, 36281432328331274927411

Offset: 1

Amarnath Murthy, Mar 27 2002

			a(4) = 2833 starting with a(3) = 283 and a(5) = 32833 ending in a(4) = 2833.

Cf. A053582, A069605, A069606, A069607, A069608, A069609, A069610, A069611, A069613, A069614, A069615, A069616, A069617, A069618, A069619.

More terms from Antonio G. Astudillo (afg_astudillo(AT)lycos.com), Mar 30 2003

cp's OEIS Frontend

A074342 a(1) = 6; a(n) is smallest number > a(n-1) such that the juxtaposition a(1)a(2)...a(n) is a prime.

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

Python

Extensions

A111525 a(1) = 10; a(n) = smallest number such that the juxtaposition a(1)a(2)...a(n) is a prime.

Views

Author

Keywords

Crossrefs

Programs

Mathematica

A069621 a(1) = 9; a(2n) = smallest prime that is a right concatenation of a(2n-1) and a number with no insignificant zeros and a(2n+1) = smallest prime ending in ( the least significant digits) a(2n). Alternate left and right concatenation yielding primes.

Views

Author

Keywords

Examples

Crossrefs

Extensions

A069613 a(1) = 1; a(2n) is smallest prime starting with a(2n-1) and a number with no insignificant zeros, and a(2n+1) is smallest prime ending in a(2n-1). Alternate left and right concatenation yielding primes.

Views

Author

Keywords

Comments

Examples

Crossrefs

Extensions

Views

Author

Keywords

Examples

Crossrefs

Extensions

A069616 a(1) = 4; a(2n) = smallest prime that is a right concatenation of a(2n-1) and a number with no insignificant zeros and a(2n+1) = smallest prime ending in ( the least significant digits) a(2n-1). Alternate left and right concatenation yielding primes.

Views

Author

Keywords

Examples

Crossrefs

Extensions

A069617 a(1) = 5; a(2n) = smallest prime that is a right concatenation of a(2n-1) and a number with no insignificant zeros and a(2n+1) = smallest prime ending in ( the least significant digits) a(2n-1). Alternate left and right concatenation yielding primes.

Views

Author

Keywords

Examples

Crossrefs

Extensions

A069618 a(1) = 6; a(2n) = smallest prime that is a right concatenation of a(2n-1) and a number with no insignificant zeros and a(2n+1) = smallest prime ending in ( the least significant digits) a(2n-1). Alternate left and right concatenation yielding primes.

Views

Author

Keywords

Examples

Crossrefs

Extensions

A069619 a(1) = 7; a(2n) = smallest prime that is a right concatenation of a(2n-1) and a number with no insignificant zeros and a(2n+1) = smallest prime ending in ( the least significant digits) a(2n-1). Alternate left and right concatenation yielding primes.

Views

Author

Keywords

Examples

Crossrefs

Extensions

A069620 a(1) = 8; a(2n) = smallest prime that is a right concatenation of a(2n-1) and a number with no insignificant zeros and a(2n+1) = smallest prime ending in ( the least significant digits) a(2n-1). Alternate left and right concatenation yielding primes.

Views

Author

Keywords

Examples

Crossrefs

Extensions