The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A309191 a(n) is the least prime such that each concatenation of 1 <= k <= n consecutive primes beginning with a(n) is prime, or 0 if no such prime exists. 1
 2, 2, 31, 4603, 910307, 352367441, 23908162969, 483148266971 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS Carlos Rivera, Puzzle 708 Find sets of k consecutive primes such that ..., The Prime Puzzles & Problems Connection. EXAMPLE a(2)=2; 2, 3 are 2 consecutive primes and their concatenation 23 is also prime. a(3)=31 since 31, 37, and 41 are 3 consecutive primes and 3137 and 313741 are both prime. MATHEMATICA a[n_] := Block[{p = Prime@ Range@ n}, While[! AllTrue[Range[2, n], PrimeQ@ FromDigits@ Flatten@ IntegerDigits@ Take[p, #] &], p = Append[ Rest@ p, NextPrime@ Last@ p]]; p[[1]]]; Array[a, 5] (* Giovanni Resta, Jul 16 2019 *) CROSSREFS Cf. A030996. Sequence in context: A343172 A276821 A267726 * A303568 A121788 A018976 Adjacent sequences:  A309188 A309189 A309190 * A309192 A309193 A309194 KEYWORD nonn,base,more AUTHOR Jean-Marc Rebert, Jul 16 2019 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified September 27 03:05 EDT 2021. Contains 347673 sequences. (Running on oeis4.)