The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A236670 Start with 6; thereafter, primes obtained by concatenating to the end of previous term the next smallest number that will produce a prime. 0
6, 61, 613, 6131, 613141, 61314119, 6131411917, 61314119171, 6131411917181, 613141191718127, 61314119171812789, 613141191718127893, 61314119171812789379, 6131411917181278937929, 61314119171812789379291, 61314119171812789379291111 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
a(n+1) is the next smallest prime beginning with a(n). Initial term is 6. After a(1), these are the primes arising in A069608.
LINKS
EXAMPLE
a(1) = 6 by definition.
a(2) is the next smallest prime beginning with 6, so a(2) = 61.
a(3) is the next smallest prime beginning with 61, so a(3) = 613.
PROG
(Python)
import sympy
from sympy import isprime
def b(x):
..num = str(x)
..n = 1
..while n < 10**3:
....new_num = str(x) + str(n)
....if isprime(int(new_num)):
......print(int(new_num))
......x = new_num
......n = 1
....else:
......n += 1
b(6)
CROSSREFS
Sequence in context: A152281 A053462 A160751 * A142970 A034659 A369509
KEYWORD
nonn,base
AUTHOR
Derek Orr, Jan 29 2014
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 May 23 11:57 EDT 2024. Contains 372763 sequences. (Running on oeis4.)