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!)
A334885 Let q = p | p' be the digit concatenation of a prime p with its prime successor. If the result is a prime repeat the construction setting p = q. a(n) is the smallest prime for which this can be repeated exactly n times. 0
3, 2, 13681, 467, 127787377, 200603842261 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,1
COMMENTS
a(6) > 10^13.
LINKS
Carlos Rivera, Puzzle 29. P_i = P_(i-1) & nxtprm(P_(i-1)), P_i = prime for i => 1, The Prime Puzzles and Problems Connection.
EXAMPLE
Let "|" denote concatenation.
3 | 5 = 35, which is not prime, so a(0) = 3.
2 | 3 = 23 (prime), 23 | 29 = 2329 (composite), so a(1) = 2.
13681 | 13687 (prime), 1368113687 | 1368113699 (prime), 13681136871368113699 | 13681136871368113711 (composite), so a(2) = 13681.
MATHEMATICA
a[n_] := Block[{pp=1, p, q, c=-1}, While[ c!=n, c=0; p = pp = NextPrime@ pp; While[ PrimeQ[ q = FromDigits[ Join @@ IntegerDigits@{p, NextPrime@ p}]], c++; p = q]]; pp]; a /@ Range[0, 3]
CROSSREFS
Sequence in context: A354386 A036113 A226840 * A318330 A199261 A110492
KEYWORD
nonn,base,more
AUTHOR
Giovanni Resta, May 14 2020
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 11:45 EDT 2024. Contains 371278 sequences. (Running on oeis4.)