cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-10 of 11 results. Next

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

Original entry on oeis.org

7, 1, 9, 3, 3, 3, 17, 7, 11, 37, 11, 9, 31, 9, 17, 13, 93, 3, 167, 67, 119, 93, 31, 33, 143, 99, 297, 91, 69, 83, 1, 33, 23, 27, 199, 333, 123, 549, 17, 67, 141, 33, 39, 167, 21, 217, 279, 419, 69, 517, 71, 451, 171, 39, 191, 93, 43, 11, 303, 777, 33, 67, 207, 369, 489
Offset: 1

Views

Author

Amarnath Murthy, Mar 26 2002

Keywords

Examples

			a(7) = 17 and the number 71933317 is a prime.

Links

Crossrefs

Cf. A069602, A069604, A046257, A074343, A092528, A069603, A069605, A069606, A069607, A069608, A069609, A069610, A069611, A111525.

Programs

  • Mathematica
    a[1] = 7; 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, 67}] (* Robert G. Wilson v, Aug 05 2005 *)
nxt[{j_,a_}]:=Module[{k=1},While[CompositeQ[j*10^IntegerLength[k]+k],k++];{j*10^IntegerLength[k]+k,k}]; NestList[nxt,{7,7},70][[All,2]] (* Harvey P. Dale, May 06 2022 *)

Extensions

More terms from Jason Earls, Jun 13 2002

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

Original entry on oeis.org

1, 1, 3, 11, 13, 29, 39, 49, 83, 141, 247, 273, 291, 347, 373, 401, 441, 567, 571, 651, 903, 957, 1001, 1129, 1401, 1457, 1467, 1561, 1889, 2083, 2169, 2523, 2717, 2743, 3447, 3509, 3711, 4087, 4899, 4983, 5087, 5151, 5263, 5429, 5551, 6017, 7389, 7839
Offset: 1

Views

Author

N. J. A. Sloane

Keywords

Links

Crossrefs

Cf. A074336, A092528, A069602, A033679, A033681, A046254, A046255, A046256, A046257, A046258, A046259, A111524.

