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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A069610 a(1) = 8; a(n) = smallest number such that the juxtaposition a(1)a(2)...a(n) is a prime. 22
8, 3, 9, 11, 7, 21, 23, 3, 7, 29, 3, 99, 9, 93, 1, 39, 33, 21, 137, 123, 57, 13, 191, 3, 163, 9, 143, 63, 21, 157, 521, 163, 161, 43, 161, 109, 107, 121, 423, 57, 71, 7, 173, 469, 107, 57, 177, 411, 49, 149, 61, 291, 413, 271, 299, 693, 349, 149, 73, 299, 271, 521 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
EXAMPLE
a(4) = 11 and the number 83911 is a prime.
MATHEMATICA
a[1] = 8; 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}] (* Robert G. Wilson v, Aug 05 2005 *)
PROG
(Python)
from sympy import isprime
def aupton(terms):
alst, astr = [8], '8'
for n in range(2, terms+1):
an = 1
while not isprime(int(astr + str(an))): an += 2
alst, astr = alst + [an], astr + str(an)
return alst
print(aupton(62)) # Michael S. Branicky, Aug 03 2021
CROSSREFS
Sequence in context: A200614 A011467 A246671 * A257811 A122159 A365445
KEYWORD
nonn,base
AUTHOR
Amarnath Murthy, Mar 26 2002
EXTENSIONS
More terms from Jason Earls, Jun 13 2002
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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 29 07:27 EDT 2024. Contains 371265 sequences. (Running on oeis4.)