Programs

  • Mathematica
    a[1] = 1; a[n_] := a[n] = Block[{k = a[n - 1], 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[{c_,a_}]:=Module[{x=a},While[!PrimeQ[FromDigits[Join[c,IntegerDigits[ x]]]],x+=2];{Join[c,IntegerDigits[x]],x}]; NestList[nxt,{{1},1},50][[All,2]] (* Harvey P. Dale, Sep 14 2018 *)

Extensions

More terms from Patrick De Geest, May 15 1998
More terms from Robert G. Wilson v, Aug 05 2005

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

Original entry on oeis.org

2, 3, 3, 3, 3, 21, 53, 69, 81, 139, 143, 223, 233, 261, 261, 399, 553, 609, 659, 673, 1017, 1187, 1357, 1571, 1641, 1839, 2151, 2191, 2499, 2511, 2607, 2667, 2681, 3081, 3351, 4291, 4319, 4353, 4489, 4733, 4819, 6003, 6011, 6631, 6797, 7113, 7429, 7547, 7651
Offset: 1

Views

Author

N. J. A. Sloane

Keywords

Links

Crossrefs

Cf. A069603, A074338, A033680, A033681, A046254, A046255, A046256, A046257, A046258, A046259, A111524.

Programs

  • Maple
    R:= 2,3: p:= 23: x:= 3:
for count from 3 to 100 do
  for y from x by 2 do
    if isprime(10^(1+ilog10(y))*p+y) then
      R:= R, y; p:= 10^(1+ilog10(y))*p+y; x:= y;
      break
    fi
od od:
R; # Robert Israel, Nov 22 2020
  • Mathematica
    a[1] = 2; a[n_] := a[n] = Block[{k = a[n - 1], c = IntegerDigits @ Table[ a[i], {i, n - 1}]}, While[ !PrimeQ[ FromDigits @ Flatten @ Append[c, IntegerDigits[k]]], k ++ ]; k]; Table[ a[n], {n, 47}] (* Robert G. Wilson v, Aug 05 2005 *)

Extensions

More terms from Patrick De Geest, May 15 1998
More terms from Robert G. Wilson v, Aug 05 2005

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

Original entry on oeis.org

3, 7, 9, 51, 51, 51, 97, 131, 157, 159, 243, 309, 327, 363, 383, 411, 487, 639, 873, 983, 1231, 1257, 1337, 1549, 1589, 2101, 2159, 2317, 2871, 2907, 4053, 4097, 4597, 4703, 5559, 5799, 6337, 6527, 6561, 6939, 7147, 7167, 7839, 8403, 8873, 9237, 9541, 9771
Offset: 1

Views

Author

N. J. A. Sloane

Keywords

Crossrefs

Cf. A069605, A074339, A033680, A033679, A046254, A046255, A046256, A046257, A046258, A046259, A111524.

Programs

  • Mathematica
    a[1] = 3; a[n_] := a[n] = Block[{k = a[n - 1], 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 *)

Extensions

More terms from Patrick De Geest, May 15 1998
More terms from Robert G. Wilson v, Aug 05 2005

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

Original entry on oeis.org

4, 7, 9, 9, 39, 47, 57, 81, 111, 123, 243, 283, 287, 313, 407, 507, 807, 1057, 1209, 1211, 1443, 1447, 1619, 2019, 2269, 2429, 2637, 2679, 2751, 3007, 3287, 3789, 3829, 3833, 3949, 4151, 4533, 4821, 5097, 5331, 5457, 5529, 5691, 6021, 6153, 6393, 6409
Offset: 1

Views

Author

Patrick De Geest, May 15 1998

Keywords

Crossrefs

Cf. A069606, A074340, A033680, A033679, A033681, A046255, A046256, A046257, A046258, A046259, A111524.

Programs

  • Mathematica
    a[1] = 4; a[n_] := a[n] = Block[{k = a[n - 1], c = IntegerDigits @ Table[ a[i], {i, n - 1}]}, While[ !PrimeQ[ FromDigits @ Flatten @ Append[c, IntegerDigits[k]]], k ++ ]; k]; Table[ a[n], {n, 47}] (* Robert G. Wilson v, Aug 05 2005 *)

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

Original entry on oeis.org

6, 7, 7, 9, 27, 59, 69, 181, 201, 257, 267, 399, 573, 603, 861, 901, 923, 1021, 1133, 1239, 1251, 1519, 1589, 1729, 1863, 1901, 2541, 3001, 3017, 3049, 3243, 4407, 4481, 5457, 5839, 5889, 5919, 6159, 6201, 6293, 6577, 6603, 6969, 7217, 8131, 8981, 9033
Offset: 1

Views

Author

Patrick De Geest, May 15 1998

Keywords

Links

Crossrefs

Cf. A069608, A074342, A033680, A033679, A033681, A046254, A046255, A046257, A046258, A046259, A111524.

Programs

  • Mathematica
    a[1] = 6; a[n_] := a[n] = Block[{k = a[n - 1], c = IntegerDigits @ Table[ a[i], {i, n - 1}]}, While[ !PrimeQ[ FromDigits @ Flatten @ Append[c, IntegerDigits[k]]], k ++ ]; k]; Table[ a[n], {n, 47}] (* Robert G. Wilson v, Aug 05 2005 *)
nxt[{j_,a_}]:=Module[{k=a},While[!PrimeQ[j*10^IntegerLength[k]+k], k++];{j*10^IntegerLength[k]+k,k}]; Transpose[NestList[nxt,{6,6},50]][[2]] (* Harvey P. Dale, May 07 2016 *)
  • Python
    from sympy import isprime
def aupton(terms):
  alst, astr = [6], "6"
  for n in range(2, terms+1):
    an = alst[-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

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

Original entry on oeis.org

8, 9, 23, 51, 69, 81, 93, 129, 169, 179, 181, 273, 321, 321, 449, 639, 769, 857, 1047, 1213, 1233, 1443, 1587, 1637, 1953, 2433, 2599, 2639, 2901, 3261, 3681, 4059, 5109, 5169, 5407, 5691, 6149, 6531, 7939, 8081, 8211, 8439, 8589, 8623, 8663, 8757, 9459
Offset: 1

Views

Author

Patrick De Geest, May 15 1998

Keywords

Links

Crossrefs

Cf. A069610, A074344, A033680, A033679, A033681, A046254, A046255, A046256, A046257, A046259, A111524.

Programs

  • Maple
    A[1]:= 8: A[2]:= 9: x:= 89:
for n from 3 to 100 do
  for y from A[n-1] by 2 do
    z:= x*10^(1+ilog10(y))+y;
    if isprime(z) then break fi;
  od:
  A[n]:= y;
  x:= z;
od:
seq(A[i],i=1..100); # Robert Israel, May 30 2018
  • Mathematica
    a[1] = 8; a[n_] := a[n] = Block[{k = a[n - 1], c = IntegerDigits @ Table[ a[i], {i, n - 1}]}, While[ !PrimeQ[ FromDigits @ Flatten @ Append[c, IntegerDigits[k]]], k ++ ]; k]; Table[ a[n], {n, 47}] (* Robert G. Wilson v, Aug 05 2005 *)
nxt[{jp_,a_}]:=Module[{k=a},While[CompositeQ[jp 10^IntegerLength[k]+k],k++];{jp 10^IntegerLength[k]+ k,k}]; NestList[nxt,{8,8},50][[;;,2]] (* Harvey P. Dale, Apr 10 2024 *)

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

Original entry on oeis.org

10, 13, 23, 49, 111, 113, 171, 211, 293, 309, 309, 469, 639, 759, 951, 1037, 1057, 1083, 1257, 1269, 1287, 1341, 1551, 1637, 1677, 1981, 1989, 2021, 2059, 2357, 2583, 2697, 2967, 3289, 6789, 7073, 7323, 7369, 7463, 7501, 7709, 7869, 8029, 8069, 8077, 8519
Offset: 1

Views

Author

Patrick De Geest, Zak Seidov and Robert G. Wilson v, Aug 05 2005

Keywords

Links

Crossrefs

Cf. A111525, A074346, A033680, A033679, A033681.
Cf. A046254, A046255, A046256, A046257, A046258, A046259.

Programs

  • 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 *)
  • 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

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

Original entry on oeis.org

5, 9, 9, 21, 53, 67, 71, 87, 87, 91, 117, 161, 187, 213, 363, 419, 501, 537, 543, 739, 879, 1101, 1329, 1391, 1641, 1939, 2093, 2109, 2331, 2557, 2639, 2697, 2863, 3441, 3441, 4413, 4461, 4479, 4557, 5489, 6033, 6267, 6351, 6973, 7181, 7459, 7679, 8113, 8241
Offset: 1

Views

Author

Patrick De Geest, May 15 1998

Keywords

Links

Crossrefs

Cf. A069607, A074341, A033680, A033679, A033681, A046254, A046256, A046257, A046258, A046259, A111524.

Programs

  • Maple
    R:= 5: p:= 5: x:= 5:
for count from 2 to 100 do
  for y from x by 2 do
    if isprime(10^(1+ilog10(y))*p+y) then
      R:= R, y; p:= 10^(1+ilog10(y))*p+y; x:= y;
      break
    fi
od od:
R; # Robert Israel, Nov 22 2020
  • Mathematica
    a[1] = 5; a[n_] := a[n] = Block[{k = a[n - 1], c = IntegerDigits @ Table[ a[i], {i, n - 1}]}, While[ !PrimeQ[ FromDigits @ Flatten @ Append[c, IntegerDigits[k]]], k += 2]; k]; Table[ a[n], {n, 49}] (* Robert G. Wilson v, Aug 05 2005 *)
  • Python
    from sympy import isprime
def aupton(terms):
  alst, astr = [5], "5"
  while len(alst) < terms:
    an = alst[-1]
    while an%5 ==0 or not isprime(int(astr + str(an))): an += 2
    alst, astr = alst + [an], astr + str(an)
  return alst
print(aupton(49)) # Michael S. Branicky, May 09 2021

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

Original entry on oeis.org

9, 11, 21, 21, 23, 33, 37, 93, 119, 129, 133, 147, 293, 321, 429, 433, 497, 627, 661, 897, 1161, 1187, 1197, 1711, 1769, 1807, 2097, 2099, 4143, 4149, 4197, 4587, 4587, 5629, 5711, 5889, 6153, 6351, 6399, 6511, 6651, 7179, 7563, 7661, 8071, 8163, 9663
Offset: 1

Views

Author

Patrick De Geest, May 15 1998

Keywords

Crossrefs

Cf. A069611, A074345, A033680, A033679, A033681, A046254, A046255, A046256, A046257, A046258, A111524.

Programs

  • Mathematica
    a[1] = 9; a[n_] := a[n] = Block[{k = a[n - 1], 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, Aug 05 2005 *)
Showing 1-10 of 11 results. Next

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.